LoGo: Token-Level Dynamic Local-Global Attention
Not on the map. Why?
Abstract (arXiv)
As context lengths scale, attention increasingly becomes a primary computational bottleneck in large language models. Standard Transformers remain powerful but computationally inefficient, as they allocate the same attention budget to every token regardless of its contextual demand. Existing local-global hybrids provide a more efficient alternative by mixing restricted- and full-context attention, but they typically allocate span statically across layers or heads. To address these limitations, we propose LoGo, a token-level dynamic local-global attention mechanism that uses attention span as a direct proxy for attention budget allocation. Each LoGo layer contains coupled local and global branches: all tokens receive efficient local attention over a restricted context window, while a learned gate activates global attention with full-context access only for tokens requiring long-range information. A threshold-based budget controller maintains a target global ratio without auxiliary losses, and a progressive masking schedule stabilizes training before sparse routing takes effect. We further implement query-sparse Triton kernels that convert reduced global-attention computation into practical speedups. Extensive experiments validate LoGo's effectiveness, showing that it preserves the scaling behavior of full-attention Transformers across model sizes. In controlled comparisons, LoGo improves over the full-attention Transformer and matched-budget static local-global hybrids, with clear gains on long-range retrieval. Analysis further shows that LoGo learns interpretable span allocation patterns. These results suggest that learned token-level span allocation is an effective and scalable way to improve the long-context performance-compute trade-off.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 48 of its 57 references that are in the map. First posted on arXiv 30 Aug 2026.
Builds on
48 of 57 references.
References · 48
- 2017Attention Is All You Needcited by 59,932
- 2024The Llama 3 Herd of Modelscited by 14,192
- 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,710
- 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,018
- 2017Outrageously Large Neural Networks: The Sparsely-Gated Mixture-of-Experts Layercited by 3,413
- 2020Longformer: The Long-Document Transformercited by 3,362
- 2016Pointer Sentinel Mixture Modelscited by 2,992
- 2022Training Compute-Optimal Large Language Modelscited by 2,927
- 2017TriviaQA: A Large Scale Distantly Supervised Challenge Dataset for Reading Comprehensioncited by 2,895
- 2019PIQA: Reasoning about Physical Commonsense in Natural Languagecited by 2,818
- 2013Estimating or Propagating Gradients Through Stochastic Neurons for Conditional Computationcited by 2,031
- 2024Gemma 2: Improving Open Language Models at a Practical Sizecited by 1,928
36 more
- 2019Transformer-XL: Attentive Language Models Beyond a Fixed-Length Contextcited by 1,830
- 2018Know What You Don't Know: Unanswerable Questions for SQuADcited by 1,538
- 2024RULER: What's the Real Context Size of Your Long-Context Language Models?cited by 1,270
- 2025gpt-oss-120b & gpt-oss-20b Model Cardcited by 1,258
- 2016The LAMBADA dataset: Word prediction requiring a broad discourse contextcited by 960
- 2019DROP: A Reading Comprehension Benchmark Requiring Discrete Reasoning Over Paragraphscited by 883
- 2023Retentive Network: A Successor to Transformer for Large Language Modelscited by 594
- 2024Jamba: A Hybrid Transformer-Mamba Language Modelcited by 390
- 2022Confident Adaptive Language Modelingcited by 297
- 2024Mixture-of-Depths: Dynamically allocating compute in transformer-based language modelscited by 242
- 2019Depth-Adaptive Transformercited by 227
- 2024Auxiliary-Loss-Free Load Balancing Strategy for Mixture-of-Expertscited by 191
- 2025Kimi Linear: An Expressive, Efficient Attention Architecturecited by 169
- 2024Samba: Simple Hybrid State Space Models for Efficient Unlimited Context Language Modelingcited by 167
- 2015Conditional Computation in Neural Networks for faster modelscited by 166
- 2026MiMo-V2-Flash Technical Reportcited by 163
- 2025MiniMax-01: Scaling Foundation Models with Lightning Attentioncited by 157
- 2024You Only Cache Once: Decoder-Decoder Architectures for Language Modelscited by 135
- 2024Zamba: A Compact 7B SSM Hybrid Modelcited by 118
- 2023Language Models Enable Simple Systems for Generating Structured Views of Heterogeneous Data Lakescited by 101
- 2024Hymba: A Hybrid-head Architecture for Small Language Modelscited by 95
- 2023CoLT5: Faster Long-Range Transformers with Conditional Computationcited by 84
- 2022Mixture of Attention Heads: Selecting Attention Heads Per Tokencited by 58
- 2024Just read twice: closing the recall gap for recurrent language modelscited by 55
- 2024MoE++: Accelerating Mixture-of-Experts Methods with Zero-Computation Expertscited by 55
- 2025SLA: Beyond Sparsity in Diffusion Transformers via Fine-Tunable Sparse-Linear Attentioncited by 55
- 2025Falcon-H1: A Family of Hybrid-Head Language Models Redefining Efficiency and Performancecited by 52
- 2025Twilight: Adaptive Attention Sparsity with Hierarchical Top-p Pruningcited by 48
- 2024Mixture of Attention Spans: Optimizing LLM Inference Efficiency with Heterogeneous Sliding-Window Lengthscited by 44
- 2024AdaMoE: Token-Adaptive Routing with Null Experts for Mixture-of-Experts Language Modelscited by 41
- 2024XMoE: Sparse Models with Fine-grained and Adaptive Expert Selectioncited by 27
- 2023Sparse Modular Activation for Efficient Sequence Modelingcited by 20
- 2025LoLA: Low-Rank Linear Attention With Sparse Cachingcited by 10
- 2025TransMamba: A Sequence-Level Hybrid Transformer-Mamba Language Modelcited by 7
- 2026Stem: Rethinking Causal Information Flow in Sparse Attentioncited by 5
- 2026Multi-Mixer Models: Flexible Sequence Modeling with Shared Representationscited by 1
Built on by
Citing papers per year: 2026: 1.
1 paper.
- 2026On-Demand Attention: Language Models Know When to Recallcited by 0
- 2026On-Demand Attention: Language Models Know When to Recall17 Sep 2026