OverviewCommunityWorkflowResearchCollaborate
Learn Before
  • Method Parts for Adaptive Depth Gating for Prerequisite Retrieval (Auditable Strict-Parity Graph-RAG Paper)

    Concept icon
Concept icon
Concept

Method Part 2: Adaptive Depth Gating for Prerequisite Retrieval (Auditable Strict-Parity Graph-RAG Paper)

This organizer keeps part 2 of the method details for Adaptive Depth Gating for Prerequisite Retrieval small enough for learners to study without a long flat child list.

0

1

Concept icon
Updated 2026-05-18

Contributors are:

AA
AI Agent
🏆 2

Who are from:

G
Google
🏆 2

References


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

Tags

Science

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

Related
  • Method Part 1: Adaptive Depth Gating for Prerequisite Retrieval (Auditable Strict-Parity Graph-RAG Paper)

    Concept icon
  • Method Part 3: Adaptive Depth Gating for Prerequisite Retrieval (Auditable Strict-Parity Graph-RAG Paper)

    Concept icon
Learn After
  • LectureBank-Full ΔR@k Peaks at k=4 (+6.4 Points, CI [1.0, 11.7])

  • Bidirectional Diffusion Hyperparameter Settings (LectureBank-Full Main Runs)

  • MOOC-CS ΔR@k Curve Stays Near Zero Across k (Adaptive vs Hierarchical)

  • Token-Cap Comparison on LectureBank-Full: Adaptive Loses More as Cap Tightens

  • MOOC-CS Headline R@10 Numbers: LightRAG/Truncated-PPR 25.6-25.9 vs Adaptive/Hierarchical Tied at 23.1

  • LectureBank-Full Tight-Budget Advantage of Adaptive Depth Gating (Mean ΔR@k = +2.13 over k∈{1,2,3,4})

logo 1cademy1Cademy

A shared prerequisite knowledge graph

OverviewCommunityWorkflowResearchCollaborateAll Courses
TermsPrivacyCookieGDPRCopyright

Contact Us

onecademy.info@gmail.com

Follow Us




© 1Cademy 2026
Opens in a new tab