Aurélien Pellet, Julien Perez, Marie Puren
Rigorous, honest, practically sensible RAG contribution, but evaluated on a single corpus with corpus-specific components and only incremental novelty over Adaptive-RAG.
Retrieval-Augmented Generation (RAG) pipelines typically rely on a fixed indexing and retrieval configuration determined at preprocessing time. This one-size-fits-all design is ill-suited to domain-expert settings, where heterogeneous queries require different chunking granularities, metadata constraints, and source-selection strategies. As a result, configurations that are effective for one family of queries often perform poorly for others. In this paper, we introduce ORDER (Optimal Routing for Dynamic Evidence Retrieval), a query-conditioned RAG framework that jointly adapts indexing and retrieval to the incoming query. Our approach first discovers semantic clusters over a given set of questions associated to a corpus and learns, for each cluster, a chunking strategy together with a suited metadata filtering and reranking configuration. At inference time, queries are routed to the appropriate pre-built index through nearest-centroid assignment. To further improve retrieval, we propose a supervised query router (QRe) that predicts which collections are most likely to contain relevant evidence, coupled with a Uniform Multi-source Sampler (UMS) that allocates the retrieval budget evenly across the selected sources. We evaluate our framework on large-scale, heterogeneous historical archives and show that conditioning both indexing and retrieval on the query consistently outperforms both naive baselines and strong state-of-the-art RAG systems in complex expert-domain environments.
Core Contribution. ORDER proposes a query-conditioned RAG framework tailored to heterogeneous, size-imbalanced expert corpora (here, 19th-century French parliamentary debates and newspapers). It has two distinct pieces: (1) a *retrieval-time* mechanism combining a supervised query router (QRe, a logistic regression over query embeddings predicting which collections hold evidence) with a Uniform Multi-source Sampler (UMS) that splits the retrieval budget evenly across surviving collections; and (2) an *indexing-time* mechanism that clusters training questions and learns per-cluster chunking and metadata strategies, routed at inference by nearest-centroid assignment. The central framing—that RAG optimization should split into an offline document-conditioned axis and an online query-conditioned axis—is clean and well-motivated. The identified failure modes (source *contamination* vs. source *starvation*) are a genuinely useful conceptual decomposition for imbalanced multi-collection retrieval.
Methodological Rigor. This is the paper's strongest dimension. The evaluation uses a fixed 50/50 split, 5 seeds, Bonferroni-corrected paired t-tests, and strong, current baselines (BM25, HippoRAG v2, LinearRAG, Adaptive Chunking), all run from authors' reference implementations on the same evidence units. The cost analysis (Table 7) is thorough and fair, showing ORDER is LLM-free at index and query time while outperforming graph-RAG systems that incur heavy generative indexing. Notably, the paper reports and rigorously dissects a *negative* result: task-conditioned chunking gains vanish once routing is active, because both act on the same newspaper-only questions through the same noise-suppression channel (Table 15 shows the residual is statistically zero). This intellectual honesty raises confidence in the rest. The Limitations section is unusually candid—transfer is argued, not demonstrated; a single corpus, single time period, single embedding family, single answer model doubling as judge.
Potential Impact. Moderate and somewhat bounded. The QRe+UMS idea is simple and could be adopted as a drop-in for enterprise/archival RAG over imbalanced collections, and the falsifiable preconditions for when it should help (size imbalance + question-predictable source relevance) are a useful practitioner heuristic. However, the core methods are combinations of standard tools (UMAP, HDBSCAN, logistic regression, cosine retrieval), and the most striking numbers (e.g., +0.190 Coverage@3 on the largest cluster) are corpus-specific. The paper's own analysis suggests some gains stem from dataset-specific lexical cues and possibly LLM-generated question artifacts that inflate dense retrieval. Real influence is likely concentrated in the digital-humanities/historical-QA niche plus practitioners facing multi-source imbalance.
Timeliness & Relevance. High. Adaptive/routed RAG, query-conditioned retrieval, and graph-RAG comparisons are all active 2024–2026 topics. The demonstration that heavy graph-RAG systems (HippoRAG v2, LinearRAG) actually fall *below* a naive dense baseline on noisy, heterogeneous archives is a timely and somewhat provocative empirical point.
Strengths & Limitations. Strengths: rigorous, honest, reproducible (code, splits, fitted artifacts released), strong baselines, insightful failure-mode decomposition, and a well-analyzed negative result. Limitations: single-corpus evaluation with explicitly non-transferable corpus-specific components (regex chunking rules drafted by Claude Opus, per-cluster maps); thin end-to-end evaluation (one model as both generator and judge, no human adjudication, no prompt-sensitivity study); benchmark questions LLM-generated (though historian-filtered), which the authors admit may inflate dense-retrieval scores and depress BM25; dependence on a commercial embedding API limits comparability. The methodological novelty is incremental relative to Adaptive-RAG (query routing by predicted property) and existing adaptive-chunking work.
Other observations. The dataset itself (HistoriQA-ThirdRepublic) is a companion contribution from a separate paper, so ORDER inherits rather than creates the benchmark. The genuinely interdisciplinary framing (NLP + historical scholarship) is a plus but also narrows the immediate audience. Reproducibility is strong on paper but gated behind paid APIs.
Overall, this is a solid, well-executed applied-RAG paper with commendable rigor and honesty, but bounded generality and modest conceptual novelty. It will be a useful reference within its subfield rather than a field-shaping contribution.
Generated Sep 16, 2026
Rigorous, honest, practically sensible RAG contribution, but evaluated on a single corpus with corpus-specific components and only incremental novelty over Adaptive-RAG.