15. DSA: DeepSeek Sparse Attention (2025, DeepSeek-AI)
arXiv: 2512.02556 (DeepSeek-V3.2 Technical Report)
Core Problem
As context lengths grow to 128K, 1M, and beyond, attention's O(n²) complexity once again becomes the bottleneck. Existing sparse approaches (SWA, Sparse Transformer) either lose too much information or are complex to implement. How does DeepSeek dramatically cut long-context compute cost while preserving model quality?
Method Innovations
DSA (DeepSeek Sparse Attention) is one of the core architectural innovations of DeepSeek-V3.2. Although details in the paper are limited (it comes from the V3.2 technical report), the following is known:
1. Sparse attention mechanism: Greatly reduces computational complexity in long-context scenarios while maintaining model performance. 2. Combined with MLA: On top of the already compressed KV cache, sparsity further reduces compute. 3. Hardware-aware implementation: Optimized CUDA kernels ensure sparse attention is actually fast on real GPUs (not just theoretically fast).
Key Numbers
- DeepSeek-V3.2 is "comparable to GPT-5" on reasoning and agent tasks
- The high-compute variant DeepSeek-V3.2-Speciale achieved gold-medal-level performance at the 2025 IMO and IOI
- Retrieval capability covering 96% voting coverage (SIRA component)
Impact Assessment
DSA represents sparse attention maturing from a "research toy" to "production deployment." DeepSeek-V3.2 maintains top-tier performance while achieving efficient inference through the DSA + MLA combination. The lesson: future large models are not about "bigger is better" but "smarter sparsity is better."
Feynman-style Commentary
> The specific implementation details of DSA are not yet fully public, but its direction is clear: the next battlefield for attention is "how to cleverly not compute." Not every token pair needs attention; not every layer needs a global view. DSA's mindset is "structural sparsity"—dynamically selecting the attention scope based on the data's characteristics and the task's requirements. This reminds me of Feynman on quantum mechanics: "Nature cannot be run according to your mathematical convenience." Good sparse solutions are not designed for mathematical convenience; they are designed around data structure and hardware reality.
---
arXiv: 2512.02556 (DeepSeek-V3.2 Technical Report)