Mingchuan Zhang
Mingchuan Zhang is a researcher whose DeepSeek-AI papers cover open language models, mathematical reasoning and reinforcement learning. They co-authored DeepSeek LLM and DeepSeekMath in early 2024; the latter reports 51.7% on MATH and introduces Group Relative Policy Optimization. They later co-authored DeepSeek-V3, DeepSeek-R1, DeepSeek-V3.2 and DeepSeek-V4, spanning large-scale pre-training, reinforcement-learning reasoning, sparse attention and million-token context. As of October 2026, they are listed among the DeepSeek-AI authors of DeepSeek-V4.1-Flash, a report on KV-cache compression.
- Works
- 307
- Citations
- 4,989
- h-index
- 30
Publication numbers from OpenAlex, as of 22 October 2026.
Timeline
-
January 2024
DeepSeek LLM and scaling
They co-author DeepSeek LLM, submitted in January 2024, which studies scaling laws for open-source 7B and 67B configurations. Its pre-training dataset contains 2 trillion tokens.
-
February 2024
DeepSeekMath and GRPO
They co-author DeepSeekMath with Zhihong Shao, Daya Guo and eight other researchers in February 2024. The 7B model scores 51.7% on the MATH benchmark, and the paper introduces Group Relative Policy Optimization (GRPO), a variant of Proximal Policy Optimization.
-
December 2024
The DeepSeek-V3 report
They co-author the DeepSeek-V3 technical report, submitted in December 2024. DeepSeek-V3 is a Mixture-of-Experts language model with 671 billion total parameters, 37 billion active per token, and pre-training on 14.8 trillion tokens.
-
January 2025
DeepSeek-R1 on arXiv
They co-author DeepSeek-R1, submitted to arXiv in January 2025. The paper reports that pure reinforcement learning can incentivize LLM reasoning, making human-labeled reasoning trajectories unnecessary.
-
September 2025
DeepSeek-R1 in Nature
Nature publishes the DeepSeek-R1 study in September 2025 under the title “DeepSeek-R1 incentivizes reasoning in LLMs through reinforcement learning.” It lists Mingchuan Zhang among the authors affiliated with DeepSeek-AI Team in Hangzhou, China.
-
December 2025
DeepSeek-V3.2 and sparse attention
They co-author DeepSeek-V3.2, submitted in December 2025. The model introduces DeepSeek Sparse Attention (DSA) for long-context scenarios, and its high-compute variant DeepSeek-V3.2-Speciale earns gold-medal performance at the 2025 International Mathematical Olympiad and International Olympiad in Informatics.
-
April 2026
DeepSeek-V4's million-token context
They are among the authors of the DeepSeek-V4 preview, submitted to arXiv in April 2026. DeepSeek-V4-Pro has 1.6 trillion total parameters, with 49 billion active, while DeepSeek-V4-Flash has 284 billion total and 13 billion active; both support a context length of one million tokens.
-
As of October 2026
DeepSeek-V4.1-Flash paper
As of October 2026, they are listed among the DeepSeek-AI authors of DeepSeek-V4.1-Flash, submitted in September 2026. The report explores KV-cache compression for a model with contexts up to one million tokens.
Career
- 2025DeepSeekResearcher
- 2024–2026Northeastern University
- 2022–2025Zhengzhou University
- 2015–2017Beijing Jiaotong University
- 2015–2018Tiangong University
- 2008–2026Henan University of Science and Technology
- 1999–2025Shanghai Jiao Tong University
Most-cited works
- DeepSeek-R1 incentivizes reasoning in LLMs through reinforcement learningWith Bingxuan Wang, Chengqi Deng, Damai Dai, Daya Guo, Erhang Li and Fangyun Lin
- Can Open Large Language Models Catch Vulnerabilities?With Bingxuan Wang, Chengqi Deng, Damai Dai, Erhang Li, Fangyun Lin and Haocheng Wang
- DeepSeek-V3 Technical ReportWith Bingxuan Wang, Chengqi Deng, Damai Dai, Daya Guo, Dejian Yang and Erhang Li
- Deoxygenation of Bio-oil during Pyrolysis of Biomass in the Presence of CaO in a Fluidized-Bed Reactor
- MPCE: A Maximum Probability Based Cross Entropy Loss Function for Neural Network Classification
Sources and credits
Photo: We have no published photo of Mingchuan Zhang yet. Send us a free-licensed photo.
- DeepSeek LLM: Scaling Open-Source Language Models with Longtermism
- DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Models
- DeepSeek-V3 Technical Report
- DeepSeek-R1: Incentivizing Reasoning Capability in LLMs via Reinforcement Learning
- DeepSeek-R1 incentivizes reasoning in LLMs through reinforcement learning | Nature
- DeepSeek-R1 incentivizes reasoning in LLMs through reinforcement learning (IDEAS/RePEc)
- DeepSeek-V3.2: Pushing the Frontier of Open Large Language Models
- DeepSeek-V4: Towards Highly Efficient Million-Token Context Intelligence
- DeepSeek-V4.1-Flash: Pushing the Limits of KV Cache Compression
