MTraining: Distributed Dynamic Sparse Attention for Efficient Ultra-Long Context Training
Not on the map. Why?
Abstract (arXiv)
The adoption of long context windows has become a standard feature in Large Language Models (LLMs), as extended contexts significantly enhance their capacity for complex reasoning and broaden their applicability across diverse scenarios. Dynamic sparse attention is a promising approach for reducing the computational cost of long-context. However, efficiently training LLMs with dynamic sparse attention on ultra-long contexts-especially in distributed settings-remains a significant challenge, due in large part to worker- and step-level imbalance. This paper introduces MTraining, a novel distributed methodology leveraging dynamic sparse attention to enable efficient training for LLMs with ultra-long contexts. Specifically, MTraining integrates three key components: a dynamic sparse training pattern, balanced sparse ring attention, and hierarchical sparse ring attention. These components are designed to synergistically address the computational imbalance and communication overheads inherent in dynamic sparse attention mechanisms during the training of models with extensive context lengths. We demonstrate the efficacy of MTraining by training Qwen2.5-3B, successfully expanding its context window from 32K to 512K tokens on a cluster of 32 A100 GPUs. Our evaluations on a comprehensive suite of downstream tasks, including RULER, PG-19, InfiniteBench, and Needle In A Haystack, reveal that MTraining achieves up to a 6x higher training throughput while preserving model accuracy. Our code is available at https://github.com/microsoft/MInference/tree/main/MTraining.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 52 of its 70 references that are in the map. First posted on arXiv 21 Oct 2025.
Builds on
52 of 70 references.
References · 52
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2024The Llama 3 Herd of Modelscited by 14,192
- 2025Qwen3 Technical Reportcited by 8,195
- 2023Efficient Memory Management for Large Language Model Serving with PagedAttentioncited by 5,767
- 2024Qwen2.5 Technical Reportcited by 4,713
- 2021RoFormer: Enhanced Transformer with Rotary Position Embeddingcited by 4,581
- 2022FlashAttention: Fast and Memory-Efficient Exact Attention with IO-Awarenesscited by 3,611
- 2020Longformer: The Long-Document Transformercited by 3,362
- 2023SWE-bench: Can Language Models Resolve Real-World GitHub Issues?cited by 3,193
- 2024LiveCodeBench: Holistic and Contamination Free Evaluation of Large Language Models for Codecited by 1,906
- 2020Big Bird: Transformers for Longer Sequencescited by 1,673
- 2020Reformer: The Efficient Transformercited by 1,658
38 more
- 2023GQA: Training Generalized Multi-Query Transformer Models from Multi-Head Checkpointscited by 1,311
- 2019ZeRO: Memory Optimizations Toward Training Trillion Parameter Modelscited by 1,278
- 2024RULER: What's the Real Context Size of Your Long-Context Language Models?cited by 1,270
- 2016Training Deep Nets with Sublinear Memory Costcited by 825
- 2023Extending Context Window of Large Language Models via Positional Interpolationcited by 721
- 2019Compressive Transformers for Long-Range Sequence Modellingcited by 699
- 2024KIVI: A Tuning-Free Asymmetric 2bit Quantization for KV Cachecited by 604
- 2023YaRN: Efficient Context Window Extension of Large Language Modelscited by 584
- 2024KVQuant: Towards 10 Million Context Length LLM Inference with KV Cache Quantizationcited by 571
- 2024Quest: Query-Aware Sparsity for Efficient Long-Context LLM Inferencecited by 487
- 2023Ring Attention with Blockwise Transformers for Near-Infinite Contextcited by 448
- 2025Native Sparse Attention: Hardware-Aligned and Natively Trainable Sparse Attentioncited by 391
- 2024MInference 1.0: Accelerating Pre-filling for Long-Context LLMs via Dynamic Sparse Attentioncited by 375
- 2024∞Bench: Extending Long Context Evaluation Beyond 100K Tokenscited by 360
- 2024LongRoPE: Extending LLM Context Window Beyond 2 Million Tokenscited by 302
- 2022Reducing Activation Recomputation in Large Transformer Modelscited by 300
- 2024InfiniGen: Efficient Generative Inference of Large Language Models with Dynamic KV Cache Managementcited by 242
- 2025MoBA: Mixture of Block Attention for Long-Context LLMscited by 188
- 2024MMLongBench-Doc: Benchmarking Long-context Document Understanding with Visualizationscited by 174
- 2025Qwen2.5-1M Technical Reportcited by 158
- 2024How to Train Long-Context Language Models (Effectively)cited by 141
- 2024You Only Cache Once: Decoder-Decoder Architectures for Language Modelscited by 135
- 2024LLM Maybe LongLM: Self-Extend LLM Context Window Without Tuningcited by 133
- 2025XAttention: Block Sparse Attention with Antidiagonal Scoringcited by 131
- 2022A Length-Extrapolatable Transformercited by 123
- 2025FlexPrefill: A Context-Aware Sparse Attention Mechanism for Efficient Long-Sequence Inferencecited by 121
- 2023SparQ Attention: Bandwidth-Efficient LLM Inferencecited by 119
- 2024MagicPIG: LSH Sampling for Efficient LLM Generationcited by 112
- 2024Training-Free Long-Context Scaling of Large Language Modelscited by 61
- 2024Why Does the Effective Context Length of LLMs Fall Short?cited by 60
- 2024USP: A Unified Sequence Parallelism Approach for Long Context Generative AIcited by 58
- 2023Striped Attention: Faster Ring Attention for Causal Transformerscited by 52
- 2023Peek Across: Improving Multi-Document Modeling via Cross-Document Question-Answeringcited by 28
- 2025MMInference: Accelerating Pre-filling for Long-Context VLMs via Modality-Aware Permutation Sparse Attentioncited by 26
- 2023PIT: Optimization of Dynamic Sparse Deep Learning Models via Permutation Invariant Transformationcited by 25
- 2024FlexSP: Accelerating Large Language Model Training via Flexible Sequence Parallelismcited by 19
- 2024GoldFinch: High Performance RWKV/Transformer Hybrid with Linear Pre-Fill and Extreme KV-Cache Compressioncited by 17
- 2025WLB-LLM: Workload-Balanced 4D Parallelism for Large Language Model Trainingcited by 17
50 most cited of 52 All 52 (JSON)
Built on by
Citing papers per year: 2026: 1.
1 paper.