RoPE Distinguishes Neither Positions Nor Tokens in Long Contexts, Provably
Quick Take
RoPE's limitations in long-context models hinder position and token differentiation.
Key Points
- RoPE loses locality bias with longer contexts.
- Attention scores become unpredictable and inconsistent.
- New mechanisms for encoding positions may be necessary.
📖 Reader Mode
~2 min readAbstract:We identify intrinsic limitations of Rotary Positional Embeddings (RoPE) in Transformer-based long-context language models. Our theoretical analysis abstracts away from the specific content of the context and depends only on its length. We prove that as context length increases, RoPE-based attention becomes unpredictable and loses two properties that are central to its effectiveness. First, it loses its locality bias: RoPE is no more likely to favor nearer positions than substantially farther ones. Second, it loses consistency in token relevance: a key vector that receives a higher attention score than an alternative at one position may receive a lower score at another. In both cases, the probability of failure approaches 0.5, no better than random guessing. We further prove that the attention score can remain unchanged when a key token is moved to a different position, or even replaced by a different token, indicating a failure to distinguish positions or tokens. Adjusting the RoPE base trades off distinguishing positions against distinguishing tokens but cannot preserve both at the same time. Increasing the RoPE base hyperparameter, a common practice in today's long-context models, helps distinguish different tokens, but inevitably sacrifices the ability to distinguish positions. Our empirical analysis shows that multi-head, multi-layer architectures are insufficient to overcome these limitations. Our findings suggest that fundamentally new mechanisms for encoding position and token order may be needed in future Transformer long-context language models.
| Comments: | 35 pages, 11 figures, submitted to NeurIPS 2026 |
| Subjects: | Computation and Language (cs.CL); Artificial Intelligence (cs.AI); Machine Learning (cs.LG) |
| Cite as: | arXiv:2605.15514 [cs.CL] |
| (or arXiv:2605.15514v1 [cs.CL] for this version) | |
| https://doi.org/10.48550/arXiv.2605.15514 arXiv-issued DOI via DataCite (pending registration) |
Submission history
From: Yufeng Du [view email]
[v1]
Fri, 15 May 2026 01:16:16 UTC (1,216 KB)
— Originally published at arxiv.org
Want this in your inbox every morning?
Daily brief at your local 8am — bilingual EN/中文, free.
More from arXiv cs.CL
See more →Time to REFLECT: Can We Trust LLM Judges for Evidence-based Research Agents?
The reliability of LLM judges for evaluating deep research agents is critically assessed using the REFLECT benchmark.