Concept

ColBERTv2/RePlug Reranking Baseline for Strict-Parity Prerequisite Retrieval

ColBERTv2/RePlug reranking is included as a non-graph reranking baseline in this paper's strict-parity baseline set for prerequisite retrieval. The dense seed pool produced by the shared query encoder is reranked using a ColBERTv2 late-interaction scorer and/or a RePlug-style retrieval-augmented scorer over the same candidate concepts. Under the strict-parity contract, this baseline shares the same encoder, m/km/k budgets, split, and exact-ID matching rule as the other compared systems, so any reported difference is attributable to the reranking step rather than to an interface change. It serves as the comparison point for whether neural reranking — without graph traversal — closes the gap to hierarchical prerequisite retrievers.

0

1

Updated 2026-05-17

Contributors are:

Who are from:

Tags

Science

Auditable Strict-Parity Evaluation of Prerequisite-Graph Retrieval for RAG under Leakage Controls