Concept icon
Concept

Adaptive Depth Gating for Prerequisite Retrieval

Adaptive depth gating is a per-query controller that sets the ancestor traversal depth d↑d_\uparrow and descendant traversal depth d_downarrow as a function of the hierarchy level ℓ(v⋆)\ell(v^\star) of the top dense seed and the dense-score contrast Δ=s1−s5\Delta = s_1 - s_5 between the top and fifth dense scores. From base depths d↑(0)d_\uparrow^{(0)} and d_downarrow^{(0)}, the controller adds an indicator when ℓ(v⋆)\ell(v^\star) is high (pushing d↑d_\uparrow up) or low (pushing d_downarrow up), and adds an indicator when Δ\Delta is large (more upward depth) or small (more downward depth), with floors of 11 and 00 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

Concept icon
Updated 2026-05-17

Contributors are:

Who are from:

Tags

Science

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