Learn Before
Flat Dense Retrieval Baseline in Strict-Parity Prerequisite Retrieval
Fixed-Depth Hierarchical Baseline in Strict-Parity Prerequisite Retrieval
CPU-Only Latency Protocol (Apple M4 Max, Caches Disabled, 200 Measured Queries After Warm-Up, Three Repeats)
Method Part 3: Adaptive Depth Gating for Prerequisite Retrieval (Auditable Strict-Parity Graph-RAG Paper)
Latency And End-To-End Diagnostics (Results) in Auditable Strict-Parity Evaluation of Prerequisite-Graph Retrieval for RAG under Leakage Controls
Latency Table Compares Flat Dense, Hierarchical Baseline, and Adaptive (Heuristic) Per Dataset
The paper's headline latency table reports mean latency per query in milliseconds for exactly three retrieval systems under the CPU-only protocol: Flat dense, Hierarchical baseline, and Adaptive (heuristic). Rows are indexed by dataset, so each dataset gets one timing per system. The three-column choice mirrors the headline strict-parity retrieval table (flat dense vs. fixed-depth hierarchical baseline vs. adaptive depth gating), so compute cost is reported for the same systems whose retrieval quality is compared, not for an unrelated set of comparators.
0
1
Tags
Science
Auditable Strict-Parity Evaluation of Prerequisite-Graph Retrieval for RAG under Leakage Controls
Related
Latency Table Compares Flat Dense, Hierarchical Baseline, and Adaptive (Heuristic) Per Dataset
Latency Table Compares Flat Dense, Hierarchical Baseline, and Adaptive (Heuristic) Per Dataset
Graph-Based Retrieval Runs at ~7 ms per Query on Curated Prerequisite DAGs (CPU-Only)
Latency Table Compares Flat Dense, Hierarchical Baseline, and Adaptive (Heuristic) Per Dataset
Retrieval-Stage Constants Table for Hierarchical Prerequisite RAG Experiments
Latency Table Compares Flat Dense, Hierarchical Baseline, and Adaptive (Heuristic) Per Dataset
Graph-Based Retrieval Runs at ~7 ms per Query on Curated Prerequisite DAGs (CPU-Only)
Latency Table Compares Flat Dense, Hierarchical Baseline, and Adaptive (Heuristic) Per Dataset