15. DSA: DeepSeek Sparse Attention (2025, DeepSeek-AI)
arXiv: 2512.02556 (DeepSeek-V3.2 Technical Report)
The core problem
As context lengths grow to 128K, 1M, or even longer, attention's O(n²) complexity becomes a bottleneck again. Existing sparse approaches (SWA, Sparse Transformer) either lose too much information or are complex to implement. How can DeepSeek dramatically cut the cost of long-context computation while preserving model quality?
Method innovations
DSA (DeepSeek Sparse Attention) is one of the core architectural innovations of DeepSeek-V3.2. Although implementation details in the paper are limited (it comes from the V3.2 technical report), the following is known:
1. Sparse attention mechanism: substantially reduces computational complexity in long-context scenarios while maintaining model performance. 2. Combination with MLA: on top of the already-compressed KV cache from MLA (Multi-head Latent Attention), it further reduces computation through sparsification. 3. Hardware-aware implementation: optimized CUDA kernels ensure sparse attention is actually fast on real GPUs (not just fast in theory).
Key numbers
- DeepSeek-V3.2 is reported as "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% of votes (SIRA component).
Impact assessment
DSA represents the maturation of sparse attention from "research toy" to "production deployment." DeepSeek-V3.2 maintains top-tier performance while achieving efficient inference through the DSA + MLA combination. The takeaway: future large models will not win by being "bigger and bigger," but by being "smarter and sparser."
Feynman-style commentary
> The specific implementation details of DSA are not fully public yet, but the direction is clear: the next battlefield for attention is "how to cleverly not compute." Not every token pair needs attention, and not every layer needs a global view. DSA's mindset is "structural sparsity" — dynamically choosing the attention scope based on data characteristics and task requirements. This recalls Feynman on quantum mechanics: "Nature does not run according to your mathematical convenience." Good sparse schemes are not designed for mathematical convenience either; they are designed around data structure and hardware reality.