Pith. sign in

REVIEW 3 cited by

Infinite Retrieval: Attention Enhanced LLMs in Long-Context Processing

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2502.12962 v1 pith:F5B4FP7S submitted 2025-02-18 cs.CL

classification cs.CL
keywords llmsattentioninfiniretricapabilitiesmethodretrievaltokensachieves
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Limited by the context window size of Large Language Models(LLMs), handling various tasks with input tokens exceeding the upper limit has been challenging, whether it is a simple direct retrieval task or a complex multi-hop reasoning task. Although various methods have been proposed to enhance the long-context processing capabilities of LLMs, they either incur substantial post-training costs, or require additional tool modules(e.g.,RAG), or have not shown significant improvement in realistic tasks. Our work observes the correlation between the attention distribution and generated answers across each layer, and establishes the attention allocation aligns with retrieval-augmented capabilities through experiments. Drawing on the above insights, we propose a novel method InfiniRetri that leverages the LLMs's own attention information to enable accurate retrieval across inputs of infinitely length. Our evaluations indicate that InfiniRetri achieves 100% accuracy in the Needle-In-a-Haystack(NIH) test over 1M tokens using a 0.5B parameter model, surpassing other method or larger models and setting a new state-of-the-art(SOTA). Moreover, our method achieves significant performance improvements on real-world benchmarks, with a maximum 288% improvement. In addition, InfiniRetri can be applied to any Transformer-based LLMs without additional training and substantially reduces inference latency and compute overhead in long texts. In summary, our comprehensive studies show InfiniRetri's potential for practical applications and creates a paradigm for retrievaling information using LLMs own capabilities under infinite-length tokens. Code will be released in link.

Discussion (0). Sign in to comment.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. QwenLong-CPRS: Towards $\infty$-LLMs with Dynamic Context Optimization

    cs.CL 2025-05 conditional novelty 6.0 of 10

    QwenLong-CPRS is a 7B instruction-guided compressor that shrinks long contexts to query-relevant spans, boosting downstream LLM accuracy and cutting prefill cost.

  2. Chained Recursive Language Models for Multi-Iteration Reasoning

    cs.CL 2026-08 reject novelty 5.0 of 10

    Chained fresh-root model calls with plain-text artifacts improve reported long-context reasoning accuracy over a single-call baseline, but the evidence lacks error bars and compute-matched comparison.

  3. MOTIF: Modular Thinking via Reinforcement Fine-tuning in LLMs

    cs.CL 2025-07 conditional novelty 4.0 of 10

    A multi-round modular thinking RL fine-tuning method improves a 3B model's pass@1 on MATH500 and AIME2024 over vanilla GRPO in one run, with sample-efficiency claims based on 15% of training questions.

Pith tools