ImageNet classification with deep convolutional neural networks
Alex Krizhevsky, Ilya Sutskever et al.
14
Citations
2
Influential Citations
arXiv.org
Venue
2025
Year
Progress on training and architecture strategies has enabled LLMs with millions of tokens in context length. However, empirical evidence suggests that such long-context LLMs can consume far more text than they can reliably use. On the other hand, it has been shown that inference-time compute can be used to scale performance of LLMs, often by generating thinking tokens, on challenging tasks involving multi-step reasoning. Through controlled experiments on sandbox long-context tasks, we find that such inference-time strategies show rapidly diminishing returns and fail at long context. We attribute these failures to score dilution, a phenomenon inherent to static self-attention. Further, we show that current inference-time strategies cannot retrieve relevant long-context signals under certain conditions. We propose a simple method that, through targeted gradient updates on the given context, provably overcomes limitations of static self-attention. We find that this shift in how inference-time compute is spent leads to consistently large performance improvements across models and long-context benchmarks. Our method leads to large 12.6 and 14.1 percentage point improvements for Qwen3-4B on average across subsets of LongBench-v2 and ZeroScrolls benchmarks. The takeaway is practical: for long context, a small amount of context-specific training is a better use of inference compute than current inference-time scaling strategies like producing more thinking tokens.
Long-context LLMs have become a cornerstone of modern AI, enabling applications from document analysis to multi-turn reasoning. However, a critical gap has emerged: these models can consume millions of tokens but often fail to reliably use the information. This paper tackles that gap head-on, identifying a fundamental issue—score dilution in static self-attention—that undermines both standard inference and current inference-time scaling strategies like generating more thinking tokens.
The significance is twofold. First, it provides a clear diagnosis of why inference-time compute (e.g., chain-of-thought) shows rapidly diminishing returns on long-context tasks. Second, it proposes a simple, principled fix: instead of scaling token generation, spend inference compute on targeted gradient updates to the context. This shift in strategy is both practical and theoretically grounded, offering immediate improvements without requiring new architectures or massive retraining.
The method delivers substantial gains: 12.6 percentage points on LongBench-v2 and 14.1 percentage points on ZeroScrolls for Qwen3-4B. These improvements are consistent across different model sizes and architectures, indicating robustness. The paper contrasts this with inference-time scaling strategies, which show rapidly diminishing returns on the same tasks.
This work challenges the prevailing trend of scaling inference-time compute through additional token generation. By demonstrating that a small amount of context-specific training is more effective, it opens a new direction for improving long-context LLMs. Practitioners can adopt this method as a drop-in improvement for existing models, potentially reducing the need for larger context windows or more complex architectures. The findings also have implications for understanding the fundamental limitations of static self-attention, encouraging further research into dynamic attention mechanisms.
Alex Krizhevsky, Ilya Sutskever et al.
Ashish Vaswani, Noam Shazeer et al.
Douglas M. Bates, Martin Mächler et al.
Diederik P. Kingma, Jimmy Ba