ATFlash: Per-RoPE-Wavelength Attention Windows for Compute/Memory-Efficient LLM Inference
On the map: Efficient LLM inference and serving → KV cache optimization
Abstract (arXiv)
The attention score with rotary position embeddings (RoPE) decomposes exactly into a sum over its 2D-rotation frequency pairs, and each pair's wavelength limits how far it can discriminate position. Aligned with this structure, we propose the per-RoPE-wavelength distance window: it prunes the query--key inner-product terms beyond a wavelength-proportional distance. Unlike a sliding window, every key remains reachable, at least through the low-frequency pairs. The reduction rate is input-independent, with a closed form logarithmic in the sequence length N, in contrast to dynamic-sparse methods like MInference. Such token-level selection is orthogonal to our frequency-level pruning. The window can therefore be applied on top of those methods. On Qwen2.5-0.5B and Llama-3.2-3B, the window prunes 37--48% of the query--key inner-product terms within each model's native context length. Relative to full attention, the top-1 match rate stays at 96--98% and the mean output-distribution KL at the 10-3-nat level on LongBench-v2 contexts. We examine absolute scores on long-context benchmarks such as RULER, OpenAI-MRCR, LongCodeQA, and ∞Bench: they are broadly preserved. We implement the window as a slice of the query--key contraction axis, leaving the online-softmax recurrences untouched, and port it with minimal diffs into the released FlashAttention-4 prefill and FlashInfer decode. On RTX PRO 6000 with Llama, both ports outpace stock with gains growing with context length, up to 1.29× at 128K. End to end on Qwen2.5-7B-1M, with 57% of the inner-product terms pruned, the speedup reaches 1.31× at a 1M-token context.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Placed in KV cache optimization, one of 12 directions in Efficient LLM inference and serving. Builds on 12 of its 18 references that are in the map. First posted on arXiv 3 Aug 2026.
Builds on
12 of 18 references.
Closest ancestors · 2
Same direction, newest first
- 2025MEPIC: Memory Efficient Position Independent Caching for LLM Serving18 Dec
- 2025FlashInfer: Efficient and Customizable Attention Engine for LLM Inference Serving2 Jan
Other references · 10
- 2023FlashAttention-2: Faster Attention with Better Parallelism and Work Partitioningcited by 2,598
- 2023Efficient Streaming Language Models with Attention Sinkscited by 2,186
- 2024FlashAttention-3: Fast and Accurate Attention with Asynchrony and Low-precisioncited by 519
- 2024MInference 1.0: Accelerating Pre-filling for Long-Context LLMs via Dynamic Sparse Attentioncited by 383
- 2024Flex Attention: A Programming Model for Generating Optimized Attention Kernelscited by 185
- 2018Online normalizer calculation for softmaxcited by 162
- 2025FlexPrefill: A Context-Aware Sparse Attention Mechanism for Efficient Long-Sequence Inferencecited by 123
- 2025SpargeAttention: Accurate and Training-free Sparse Attention Accelerating Any Model Inferencecited by 120
- 2026FlashAttention-4: Algorithm and Kernel Pipelining Co-Design for Asymmetric Hardware Scalingcited by 66
- 2026TriAttention: Efficient Long Reasoning with Trigonometric KV Compressioncited by 21
Built on by
Citing papers per year: 2026: 1.
1 paper.
- 2026WavePrune: One period is often enough for RoPEcited by 0
- 2026WavePrune: One period is often enough for RoPE3 Oct 2026
Similar, not cited
Close in wording, no citation either way
- 2026Flux Attention: Context-Aware Hybrid Attention for Efficient LLMs Inference
- 2025SALE : Low-bit Estimation for Efficient Sparse Attention in Long-context LLM Prefilling
- 2026Task-Aware Spectral Pruning: A Mixture-of-Masks Framework for Efficient LLM Inference
- 2026PRISM: Breaking the O(n) Memory Wall in Long-Context LLM Inference via O(1) Photonic Block Selection
- 2026Self-Indexing Attention for Compression-Compatible Sparse Long-Context LLM Inference
- 2025Kascade: A Practical Sparse Attention Method for Long-Context LLM Inference
- 2026AsyncTLS: Efficient Generative LLM Inference with Asynchronous Two-level Sparse Attention
- 2025Long-Context Modeling with Dynamic Hierarchical Sparse Attention for Memory-Constrained LLM Inference