LLM-Oriented Information Retrieval A Denoising-First Perspective
#LLM-Oriented Information Retrieval: A Denoising-First Perspective
Lu Dai ldaiae@connect.ust.hk Hong Kong University of Science and Technology Hong Kong SAR, Hong Kong
#Ziyang Rao Hong Kong University of Science and Technology (Guangzhou) Guangzhou, China
#Abstract
Modern information retrieval (IR) is no longer consumed primarily by humans but increasingly by large language models (LLMs) via retrieval-augmented generation (RAG) and agentic search. Unlike human users, LLMs are constrained by limited attention budgets and are uniquely vulnerable to noise; misleading or irrelevant information is no longer just a nuisance, but a direct cause of hallucinations and reasoning failures. In this perspective paper, we argue that denoising—maximizing usable evidence density and verifiability within a context window—is becoming the primary bottleneck across the full information access pipeline. We conceptualize this paradigm shift through a four-stage framework of IR challenges: from inaccessible to undiscoverable, to misaligned, and finally to unverifiable. Furthermore, we provide a pipeline-organized taxonomy of signal-to-noise optimization techniques, spanning indexing, retrieval, context engineering, verification, and agentic workflow. We also present research works on information denoising in domains that rely heavily on retrieval such as lifelong assistant, coding agent, deep research, and multimodal understanding.
- Information systems → Retrieval tasks and goals; Retrieval models and ranking; • Computing methodologies → Natural language processing.
This work is licensed under a Creative Commons Attribution 4.0 International License. SIGIR ’26, Melbourne, VIC, Australia © 2026 Copyright held by the owner/author(s). ACM ISBN 979-8-4007-2599-9/2026/07 https://doi.org/10.1145/3805712.3808544
#Liang Sun Hong Kong University of Science and Technology (Guangzhou) Guangzhou, China
#Fanpu Cao Hong Kong University of Science and Technology (Guangzhou) Guangzhou, China
#Cehao Yang Hong Kong University of Science and Technology (Guangzhou) Guangzhou, China
Hao Liu liuh@ust.hk Hong Kong University of Science and Technology (Guangzhou) Guangzhou, China
Hui Xiong xionghui@ust.hk Hong Kong University of Science and Technology (Guangzhou) Guangzhou, China Hong Kong University of Science and Technology Hong Kong SAR, Hong Kong
#Keywords
LLM-oriented information retrieval, information denoising, retrievalaugmented generation, agentic retrieval, faithfulness verification, hallucination mitigation
#1 Introduction
Largelanguage models (LLMs) have emerged as the new consumers of retrieved information and transformed information access. Rather than manually navigating web pages, users increasingly delegate their search, summarization and reasoning tasks to LLM agents [8, 212]. Accordingly, retrieval has become a crucial interleaving step in an LLM-centric task-solving pipeline, supplying the model with external knowledge to use in reasoning or generation. This paradigm – often referred to as retrieval-augmented generation (RAG) – tightly couples search with generation to improve factual coverage and answer quality [89]. As LLMs take on this role of information consumer, the objectives of information retrieval shift. Classic IR research prioritized metrics like recall and precision – focusing on minimizing missed relevant documents and down-ranking irrelevant ones. In LLMmediated systems, however, they are necessary but no longer sufficient. One key bottleneck is verifiability. If the search component fails to find the correct supporting information or retrieves misleading
information, even a powerful LLM cannot produce a correct and verifiable answer. On the one hand, LLM-generated content is flooding the internet corpus itself. The proliferation of hallucinations makes attribution and trust harder than ever before. On the other hand, LLMs are sensitive to noise in context. Studies have found that misleading evidence in the context can be more detrimental to an LLM’s answer quality than missing evidence [3]. These findings highlight that modern retrieval must focus not just on finding more information, but on finding reliable information that the LLM can faithfully use and verify as evidence. Another critical challenge is the limited attention and context capacity of current LLMs. Even with the latest models featuring context windows extended to millions of tokens, LLMs struggle to fully utilize very large contexts, especially in reasoning tasks [16, 103]. Empirical results confirm that beyond a certain point, adding more retrieved passages, especially irrelevant and redundant ones, yields diminishing or even negative returns. Furthermore, noisy or malicious content in the context can actively undermine the model’s reliability [29]. A well-known vulnerability is prompt injection, where adversarially crafted text in the retrieved context hijacks the model’s behavior or injects false information [105]. This highlights that irrelevant or harmful information in the context window isn’t just a waste of computation resources – it can directly degrade output quality or even pose serious risks. These observations suggest that the key challenge of modern retrieval is not to retrieve more but to denoise —to provide concise, highquality context that fits within the model’s attention budget. An LLM-based assistant might call a retriever frequently and aggregate many evidence snippets in one session; even a small fraction of noise can cascade through such a pipeline, leading to grounded hallucinations or degraded performance. While LLMs do exhibit some robustness, it is risky to rely on the model alone to filter out
noise. Instead, the retrieval stage itself should take on the burden of ensuring a high signal-to-noise ratio in the provided context. In this paper, we present the perspective of denoising as the primary challenge for information retrieval in the era of LLM. We first characterize the challenge shift through the history of information retrieval into four stages and validate the importance of denoising with experimental evidence. We then present a comprehensive taxonomy of research efforts on denoising across the whole retrieval-augmented generation pipeline, as well as curating solutions in typical information-intensive and long-context application areas. Finally, we summarize the solutions and limitations of current LLM-oriented information retrieval and propose potential future directions. Through this paper, we hope to shed light on the challenge shift of information retrieval in LLM era towards an emphasis on utility and verifiability, and inspire future innovations in this important research direction.
#2 Challenge shifts in the history of IR
We conceptualize the evolution of IR as a progression of dominant bottlenecks—specific constraints that made information retrieval fail in distinct ways. As illustrated in Figure 1, the field has transitioned through four phases: from information inaccessible to undiscoverable, to misaligned, and finally to unverifiable. Era 1 (Pre-internet): Inaccessible under physical constraints. Before the World Wide Web, the “evidence universe” was inherently local. Information was not primarily unranked, but unreachable —constrained by geography, institutional access, and physical latency. In this era, the dominant bottleneck was availability rather than discoverability; the challenge was not selecting the best document, but physically acquiring any relevant document at all [12]. Era 2 (Web-scale IR): Undiscoverable under indexing scale. The web inverted the bottleneck: information became globally
LLM-Oriented Information Retrieval: A Denoising-First Perspective SIGIR ’26, July 20–24, 2026, Melbourne, VIC, Australia
reachable but overwhelming. The challenge shifted to undiscoverability —valid evidence existed but was buried under an evergrowing, unindexed corpus. In this stage, the core objective became efficient crawling, indexing, and ranking to surface signals from noise at interactive latencies. Apart from relevance, quality estimation emerged as a critical filter, with PageRank leveraging hyperlink structures as a scalable proxy for authority to mitigate web noise [9]. Importantly, this era institutionalized large-scale evaluation infrastructure. Benchmarks and shared tasks (e.g., TREC) normalized reproducible experiments on large collections and anchored the field around measurable improvements under web-scale constraints. Lexical matching (e.g., BM25) became the industrial standard, establishing a robust effectiveness–efficiency frontier that remains relevant today [146]. Era 3 (Neural IR): Misaligned under semantic constraints. Once IR systems could reliably retrieve candidates at scale, the semantic barrier became the primary problem: even when evidence is retrieved, systems may not understand, compose, or reason with it. Besides, lexical overlaps often failed to capture user intent, leaving retrieved documents misaligned with semantic needs. Research works in this era focused on bridging the semantic gap [169]. Dense retrieval reduced the lexical mismatch between queries and relevant documents by learning continuous semantic representations (e.g., DPR) [80]. Neural rankers improved relevance modeling but introduced steep inference costs; late-interaction architectures such as ColBERT offered a structural compromise between cross-encoder fidelity and bi-encoder efficiency [82]. Meanwhile, neural sparse methods (e.g., SPLADE) reframed lexical matching itself as a learnable expansion mechanism, blurring the sparse-dense dichotomy [40]. Generative models also entered relevance modeling: MonoT5 cast reranking as a seq2seq prediction problem, using generative likelihood as a relevance signal [127]. In this era, IR systems began to deeply integrate with other NLP tasks under the retrieval-augmented generation scheme, setting the stage for end-to-end problem solving [70, 89]. Era 4 (LLM-Oriented IR): Unverifiable context overload. We represent the current era not merely as an application shift, but as a fundamental redefinition of the retrieval objective driven by two simultaneous transformations. First, LLMs have turned retrieval from a destination into an input channel. In retrieval-augmented generation, the consumer is no longer a human browsing for links, but a model requiring actionable evidence to drive generation [89, 181]. Retrieval success is thus redefined by downstream utility: a document is only useful if it positively influences the model’s reasoning trace [29, 148]. Second, LLM-generated content is flooding the corpus. As the web becomes saturated with synthetic text, retrieval faces a crisis of epistemic integrity. The recursive training on generated content threatens model collapse [159], creating a homogeneous and potentially adversarial search space where source bias and noise actively compete with factual signals [30]. These shifts expose a fundamental friction: while traditional IR strives for high recall, LLMs struggle to filter the resulting noise from their limited attention span. We identify three intrinsic vulnerabilities where retrieval artifacts directly degrade reasoning: Observation 1: Fragmentation brings in conflicts. Retrieving and assembling snippets from disparate sources often strips away their
original discourse context, such as temporal validity or conditional scope. This de-contextualization creates a "Frankenstein" context where conflicting or outdated information appears semantically relevant. Such semantic noise actively competes with correct evidence for attention, confusing the model’s selection mechanism even when the context length is manageable [175, 204]. Observation 2: Context Dilution. Extended context windows do not guarantee utilization. As the retrieved context grows, useful information becomes buried or "lost-in-the-middle," exhausting the model’s attention budget. This dilution effect often leads to reasoning failures even when the answer is present in the context [7, 103]. Observation 3: Cascading Failures. With the rise of agentic and multistep reasoning workflows, the cost of retrieval errors has escalated. A single misleading or conflicting snippet can propagate through the reasoning chain, converting retrieval noise into compounded hallucinations that undermine the entire task execution [125]. Consequently, we argue that the primary bottleneck in Era 4 has shifted from access to utility. To prevent these upstream noises from disrupting downstream reasoning, the retrieval system must evolve into a noise gate, prioritizing the maximization of signal-to-noise ratio and verifiability over raw recall.
#2.1 Empirical Validation: Noise as Bottleneck
We validated the "denoising-first" perspective using LLaMA-2-7B- Chat on 500 Natural Questions (NQ) samples, each paired with 100 DPR-retrieved passages (labeled as gold or noise). Impact of Context SNR. We systematically vary the signal-to-noise ratio of retrieved context. As shown in Figure 2(a), EM improves monotonically from 47.0% to 61.0% when increasing gold passages from 1 to 5. However, noise erodes this gain rapidly: holding gold passages fixed at 3, adding 2 and 7 noise passages reduces EM to 51.4% and 41.8%, respectively. When a single gold passage is buried among 9 noise passages (SNR = 0.10), EM falls to 26.6%, barely above the closed-book baseline of 23.6%. Pure noise contexts yield only 8.0% EM—far worse than no retrieval—demonstrating that noise actively impairs the model’s parametric memory. Positional Bias vs. Noise. Fixing the context to 1 gold and 9 noise passages while varying the gold passage’s position (Figure 2(b)), we find that noise-induced degradation dominates positional effects. A single gold passage alone achieves 43.2% EM, but adding 9 noise
SIGIR ’26, July 20–24, 2026, Melbourne, VIC, Australia Lu Dai et al.
the signal through iterative retrieval and self-correction. Figure 3 summarizes this taxonomy in a stage-aligned pipeline view.
passages collapses performance to 22.2–26.6% regardless of position. A mild U-shaped positional pattern is visible but dwarfed by the noise effect.
#3 Denoising in LLM-Oriented Retrieval: A Method Taxonomy
#3.1 Controlled Indexing
This subsection surveys controlled indexing—index-time interventions that reduce noise by (i) regulating what enters the retrievable universe and (ii) attaching conditionable representations and metadata (e.g., trust, time, structure, safety) that downstream retrieval and context assembly can reliably exploit. Governed indexing sets the retrieval quality ceiling, as downstream filtering cannot fully eliminate a polluted index’s residual noise and overhead. (1) Provenance and Trust Stratification. Rather than treating the corpus as a monolithic pool, effective denoising begins by stratifying the index based on verifyable provenance. This involves capturing granular metadata—such as publisher authority, extraction timestamps, and cryptographic signatures (e.g., C2PA standards [25])—to enable trust-conditioned retrieval, where the search space can be dynamically restricted to high-credibility strata. A critical challenge in the LLM era is distinguishing human insights from machine-generated content to prevent degradation caused by widespread AI content on the open web [20, 30, 97, 159]. To this end, indexing pipelines must integrate synthetic attribution mechanisms: strictly cataloging proactive watermarks [31, 84]; embedding posthoc detection scores [47, 95, 120] as filterable metadata; and flagging copyrighted or otherwise high-risk content for downstream gating [216, 217]. By operationalizing provenance as an admission criterion rather than an afterthought, the system prevents lowcredibility signals from ever competing for the retriever’s attention. (2) Quality Filtering and Canonicalization. Data filtering is not only important for LLM pretraining, but also for retrieval index building, where even small fractions of irrelevant or low-quality passages have been shown to substantially degrade RAG generation quality [27]. To maximize the information density of the index, this family of methods eliminates semantic redundancy and low-quality artifacts that otherwise act as distractors in the embedding space. Deduplication is one of the levers: surface-form resemblance measures (e.g., MinHash) prune near-duplicates [10, 87], while embedding-based semantic deduplication (e.g., SemDeDup) further collapses paraphrastic clusters that lexical hashing misses [1], ensuring the index stores only canonical prototypes rather than repetitive template variations and preventing budget waste during context assembly. Furthermore, data sanitation pipelines established for LLM pre-training provide transferable primitives for index purification. These techniques span language identification, heuristic filtering, and safety scoring as seen in works like Refined- Web [91, 135, 136, 161, 191]. Adapting these protocols ensures that the retrieval pool is chemically pure, reducing the probability of hallucination-inducing nonsense. (3) Temporal Validity Management. In dynamic environments, semantic relevance no longer implies factual currency, motivating indexing pipelines that treat temporal validity as a first-class admission constraint rather than a static snapshot [130]. Recent designs realize this through time-aware graph structures: VersionRAG and EraRAG maintain explicit version graphs with incremental updates
In the context of LLM-oriented IR, the retrieval objective fundamentally shifts from prioritizing recall to acting as a noise gate. We use noise to refer to any retrieved content that consumes budget (tokens, latency, attention) without helping—or that actively misleads the model. Drawing on the shift described in Section 2, we categorize the primary entry points of noise in LLM-oriented IR into three distinct classes: Corpus-level noise. Noise originates upstream within the knowledge source itself, where indices are increasingly contaminated by duplicates, template spam, or outdated information [97]. Recent studies highlight a growing risk of “spiral” feedback loops, where AI-generated content becomes overrepresented in retrieval pools, potentially destabilizing provenance [20]. Furthermore, even minor injections of adversarial misinformation or low-credibility evidence can severely degrade open-domain QA, as standard retrievers lack the mechanisms to verify truthfulness before indexing [132]. Retriever-level noise. Even with a clean corpus, retrievers introduce noise by surfacing “hard distractors”—passages that are topically relevant but factually non-supporting or misleading [204]. Dense retrievers are particularly prone to these semantic “near misses,” which occupy the embedding space near the query but fail to answer it [3, 28]. Research indicates that these non-informative contexts actively divert the model’s attention, leading to distractioninduced hallucinations and reduced accuracy even when correct evidence is present [103]. Context construction noise. Noise is often amplified in the last mile between retrieval and generation, when candidates are chunked, merged, and ordered into a single prompt. First, structural and positional noise stems from the mismatch between retrieval ranking and LLM attention; naive concatenation often buries critical evidence in the “lost-in-the-middle” zone, rendering it effectively invisible to the model [103, 185]. Second, evidence incoherence arises when the retriever aggregates conflicting or redundant passages; this incoherence increases parametric uncertainty and triggers hallucinations, requiring diversity-aware compression rather than simple concatenation [177, 195]. Third, the retrieval channel introduces adversarial noise via indirect prompt injections, where malicious instructions embedded in untrusted documents hijack the generation logic, breaching the system’s safety alignment [50]. Con-sequently, the IR system must treat evidence assembly as an active denoising stage—responsible for curating, ordering, and sanitizing the prompt—rather than a passive data hand-off. To systematically address these failure modes, we organize our taxonomy of denoising methods aligning with the lifecycle of information flow. The following sections review interventions at the level of Representation (purifying the index), Search (filtering via precision ranking), Context Assembly (optimizing input composition), and Verification (auditing the generative output). Finally, we examine Agentic Loops, where feedback dynamically refines
that avoid costly full rebuilds [67, 215], while STAR-RAG summarizes graph snapshots and T-GRAG attaches temporal edges to disambiguate overlapping versions at query time [90, 233]. The same principle extends to long-context memory, where timeline-based organization links retrieved episodes to their validity windows and curbs recency bias [128]. (4) Structure as a Defense to Noise. Flat indexing strips text of its relational and hierarchical context, leaving retrievers to operate over a bag of chunks; structural indexing restores this topology so that signal is preserved by construction. Graph-based methods replace arbitrary token windows with typed entity-relation networks—from GraphRAG and its variants supporting community-, subgraph-, and dual-level retrieval [37, 53, 62, 232], to G-Retriever,
which treats the graph itself as a first-class retrieval target [58], and HippoRAG, which uses personalized PageRank over an entity graph as a long-term memory substrate [54]. Because such structures only clarify when extraction is faithful, schema-aware canonicalization and retrieval-filtered construction sanitize the topology before use [213, 219]. Hierarchical indexing complements this by organizing evidence into recursive summary trees, enabling coarse-to-fine navigation while encapsulating local details within parent nodes for explicit source lineage [64, 151, 221].
#3.2 Robust Retrieval
This subsection surveys interventions that reduce retriever-level noise before context assembly. While matching related documents
SIGIR ’26, July 20–24, 2026, Melbourne, VIC, Australia Lu Dai et al.
from a large corpus is already a denoising process, LLM-oriented retrieval further prioritizes precision and distractor resistance, as the inclusion of noise can severely degrade the generation quality of LLMs. We survey retrieval-time denoising along four dimensions: (i) query transformation, (ii) hybrid retrieval, (iii) distractor-aware retriever training, and (iv) fine-grained relevance matching. (1) Query Transformation. The mismatch between user intent and corpus representation is a starting point of retrieval noise. Raw queries are often underspecified or ambiguous, leading retrievers to fetch topically related but factually irrelevant candidates [26, 203]. To bridge this semantic gap, generative expansion methods utilize LLMs to generate hypothetical documents (e.g., HyDE) or pseudoanswers, projecting the query into a clearer document embedding space [44, 180, 207]; or abstract the query to a higher-level concept before retrieval to evoke broader supporting evidence [226]. For complex information needs, query decomposition breaks queries into simpler sub-queries, reducing the noise associated with singlestep retrieval over dense information [63, 113, 140]. Recent works further propose optimizing the rewriter via reinforcement learning (RL) or feedback loops, explicitly training rewriting to maximize end-to-end performance [15, 75, 114, 137]. (2) Hybrid Retrieval. Single retriever exhibit clear limitations: sparse methods overlook semantic nuances, while dense encoder are prone to semantic noise—retrieving topically related but factually irrelevant passages. Hybrid retrieval addresses this by fusing dense representations with sparse lexical signals (e.g., BM25), effectively using exact matching to ground semantic associations and filter hallucinations [11, 19, 40]. BGE-M3 further unify this fusion into a single backbone by jointly training dense, lexical, and multi-vector heads with a hybrid scoring rule [17]. Beyond static fusion, a line work dynamically invokes different retrieval method or LLM’s parametric memoery on demands to maximize the retrieval accuracy in different scenarios [79, 92, 112]. (3) Distractor-Aware Retriever Training. Enhancing the robustness of dense representations is critical for eliminating noise. Sev-eral axes strengthen the retriever training against distractors. Hard negative mining force the encoder to separate genuine evidence from topical near-misses [99, 143, 179], with adversarial frameworks dynamically escalating training difficulty, exposing the retriever to ever-subtler distractor [218]. Secondly, instruction tuning conditions the same embedding space on different task intents, so semantically similar but task-irrelevant passages are systematically downranked [28, 163, 184]. Finally, RAG-specific objectives further distill LLM-judged utility or defects back into the retriever, aligning what is retrieved with what the generator should actually exploit [100, 173]. (4) Fine-Grained Relevance Matching. Compressing document into a single vector inherently cause information loss and introducing noises [189]. Late interaction architectures like ColBERT retain token-level features for fine-grained matching, distinguishing subtle relevance from passages that are connected loosely [82, 149]. XTR scale this paragidm by streamlining training and scoring so that token-level retrieval no longer requires gather-and-rescore, cutting cost by orders of magnitude over ColBERT [86]. Meth-ods like MUVERA directly train a multi-vector encoder to represent documents in a more fine-grained way beyond single-vector MIPS [33]. The same late-interaction principle has further been
ported to visually-rich documents via vision-language token interaction, broadening the scope beyond single-modality RAG [39].
#3.3 Context Assembly
Context assembly is the first stage that take into account the interaction between retriever and generator, transforming a raw candidate set into an LLM prompt. The objective of this stage is to maximize information density under the constraints of LLM context windows. We categorize context assembly techniques into four denoising mechanisms: LLM-aware selection, prompt compression, layout optimization, and knowledge conflict resolving. (1) LLM-aware Selection and Pruning. After first-stage retrieval, reranking and pruning act as the first noise gate of context assembly, rigorously filtering irrelevant candidates before they enter the prompt. LLM-based reranking enhances pointwise cross-encoders [126] with holistic, set-level judgments: listwise permutation generation [110, 167], pairwise comparison [141], setwise most-relevant selection [234], and efficiency-oriented single-token decoding [145]. Diversity-aware subset selection moves beyond top- 𝑘 truncation to balance relevance against redundancy via MMR [14] or Determi-nantal Point Processes [150]. Fine-grained context filtering operates at the sentence or token level to surgically remove non-supporting content. Speculative selection instructs the LLM itself to prune irrelevant evidence before reasoning [186]; trained pruners [24, 183] distill comparable signals into lightweight classifiers, and applies sentence-level reranking followed by LLM-based reconstruction of the surviving fragments [68]. Beyond rigid top- 𝑘 paradigm, adaptive strategies can dynamically size the context based on query complexity [72] or abstain when evidence is insufficient [3, 115, 138]. (2) Long Context Compression. To mitigate noise from verbose or irrelevant tokens, compression techniques perform soft denoising. Extractive compression methods such as the LLMLingua family [73, 74, 133] use small models to score token informativeness and drop low-signal tokens. Abstractive compression synthesizes documents into concise meta-summaries or task-specific representations [94, 197]. A complementary line, soft-prompt compression, encodes retrieved passages into continuous embedding vectors—such as Gist Tokens [122], ICAE [46], and xRAG [23]—achieving extreme compression while preserving task performance. All three paradigms aim to maximize information gain per token [199], increasing the logical capacity of the context window. (3) Layout Optimization to Mitigate Position Bias. LLMs exhibit non-uniform attention, favoring the beginning and end of the context while neglecting the middle—the “lost in the middle” phenomenon [103]—a bias traced to causal masking and specific hidden dimensions [188, 209], and amplified when relevant pieces are spaced far apart [170]. Denoising involves topology-aware reordering to place critical evidence at attention peaks [139], positional calibration to flatten the U-shaped curve [60], and inferencetime shuffling with aggregation [13]. These strategies dynamically structure the prompt to align with the model’s inductive biases, preventing high-signal evidence from being drowned out [154]. (4) Knowledge Conflict Resolution. Retrieved evidence is often internally inconsistent due to temporal drift, source disagreement, or duplicated paraphrases; naively flattening such passages into
LLM-Oriented Information Retrieval: A Denoising-First Perspective SIGIR ’26, July 20–24, 2026, Melbourne, VIC, Australia
a single prompt can lead to hallucinations or reasoning paralysis [16, 101, 198], benchmarked by [59, 166]. At assembly time, conflict-aware methods detect competing claims and route them into structured prompts that force the model to adjudicate discrepancies rather than averaging them away [177, 195]. Complementar-ily, evidence grading methods such as Chain-of-Note [208] generate passage-level reading notes (supporting vs. irrelevant vs. contradictory), while Astute RAG [175] iteratively consolidates model’s own parametric knowledge with retrieved passages according to source reliability, filtering inconsistencies before generation. Dur-ing generation, decoding-time interventions offer a second line of defense: contrastive decoding amplifies contextual over parametric signals [155], adaptive variants dynamically adjust the contrast per token to avoid over-correction of conflict [176], and Open- Decoder [121] injects explicit passage quality indicators into the attention computation to steer generation toward higher-reliability passages.
these threats, verification methods operate through complementary strategies: corroboration-based auditing such as CAR detects inconsistencies by seeking cross-source agreement under disinformation attacks [190]; isolation-and-aggregation frameworks such as RobustRAG verify passage integrity and provide certifiable robustness guarantees against retrieval corruption [194]; and structuredquery constraints expose and limit instruction-channel contamination [18]. Security-focused benchmarks including SafeRAG [98] and RGB [16] systematically stress-test systems across diverse adversarial scenarios, transforming these verification outcomes into actionable denoising signals for upstream retrievers.
#3.5 Closed-Loop Training
Search agents that interleave retrieval and reasoning offer capabilities beyond one-shot retrieval but are susceptible to unique vulnerabilities such as cumulative noise and error propagation. In multi-turn settings, a single irrelevant or misleading context can cascade into hallucinated reasoning, destabilizing the entire trajectory. Denoising thus shifts from static filtering to dynamic flow control. We investigate how agents mitigate noise through three mechanisms: adaptive loop orchestration, reinforcement learning, and self-evolution. Agentic loop orchestration and regulation. To mitigate cumulative noise, agents employ structured flow control as active noise filters. First, query decomposition minimizes semantic drift: methods like IRCoT [172] and ChainRAG [231] break complex queries into verifiable sub-steps to prevent “lost-in-retrieval” failures, while hierarchical planners in LevelRAG [225] and MindSearch [21] ensure narrowly targeted retrieval to minimize distractor intrusion. Second, adaptive scheduling acts as a dynamic gate: systems like Self-RAG [6], FLARE [76], and DRAGIN [165] assess parametric uncertainty to decide when to retrieve, blocking unnecessary contexts that would dilute focus. Finally, orchestration must incorporate adversarial filtering against prompt injection [106] and corpus poisoning [153, 235], requiring interface-level sanitization such as structured queries [18]. End-to-end training for RAG. Rather than relying on fixed heuristics, recent works optimize denoising directly for downstream utility. OpenRAG fine-tunes the retriever using generative feedback to filter distractors [229]. Crucially, reinforcement learning (RL) aligns the entire retrieval-generation loop: by optimizing against reward signals tied to output quality, RL equips LLMs to actively seek useful evidence and ignore retrieved noise [78, 220]. RouteRAG employs RL to learn a router policy about when to retrieve or rely on parametric knowledge [52]. Similarly, Toolformer learns to execute search APIs only when they reduce perplexity, avoiding calls that introduce context noise [152]. Denoising thus shifts from post-processing to a learned behavior encoded in model weights. Self-evolution and structural optimization. Beyond optimizing a fixed policy, agentic systems enhance denoising through continuous self-evolution. First, agents refine memory to prevent recurrent errors: Reflexion accumulates verbal feedback to bias trajectories away from noisy patterns [158], while MemGPT [131] and MemRL [224] implement explicit memory management—evicting irrelevant history or filtering “similar-but-useless” retrievals via learned utility—to maintain high signal-to-noise ratios. Second, at the system level, AutoRAG [83] and DSPy [81] treat the retrieval pipeline
#3.4 Retrieval Verification
Quality and fine-grained verification are essential for improving retrieval efficacy. They provide critical feedback for active denoising and establish an auditable chain of evidence for human review. In the LLM-oriented era, retrieval evaluation extends beyond traditional hit-based metrics to encompass utility, granular traceability, and security challenges. (1) Evaluating Utility of Retrieval. Effective denoising requires evaluating whether retrieved context genuinely benefits the generation, rather than merely relevance matching in an LLM-oriented system. Traditional metrics like NDCG fail to capture the nuanced relationship between retrieval and generation quality [27]. To disentangle these effects, LLM-as-a-judge frameworks such as RAGAS [38] and RAGChecker [147] separately measure components such as retrieval quality, context precision and answer faithfulness, making it possible to identify system failure modes. Furthermore, to isolate the true information gain, utility-based metrics like SePer [29] quantify the exact reduction in semantic uncertainty provided by the retrieval stage to measure retrieval utility. Complementary benchmarks such as RAGTruth [125], FaithEval [119], SafeRAG [98], and RGB [16] stress whether systems preserve faithfulness when evidence density degrades. (2) Fine-Grained Attribution of Long Answers. RAG systems often generate long-form answers that synthesize information across multiple retrieved passages, making it difficult for attribution. To localize hallucinations, recent works enforce fine-grained, span-level attribution rather than coarse document-level overlap. FactScore and AlignScore [118, 211] assess factuality by decomposing answers into atomic claims and evaluate as aligned pairs. Verifiable generation methods operationalize traceability by mandating quoted evidence [45, 116], using critic tokens during decoding [6], or applying post-hoc verification [32], with lightweight checkers [168] further make the evaluation efficiency computationally practical. (3) Retrieval Safety Auditing. The openness of LLM-oriented IR introduces adversarial “intentional noise” that demands verification beyond standard quality checks. Retrieved documents may contain indirect prompt injections or poisoned evidence designed to hijack the generation logic, override correct evidence, or corrupt long-term agent memory [22, 50, 106, 223, 235]. Against
SIGIR ’26, July 20–24, 2026, Melbourne, VIC, Australia Lu Dai et al.
as a programmable surface, automatically searching for module combinations and prompt structures that maximize signal quality. These mechanisms transition denoising from a transient tactic to a lifelong learning objective, where historical interaction and structural search drive continuous refinement of the agent’s information processing pipeline.
by local token noise. By presenting only the interface boundaries and hiding the method bodies until specifically requested, these systems artificially boost the signal-to-noise ratio, enabling the model to reason about complex architectures that would otherwise exceed its context limits. Finally, coding agents uniquely employs execution and tests as a verification tool. The edit-execute loop allows agents to dynamically prune noisy trajectories using precise feedback from failing tests and stack traces. This signal enables systems like SWE-agent to distinguish plausible hallucinations from functional solutions, iteratively refining the retrieval context [4, 200]. Moreover, recent works suggest that strengthening this oracle via test augmentation or differential testing further prevents overfitting to sparse supervision [182, 205]. Consequently, retrieval pipeline in coding agents becomes a cyclic, verifiable loop where code structure and execution states continuously gate the flow of information.
#4 Practices in Retrieval-Augmented Applications
Whereas Section3 organizes denoising stage by stage, real retrievalaugmented applications fail through coupled noise that propagates across stages rather than isolated module errors. We illustrate this via four representative settings—coding agents, long-term memory assistants, deep research, and multimodal understanding—and summarize their failure signatures and interventions in Table 1.4.1 Coding Agents
#4.2 Long-term Memory Assistants
Coding agents operate in a distinct IR environment characterized by repository-scale search spaces and rigid execution constraints. Tasks in this domain, typified by benchmarks like SWE-bench [77, 129], require agents to navigate massive codebases to implement precise fixes. The central challenge is the extreme sparsity of actionable signals: a repository may contain millions of lines of code, yet the resolution to an issue often resides in a single function or a subtle cross-file dependency. Consequently, standard retrieval is insufficient; it is plagued by high-noise distractors such as distinct functions with identical names, deprecated utilities, and complex inheritance structures that mask the true root cause. To mitigate this, state-of-the-art workflows have evolved from flat retrieval-augmented generation into multi-stage pipelines that progressively filter noise through hierarchical localization, syntaxaware context management, and execution-based verification. First, systems like Agentless and RepoHyper employ a coarseto-fine filtering strategy [193] instead of retrieving code snippets directly. They typically start with keyword-based or vector search to identify candidate files, followed by a re-ranking or distinct selection phase where an LLM acts as a discriminator to prune irrelevant files based on the issue description. This hierarchical reduction transforms the retrieval problem into a decision-making process, ensuring that the limited attention budget of the downstream editing model is not diluted by structurally similar but logically unrelated code. Furthermore, to handle the "needle-in-a-haystack" nature of cross-file dependencies, retrieval is often augmented with static analysis graphs (e.g., call graphs or import dependencies), which serve as hard constraints to guide the agent toward logically connected components rather than merely textually similarity [34, 104]. Second, denoising bottleneck also lies in maximizing evidence density within the context window. Feeding raw source code is inefficient and noise-prone. Advanced agents address this by adopting syntax-aware representations, such as code skeletons with only class signatures and docstrings or AST-based slicing, which strip away implementation details to provide a high-level "map" of the repository [200, 214]. This technique, often referred to as a repository map or context compression, allows the LLM to maintain global awareness of project structure without being overwhelmed
Long-term memory assistants aim to maintain continuity across interaction horizons that far exceed a model’s context window. Typically, these systems externalize history into persistent storage, yet as interactions accumulate, the raw log data inevitably degrades into a high-entropy distribution characterized by redundancy, temporal obsolescence, and state conflict. In this setting, the accumulation of history paradoxically reduces retrieval precision, creating a noisy context that leads models to hallucinate based on superseded information [111, 131]. The primary noise source in lifelong interaction is temporal drift. Unlike static corpora, personal contexts are mutable; a user’s preference or status recorded at 𝑡 1 may be directly contradicted by an event at 𝑡 100. Naive similarity-based retrieval often fails here, as outdated facts (“hard negatives”) share high semantic overlap with current queries, leading the LLM to hallucinate based on superseded evidence [111, 192]. Furthermore, indiscriminate logging creates a “store pollution” effect, where low-utility chitchat dilutes the retrieval pool, while adversarial inputs can introduce persistent poisoning risks that degrade reasoning across sessions [35, 235]. To mitigate these noise channels, denoising practices have shifted from passive indexing to active memory consolidation and structureaware retrieval. At the storage level, systems mimic human cognitive processes by abstracting raw episodic logs into synthesized semantic memories using reflection or recursive summarization to discard redundancy while preserving high-level traits [134, 228]. To combat ambiguity, unstructured text is often supplemented or replaced by structured representations, such as knowledge graphs or entity-attribute pairs, which enforce stricter schemas for state tracking and enable multi-hop reasoning over connected events [54, 66]. At the retrieval stage, standard dense retrieval is augmented with time-awareness via recency-weighted ranking or explicit validity filtering to ensure that the retrieved evidence reflects the current world state rather than historical artifacts [228]. Finally, during context construction, the focus lies on conflict resolution and verifiability. Rather than blindly packing top- 𝑘 chunks, advanced pipelines apply deduplication and expose provenance metadata (e.g., timestamps, source attribution), allowing the LLM to adjudicate between conflicting memories and resist poisoning attacks [162, 210].
LLM-Oriented Information Retrieval: A Denoising-First Perspective SIGIR ’26, July 20–24, 2026, Melbourne, VIC, Australia
Table 1: Domain-aligned failure & recovery cases for denoising-first LLM-oriented IR (Sec. 4). Legend: Failure tags use C/R/A/V/L to denote the primary noise-entry layer (corpus/retriever/assembly/verification/loop): C1 provenance contamination; C2 redundancy/canonical drift; C3 temporal drift/obsolescence; R1 query/subquery drift; R2 hard distractors; A1 context dilution (lost-in-the-middle); A2 low information density (verbosity/redundancy); A3 evidence conflict (stale-state); V1 attribution gap;
L1 cascading error propagation. Stage tags: CI controlled indexing, RR robust retrieval, CA context assembly, FV faithfulness verification, CL closed-loop improvement.
| Scenario | Failure Signature | Examples | Denoising Recipes | Key metrics |
|---|---|---|---|---|
| S4.1 Coding agents | R2 hard distractors (near-duplicate files/symbols); L1 early mistake locks an incorrect plan; C2 stale/deprecated code index. Symptom: plausible patch, wrong target. | SWE-bench-style issue: FAIL_TO_PASS points to src/core/parser.py; top- 𝑘 retrieval ranks src/legacy/parser.py higher; agent patches legacy → tests still fail. | RR BM25+dense+ symbol-aware retrieval; hard-negative rerank; CI syntax-aware repo indexing; CA de-dup clones; minimal evidence (failing trace + call graph). FV sandbox tests; reject mis-targeted patches. CL train with distractive counterexamples. | TASK % Resolved [129]; Pass Rate [117]; EFF n_turns, n_toolcalls, n_total_tokens; time_to_last_token. TASK ruff/mypy/bandit pass. JUDGE Agentic Rubrics [144]. EFF Cost per Task ($); LOC file/function localization accuracy. |
| S4.2 Long-term memory assistant | C2 memory store pollution C3 temporal drift; A3 stale-state conflict across memories. Symptom: response reflects outdated preference/profile. | 2024-03: 'I live in Boston.' 2024-06: 'I moved to Seattle.' Later: 'recommend food near me' → Boston suggestions (stale memory wins). | CI time-aware indexing; CI memory consolidation; RR recency-aware rerank + time-range filtering/query expansion. FV state-consistency check (detect contradictions; ask/abstain). | TASK Accuracy [192]; TASK Answer Prediction (F1) [111]; BLEU/ROUGE; FactScore [118]; RETR Recall@K/NDCG@K. JUDGE Faithfulness & Context Relevance [38]. |
| S4.3 Deep research and reports | R1 subquery drift; A1 evidence dilution; V1 attribution gap. Symptom: confident claims with weak/irrelevant citations. | Query: 'Compare PFAS regulations US vs EU (2025).' Subqueries drift to general health-effects; report claims 'banned globally' with a citation to an unrelated blog snippet. | RR subquery anchoring + novelty/duplicate filter. CA claim-level evidence packing ('cite-by-claim'). FV entailment check between each claim and cited spans. CL RL-trained search policies optimize evidence density. | JUDGE RACE (Overall, Comprehensiveness, Depth, Instruction-Following, Readability). CITE FACT (Citation Accuracy,Effective Citation) [36]; UTILITY SePer [29]. CITE Citation Precision/Recall [45]. |
| S4.4 Multimodal understanding | A2 event sparsity in long contexts; V1 weak timestamp grounding. Symptom: misses key moment or hallucinates timestamps. | 45-min lecture video: 'When is Theorem 2 stated?' Retrieval picks a 02:10 subtitle match; ground truth is 37:48 → wrong timestamp. | CI multimodal segment indexing. RR dual-channel retrieval; fine-grained temporal rerank. CA event-centric segment pooling/keyframe selection. FV timestamp verification loop and re-query. | TASK Accuracy; F1 score; RETR Recall [41, 43, 230]; LOC mAP (IoU=0.5/0.7) & HIT@1 [88]; TASK MAE & MSE & RMSE [142]; JUDGE MM-Relevance [111] |
and verification, exhausting the model’s attention and utilization capacity [36, 107, 160]. Noise in deep research is multi-stage and structural. At the access layer, iterative sub-query generation is prone to semantic drift: vague sub-queries retrieve topically adjacent but irrelevant literature, diluting evidence pools [2, 61]. Even expressive LLM-based retrievers underperform due to query collapse into shallow keyword patterns, amplifying retrieval noise [61]. Domain-specific restriction and metadata augmentation partially mitigate this, indicating that denoising pressure can shift to the data layer [5]. Context construction constitutes another bottleneck. Retrieved documents are typically long, redundant, and internally noisy; naïvely concatenating them leads to positional bias and attention collapse [103]. Multiple systems therefore introduce summarization, filtering, or re-ranking stages that transform raw documents into query-conditioned evidence snippets before insertion into the reasoning context, trading recall for evidence density and enabling agents to examine orders of magnitude more text than fits into the prompt [93, 160].
A shift is also happening in evaluation benchmarks, which have moved beyond simple fact recall to measuring robustness against drift and inconsistency. Datasets like LoCoMo [111] and Long- MemEval [192] explicitly probe an agent’s ability to ignore stale confounders and update beliefs in response to new evidence, underscoring that the utility of long-term memory depends less on how much is stored, and more on how effectively noise is suppressed.
#4.3 Deep Research
Deep research systems operate over open-ended queries, heterogeneous corpora, and evolving intermediate hypotheses. Typically centered on an LLM planner and given a broad query Q, a deep research system: (i) decomposes Q into a structured plan 𝑃 = 𝑔 1,...,𝑔 𝑛 of subgoals, (ii) executes multi-hop retrieval over external and internal corpora to collect evidence sets 𝑅 𝑖 for each 𝑔 𝑖, (iii) iteratively synthesizes intermediate products while adapting the plan via dynamic replanning and meta-cognitive validation, and (iv) assembles a structured artifact with explicit citations and provenance [65, 71, 157]. Unlike short-form QA, failures emerge from compounding noise across planning, retrieval, context construction,
SIGIR ’26, July 20–24, 2026, Melbourne, VIC, Australia Lu Dai et al.
Beyond soft filtering, recent work emphasizes hard denoising mechanisms. Neuro-symbolic slicing methods formalize denoising as span selection, predicting explicit indices and discarding all other content prior to reasoning [107]. This reframes the dominant failure mode as a retrieval–utilization gap: even when gold evidence is retrieved, it competes with overwhelming distractors. By making exclusion explicit, such methods expose utilization as a first-class bottleneck in deep research pipelines. Verification and post-generation feedback introduce a critical denoising stage. Long-form reports are vulnerable to unsupported claims, citation hallucinations, and internal contradictions. Systems therefore incorporate self-review or multi-agent verification loops, auditing drafts for citation accuracy and factual consistency [5, 48, 49]. Benchmarks increasingly penalize spurious or missing citations, while revealing that even when retrieval succeeds, agents struggle to organize evidence into expert-like structures [36, 222]. Architecturally, deep research systems differ in where they allocate denoising effort. Planner-centric approaches reduce noise upstream by constraining subgoals and search trajectories, while draft-centric or diffusion-style systems treat the report as a noisy latent variable iteratively refined through targeted retrieval and revision [55]. Reinforcement-learning-based agents further internalize denoising by coupling outcome rewards with evidence-density or process-level signals, encouraging policies that retrieve less but better information [57, 78, 227]. Across these variants, improved performance is consistently associated with explicit mechanisms for pruning, summarizing, or verifying evidence, rather than with raw increases in retrieval breadth.
inversely correlates with duration, indicating that unpruned context acts as pollution. To address this, architectures are evolving into dual-channel retrieval systems separating semantic reasoning from evidence localization. VideoRAG [108] exemplifies a denoising-first strategy, using Knowledge Graphs for semantic retrieval while limiting dense visual matching to relevant intervals. Complementary approaches leverage low-noise modalities (e.g., ASR transcripts) as anchors to index high-entropy visual streams. Hierarchical systems like VideoTree [187] introduce query-adaptive pruning, filtering irrelevant branches before they reach reasoning, acting as a coarse-to-fine noise filter. Finally, verifiability in multimodal generation requires explicit grounding. To prevent hallucination in temporal localization, models like VTG-LLM [51] and TimeExpert [201] decouple timestamp generation from captioning via specialized experts. By mandating timestamped citations (e.g., 𝑡 𝑠𝑡𝑎𝑟𝑡,𝑡 𝑒𝑛𝑑), these methods transform generation into provenance-aware output, ensuring visual evidence is causally linked to the generated reasoning.
#5 Future Directions
We argue that LLM-oriented IR must evolve from a passive retrieval utility into an active programmable noise gate. The core objective shifts from maximizing isolated recall to maximizing usable evidence density within the model’s cognitive budget. (1) Utility-Centric Evaluation. Standard ranking metrics often diverge from generation quality. Future benchmarks must measure causal utility —rewarding retrieval only when it resolves reasoning gaps or corrects hallucinations—and penalize unverified attribution, enforcing a strict evidence-to-generation contract. (2) Proactive Index Sanitation. To combat the “pollution” of synthetic and stale content, indexing must transition to stratified governance. Systems should treat provenance, temporal validity, and cryptographic signatures (e.g., C2PA) as hard constraints, filtering low-credibility signals before they compete for attention. (3) Self-Evolving Retrieval Loops. Static retrievers degrade in dynamic environments. We envision agents that employ closed-loop feedback to refine search policies in real-time. By learning from downstream reasoning failures, the retriever adapts to filter hard distractors and prevent “spiral” errors, turning rejection signals into upstream optimization. (4) Optimizing Information Density in Context. Addressing context limitations requires moving beyond document concatenation. Future context assembly should operate on atomic evidence units (e.g., specific claims, code symbols) rather than passages. This structural compression maximizes the logical capacity of the prompt, ensuring every token contributes to verifiability.
#4.4 Multimodal Understanding
The transition from static text to multimodal temporal data—spanning time series, genomics, and video—introduces temporal redundancy. Temporal streams scale linearly with duration 𝑇, while causal evidence 𝐸 𝑐𝑎𝑢𝑠𝑎𝑙 ⊂ 𝑇 remains sparse. Thus, the retrieval challenge shifts from indexing documents to preserving causal signals within continuous, high-entropy streams. In spatio-temporal modeling, naive context window expansion often degrades performance due to distribution shifts and nonstationary noise [171], shifting the objective from maximizing context length to optimizing evidence density. Recent architectures treat history selection as a denoising operator: RATD [102] and TS- RAG [124] replace fixed-window horizons with dynamic retrieval that fetches only segments maximizing predictive utility, while RAFT [56] retrieves training samples exhibiting similar temporal dynamics. To decouple short-term volatility from long-term trends, Time-MoE [156] routes tokens to experts specialized in specific temporal resolutions, and dual-masking strategies filter high-entropy timesteps during training to prevent overfitting to noise [42]. This sparsity is more pronounced in biological and visual domains. In genomics, models like Gene42 [174] scale attention to extreme lengths (e.g., 192k tokens), yet must discriminate functional regulatory motifs from vast non-coding regions. Video data represents the lower bound of signal-to-noise ratio, with relevant evidence often occupying less than 1% of frames. The Video-MME benchmark [41] quantifies a "long-context gap," where performance
#6 Acknowledgements
This work was supported in part by the National Key R&D Pro-gram of China (Grant No.2023YFF0725001), in part by the National Natural Science Foundation of China (Grant No. 62572417, Grant No.92370204), in part by the Guangdong Basic and Applied Ba-sic Research Foundation (Grant No.2023B1515120057), in part by the Key-Area Special Project of Guangdong Provincial Ordinary Universities (Grant No.2024ZDZX1007).
LLM-Oriented Information Retrieval: A Denoising-First Perspective SIGIR ’26, July 20–24, 2026, Melbourne, VIC, Australia
#References
SIGIR ’26, July 20–24, 2026, Melbourne, VIC, Australia Lu Dai et al.
LLM-Oriented Information Retrieval: A Denoising-First Perspective SIGIR ’26, July 20–24, 2026, Melbourne, VIC, Australia
SIGIR ’26, July 20–24, 2026, Melbourne, VIC, Australia Lu Dai et al.
LLM-Oriented Information Retrieval: A Denoising-First Perspective SIGIR ’26, July 20–24, 2026, Melbourne, VIC, Australia
SIGIR ’26, July 20–24, 2026, Melbourne, VIC, Australia Lu Dai et al.