ResearchPod Summary
As large language models (LLMs) scale to million-token contexts, the quadratic computational cost of standard attention becomes a primary bottleneck. While DeepSeek Sparse Attention (DSA) mitigates this by selecting a subset of tokens to attend to, it suffers from two major system-level inefficiencies: high indexing overhead that scales poorly with context length and fragmented memory access patterns that prevent efficient hardware utilization.
To address these bottlenecks, the authors introduce LongCat Sparse Attention (LSA), which employs three co-designed strategies:
LSA allows for native training of models with context lengths up to one million tokens while maintaining performance parity with full-attention models. By optimizing the interaction between the indexing algorithm and the underlying hardware, LSA enables the development of larger models (such as the 1.6T-parameter LongCat-2.0) within limited compute budgets. The authors also open-sourced a 69B-parameter model, LongCat-Flash-Lite-Sparse, to facilitate further research into efficient long-context architectures.
AI-generated third-party summary by ResearchPod. Not official content or an endorsement by the paper authors or affiliated organizations.