DeepSeek‑V3.2‑Exp Unveiled: Million‑Token Context, Sparse Attention, and Cost‑Effective Inference

DeepSeek‑V3.2‑Exp, the latest experimental large‑language model, is open‑sourced with a paper, featuring a million‑token context window, a new sparse attention mechanism, GRPO‑enhanced reasoning, and detailed cost‑analysis showing up to ten‑fold inference savings.

DataFunTalk
DataFunTalk
DataFunTalk
DeepSeek‑V3.2‑Exp Unveiled: Million‑Token Context, Sparse Attention, and Cost‑Effective Inference

DeepSeek‑V3.2‑Exp has been open‑sourced and its accompanying paper released, offering a wealth of technical details for researchers and developers.

There are also rumors that DeepSeek V4 will be launched in October.

🔥 Million‑level token context window

🧠 GRPO enhanced reasoning

⚡ NSA/SPCT “black‑tech” innovations

The performance of DeepSeek‑V3.2‑Exp is roughly on par with the previous DeepSeek‑V3.1‑Terminus model.

DeepSeek‑V3.2‑Exp is the latest experimental model built on V3.1‑Terminus and introduces the DeepSeek Sparse Attention (DSA) mechanism, enabling faster and more efficient training and inference on long contexts.

Paper download: https://github.com/deepseek-ai/DeepSeek-V3.2-Exp/blob/main/DeepSeek_V3_2.pdf

Sparse attention mechanism : Implements “Lightning Indexer” combined with top‑k attention to achieve sparsity.

Training foundation : Based on the V3.1 Terminus model and continues pre‑training with 1 trillion tokens.

Expert model fusion : Uses reinforcement learning to train five specialist models (e.g., coding, mathematics) and merges them into the final checkpoint via knowledge distillation.

GRPO algorithm : Employs multiple reward functions, including length penalty, language consistency, and score‑based rewards.

Performance optimization : Supports FP8 precision and sparse‑attention kernels. Relevant code can be found in the following PRs:

https://github.com/deepseek-ai/DeepGEMM/pull/200

https://github.com/deepseek-ai/FlashMLA/pull/98

https://github.com/tile-ai/tilelang/pull/894

Inference cost analysis : Although Lightning Indexer has O(L²) complexity, L is much smaller than N, dramatically reducing cost in long‑context scenarios; decoding 128K tokens costs about $0.25 versus $2.20 for dense attention, roughly a ten‑fold reduction.

https://x.com/danielhanchen/status/1972613546119991791</code><code>https://huggingface.co/deepseek-ai/DeepSeek-V3.2-Exp
Original Source

Signed-in readers can open the original source through BestHub's protected redirect.

Sign in to view source
Republication Notice

This article has been distilled and summarized from source material, then republished for learning and reference. If you believe it infringes your rights, please contactadmin@besthub.devand we will review it promptly.

Inference OptimizationDeepSeeklarge language modelGRPOsparse attention
DataFunTalk
Written by

DataFunTalk

Dedicated to sharing and discussing big data and AI technology applications, aiming to empower a million data scientists. Regularly hosts live tech talks and curates articles on big data, recommendation/search algorithms, advertising algorithms, NLP, intelligent risk control, autonomous driving, and machine learning/deep learning.

0 followers
Reader feedback

How this landed with the community

Sign in to like

Rate this article

Was this worth your time?

Sign in to rate
Discussion

0 Comments

Thoughtful readers leave field notes, pushback, and hard-won operational detail here.