STILL: Selecting Tokens for Intra-Layer Hybrid Attention to Linearize LLMs
Not on the map. Why?
Abstract (arXiv)
Linearizing pretrained large language models (LLMs) primarily relies on intra-layer hybrid attention mechanisms to alleviate the quadratic complexity of standard softmax attention. Existing methods perform token routing based on sliding-window partitions, resulting in position-based selection and fails to capture token-specific global importance. Meanwhile, linear attention further suffers from distribution shift caused by learnable feature maps that distort pretrained feature magnitudes. Motivated by these limitations, we propose STILL, an intra-layer hybrid linearization framework for efficiently linearizing LLMs. STILL introduces a Self-Saliency Score with strong local-global consistency, enabling accurate token selection using sliding-window computation, and retains salient tokens for sparse softmax attention while summarizing the remaining context via linear attention. To preserve pretrained representations, we design a Norm-Preserved Feature Map (NP-Map) that decouples feature direction from magnitude and reinjects pretrained norms. We further adopt a unified training-inference architecture with chunk-wise parallelization and delayed selection to improve hardware efficiency. Experiments show that STILL matches or surpasses the original pretrained model on commonsense and general reasoning tasks, and achieves up to a 86.2% relative improvement over prior linearized attention methods on long-context benchmarks. Code is available at this URL.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 27 of its 33 references that are in the map. First posted on arXiv 2 Feb 2026.
Builds on
27 of 33 references.
References · 27
- 2017Attention Is All You Needcited by 59,932
- 2020Language Models are Few-Shot Learnerscited by 32,199
- 2024The Llama 3 Herd of Modelscited by 14,192
- 2020Measuring Massive Multitask Language Understandingcited by 7,768
- 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,710
- 2020Transformers are RNNs: Fast Autoregressive Transformers with Linear Attentioncited by 1,979
- 2024RULER: What's the Real Context Size of Your Long-Context Language Models?cited by 1,270
- 2023Retentive Network: A Successor to Transformer for Large Language Modelscited by 594
- 2024Quest: Query-Aware Sparsity for Efficient Long-Context LLM Inferencecited by 487
- 2024PyramidKV: Dynamic KV Cache Compression based on Pyramidal Information Funnelingcited by 420
- 2025Gated Attention for Large Language Models: Non-linearity, Sparsity, and Attention-Sink-Freecited by 266
- 2022cosFormer: Rethinking Softmax in Attentioncited by 212
15 more
- 2024BABILong: Testing the Limits of LLMs with Long Context Reasoning-in-a-Haystackcited by 211
- 2023FLatten Transformer: Vision Transformer using Focused Linear Attentioncited by 170
- 2025Kimi Linear: An Expressive, Efficient Attention Architecturecited by 169
- 2025MiniMax-01: Scaling Foundation Models with Lightning Attentioncited by 157
- 2024Eagle and Finch: RWKV with Matrix-Valued States and Dynamic Recurrencecited by 155
- 2024The Mamba in the Llama: Distilling and Accelerating Hybrid Modelscited by 120
- 2024The Hedgehog & the Porcupine: Expressive Linear Attentions with Softmax Mimicrycited by 119
- 2021Finetuning Pretrained Transformers into RNNscited by 94
- 2024RecurrentGemma: Moving Past Transformers for Efficient Open Language Modelscited by 61
- 2024Linearizing Large Language Modelscited by 51
- 2024Bridging the Divide: Reconsidering Softmax and Linear Attentioncited by 48
- 2023TransNormerLLM: A Faster and Better Large Language Model with Improved TransNormercited by 34
- 2025Liger: Linearizing Large Language Models to Gated Recurrent Structurescited by 32
- 2025Rectifying Magnitude Neglect in Linear Attentioncited by 16
- 2026Hybrid Linear Attention Done Right: Efficient Distillation and Effective Architectures for Extremely Long Contextscited by 16
Built on by
Citing papers per year: 2026: 3.
3 papers.