Adaptive Depth Gating for Prerequisite Retrieval
Adaptive depth gating is a per-query controller that sets the ancestor traversal depth and descendant traversal depth d_downarrow as a function of the hierarchy level of the top dense seed and the dense-score contrast between the top and fifth dense scores. From base depths and d_downarrow^{(0)}, the controller adds an indicator when is high (pushing up) or low (pushing d_downarrow up), and adds an indicator when is large (more upward depth) or small (more downward depth), with floors of and respectively. Across the studied benchmarks (LectureBank-Full, QASC, HotpotQA boundary probe), adaptive gating remains statistically tied to a fixed-depth hierarchical baseline once interfaces and splits are matched, so it is treated as an optional extension rather than a core claim.
0
1
Tags
Science
Auditable Strict-Parity Evaluation of Prerequisite-Graph Retrieval for RAG under Leakage Controls
Learn After
Method Details for Adaptive Depth Gating for Prerequisite Retrieval (Auditable Strict-Parity Graph-RAG Paper)
Evaluation Evidence for Adaptive Depth Gating for Prerequisite Retrieval (Auditable Strict-Parity Graph-RAG Paper)
Scope Notes for Adaptive Depth Gating for Prerequisite Retrieval (Auditable Strict-Parity Graph-RAG Paper)