Skip to content

PERK: Long-Context Reasoning as Test-Time Learning

Jul 2025 · 6 citations · 74 references
Computer Science

Abstract

Long-context reasoning requires accurately identifying relevant information in extensive, noisy input contexts. In this work, we propose PERK (Parameter Efficient Reasoning over Knowledge), a scalable approach for learning to encode long contexts using gradient updates at test time. Specifically, PERK employs two nested optimization loops in a meta-training phase. The inner loop rapidly encodes contexts into a low-rank adapter (LoRA) that serves as a parameter-efficient memory module for the base model. Concurrently, the outer loop learns to use the updated adapter to accurately recall and reason over relevant information from the encoded long context. Our evaluations on several long-context reasoning tasks show that PERK significantly outperforms the standard long-context finetuning, achieving average absolute performance gains of up to 20% for Qwen-2.5 (0.5B&7B) on synthetic and real-world long-context reasoning. PERK also maintains its advantages across model scales and families. Compared to specialized long-context LLMs, PERK matches or surpasses their performance. Finally, our analyses show PERK is more robust to reasoning complexity, length extrapolation, and the positions of relevant information in contexts. https://perk-long-context.web.app

View source

Similar papers

#artificial intelligence Preprint Sep 2026

Learning to Learn from Context: Synthetic Training from Perturbed Public Documents

This work attempts to make use of high-quality public documents with small perturbations and empirically finds that LLMs can successfully generate context-dependent reasoning traces and answers, which are then used to train a student model that substantially improves the performance on CL-bench.

Hao Wu, Yang Xiao, Yu-Song Sun et al. · 0 citations
Preprint Aug 2026

Rethinking Expressivity and Efficiency in Test-Time Training

Under the standard approximation of taking gradients at the chunk-start weights, a closed-form state transition is derived that exactly reproduces the chunk-end fast-weight and momentum states of the per-token recurrence of Test-Time Training.

Zeyun Zhong, Joya Chen, Manuel Martín et al. · 2 citations
#artificial intelligence Preprint Aug 2026

MoNe: Modular Neural Memory for Efficient Long Context Inference

MoNe is a lightweight modular neural memory that attaches to any frozen pretrained Transformer to enable long-context inference without retraining, achieving strong performance on needle-in-a-haystack and word extraction benchmarks from RULER, where ICL degrades sharply.

Won-Yong Cho, Kyubyung Chae, Tribhuvanesh Orekondy et al. · 0 citations
Preprint Aug 2026

Information Abundance Paradox: Long-Context Training Undermines Parametric Knowledge

The Information Abundance Paradox is supported and it is suggested that scaling toward near-infinite context is not simply a matter of supplying more data, even when high-quality long-context data is abundant.

Arda Uzunouglu, Benjamin Van Durme, Daniel Khashabi · 2 citations

Related blog posts

MIT News · Artificial Intelligence Aug 27, 2026

Looking beyond natural sequences

A new machine-learning framework aims to improve the success rate of computational protein design while moving away from results that reproduce sequences found in nature.

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.