Graph-Based Retrieval Runs at ~7 ms per Query on Curated Prerequisite DAGs (CPU-Only)
On the paper's curated prerequisite DAGs, the graph-based retrieval methods run in roughly ms per query on CPU-only hardware under the paper's latency protocol. Because all retrieval methods compared in the paper remain inexpensive at this scale, compute cost is not the binding constraint on graph-aware retrieval in this setting.
0
1
Tags
Science
Auditable Strict-Parity Evaluation of Prerequisite-Graph Retrieval for RAG under Leakage Controls
Related
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
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