High-precision retrieval over external knowledge bases is essential for LLM agents to operate effectively. However, existing Information Retrieval (IR) research primarily optimizes query-side retrievers (e.g., ColBERT, BGE) and generators (e.g., Self-RAG, GraphRAG), while reducing corpus-side representation to chunking. This leaves index-side quality an underexplored lever. We propose Pre-Retrieval Index Modeling & Enhancement (PRIME), an index-side optimization framework built on two complementary tracks: an LLM-driven Semantic Restructuring (SR) track that transforms long documents into structured, information-dense sections, and a deterministic Metadata Synthesis (MS) and Hierarchical Retrieval (HR) track that extracts semantic anchors and heading structure for coarse-to-fine section retrieval. Our evaluations show that deterministic metadata matches structure-aware chunking's retrieval quality while cutting embedding computation by 45.8 × and index vector count by 22.4 ×. On top of these gains, Semantic Restructuring (SR) further improves Answer-F1 by 13.7% in full deployment, with characterized quality-fidelity-cost trade-offs. Across QASPER, BRIGHT, and NFCorpus, we further characterize three qualitative regimes that determine whether index-side optimization helps or degrades retrieval, while showing that these index-side effects are neutralized under a strong reranker.
Figures & tables
Figure 1: Overview of Index-Side Optimization. PRIME operates on the corpus representation prior to indexing, complementing existing query-side and generator-side methods without modifying the retriever.
Figure 2: PRIME architecture. The framework operates on two complementary tracks: (Left) an LLM-driven Semantic Restructuring track transforms documents into knowledge-dense representations; (Right) a deterministic track uses Metadata Synthesis to extract structural anchors, which power a Hierarchical Retrieval pipeline with RRF fusion and cross-encoder reranking.
Method
NDCG5
NDCG10
Recall5
Precision5
P1
MRR
Raw (chunk-256)
0.391
0.405
0.462
0.092
0.306
0.373
BGE-M3 (1024-dim)
0.389
0.398
0.453
0.091
0.306
0.371
Summary-Augmented
0.398
0.411
0.471
0.094
0.309
0.379
RAPTOR-lite
0.391
0.408
0.461
0.092
0.307
0.375
PRIME (offline) (ours)
0. 396
0.409
0.469
0.094
0.309
0.377
Structure-chunks
0.396
0.411
0.466
0.093
0.310
0.379
Table 1: Retrieval quality on QASPER 416 (1,451 queries). BGE-M3 uses chunk-256 max-pooling; Summary-Augmented prepends section summaries to chunks; RAPTOR-lite does section+window retrieval without LLM summarization. Structure-chunks is a simpler H2-aware chunking baseline (no MS metadata, no HR pipeline). PRIME (Full) is excluded because SR alters the BM25-indexed text, breaking the shared-pipeline condition.
Index Representation
Dense-only
Hybrid (BM25+Vec+RRF)
Hybrid+CE
Raw (chunk-256)
0.175 [.164,.186]
0.311 [.296,.327]
0.391 [.370,.412]
Structure-chunks
0.201 [.187,.216]
0.338 [.321,.354]
0.396 [.375,.416]
PRIME (offline)
0.201 [.186,.217]
0.332 [.315,.349]
0.396 [.375,.416]
SR (full-text)
0.208 [.196,.221]
0.245 [.232,.258]
0.328 [.309,.347]
PRIME (Full)
0.214 [.199,.229]
0.241 [.227,.256]
0.325 [.307,.345]
Table 2: Factorial ablation: NDCG@5 on QASPER 416. 95% paired bootstrap CIs in brackets. All configurations share identical retrieval pipelines; only the indexed text varies between rows. The five index representations and three retrieval pipelines are defined in Preliminary.
Tasks
BGE-small (baseline)
PRIME (offline)
Δ NDCG@5
95% CI ( Δ )
NDCG@5
P@5
R@5
NDCG@5
P@5
R@5
Pony
0.067
0.073
0.048
0.185
0.154
0.126
+175.6%
[−0.063,+0.299]
Biology
0.379
0.128
0.491
0.464
0.155
0.598
+22.3%
[−0.188,+0.357]
Stackoverflow
0.234
0.075
0.359
0.272
0.079
0.363
+16.2%
[−0.203,+0.279]
Robotics
0.181
0.052
0.253
0.200
0.059
0.282
+10.5%
[−0.250,+0.290]
Economics
0.247
0.070
0.333
0.258
0.074
0.354
+4.6%
[−0.242,+0.265]
Table 3: Cross-domain retrieval on the eight BRIGHT structured tasks. Δ = (PRIME-Baseline)/Baseline; 95% CIs from 10,000-sample paired bootstrap (BCa) over per-query NDCG@5. Per-task CIs span zero (65-103 queries/task), so individual task deltas are not independently significant; the +6.9% macro-average reflects a distributional shift across domains rather than a per-task claim. TheoremQA-Theorems (PRIME NDCG@5 = 0.012, Δ = -59.8%) is excluded from this average.
Method
NDCG@5
P@5
R@5
MRR
BM25
0.350
0.295
0.119
0.530
BGE-small
0.374
0.324
0.121
0.538
BGE-base
0.387
0.336
0.126
0.561
PRIME
0.301
0.264
0.084
0.460
PRIME (FT)
0.366
0.316
0.118
0.540
Δ1
-19.5%
-18.5%
-30.6%
-14.5%
Table 4: Retrieval quality on the full NFCorpus. Graded relevance 0–2 binarized at ≥1 . PRIME(FT) denotes PRIME (Full-Text), Δ1 denotes PRIME vs BGE-small and Δ2 denotes PRIME (Full-Text) vs BGE-small.
Table 5: SR causal chain: text density and evidence localization (QASPER 416). Panel A uses fixed raw-corpus reference IDF. Panel B uses section qrels from gold evidence spans mapped to H2 sections, averaged over the 708 shared queries of Raw and SR section qrels to avoid survivor bias.
Table 6: SR fidelity audit on QASPER. Panel A: a span is retained if its character-level content appears verbatim in the SR block. Panel B uses spaCy en_core_web_sm. Panel C uses roberta-large-mnli.
Retrieval-augmented generation (RAG) grounds language models in external corpora. Agentic RAG enables iterative search, yet exposes the model to isolated chunks without document structure, making it difficult to distinguish relevant evidence from chunks that merely resemble the query. Structure-aware methods such as PageIndex navigate document structure but cannot scale to the structures of large corpora, which do not fit in the LLM context. Hence, they first commit to a single document using a document retriever and cannot recover from a wrong choice. We propose RIT-RAG (Retrieval-Induced Tree RAG), which combines content retrieval with structural navigation. Offline, RIT-RAG builds a tree for each document from its table of contents or sitemap. At query time, it retrieves a broad set of chunks and uses their positions to induce manageable sub-trees, potentially across multiple documents. An LLM agent navigates these sub-trees, selectively reads promising nodes, and reformulates queries when needed. Thus, retrieval proposes where to look, while the agent decides what to read. Across financial, scientific, and customer-support benchmarks, RIT-RAG achieves the highest answer accuracy among vanilla, graph-based, and agentic baselines. On EntQABench, our new benchmark of 2.84 million technical-documentation webpages, it improves accuracy by 6.8 to 11.4 points over the strongest baseline across three LLMs.
Retrieval-augmented generation (RAG) systems depend critically on how documents are chunked and searched. Fine-grained chunks can improve retrieval precision but expand the search space, increasing latency and cost; larger chunks reduce the number of candidates but make dense similarity less reliable, as the representation for each chunk mixes multiple topics and introduces more semantic noise. This trade-off becomes especially limiting in deep research tasks, where retrieval must be both fast and precise across large, heterogeneous corpora. We introduce MCompassRAG, a metadata-guided retrieval framework that uses topic-level signals as a semantic compass for selecting relevant evidence. Instead of relying only on cosine similarity between queries and noisy chunk embeddings, MCompassRAG enriches chunk representations with topic metadata in the same embedding space and trains a lightweight retriever through LLM-teacher distillation. At inference time, MCompassRAG performs topic-aware retrieval without additional LLM calls, improving both efficiency and evidence quality. Across six complex retrieval benchmarks, MCompassRAG improves information efficiency (IE) by 8.24% on average with over 5 times lower latency than the strongest efficient RAG baselines. Code is available on https://github.com/AmirAbaskohi/MCompassRAG.
Amirhossein Abaskohi, Raymond Li, Gaetano Cimino +3
University of British Columbia · University of Salerno · ServiceNow Research
Retrieving external knowledge is essential for solving real-world tasks, yet it remains challenging when the relationship between a query and its relevant knowledge involves implicit and complex reasoning beyond surface-level semantic or lexical matching (e.g., mathematical problems relying on the same theorem or coding requiring deep reasoning). Existing approaches primarily rely on query-side reasoning (e.g., query rewriting), which introduces significant online latency and underutilizes the opportunity to perform reasoning over the knowledge corpus itself (i.e., index-side reasoning). In this paper, we propose RL-Index, an agentic indexing framework that formulates retrieval index reasoning as a reinforcement learning problem. Instead of performing reasoning at query time, RL-Index shifts reasoning to the indexing stage by augmenting documents with LLM-generated rationales that explicitly encode the latent query-knowledge relationship. To optimize the quality of these rationales, we employ Group Relative Policy Optimization (GRPO) and use retrieval similarity as a verifiable reward signal, enabling direct optimization of indexing decisions for retrieval effectiveness. Extensive experiments on the BRIGHT benchmark demonstrate that RL-Index consistently improves both retrieval and downstream question-answering performance, while significantly reducing online inference latency. Moreover, the learned rationale augmentation generalizes across diverse retrievers and generators, highlighting its robustness as a plug-and-play indexing strategy across different retrieval systems.