AIAny

DeepSeek-R1: Incentivizing Reasoning Capability in LLMs via Reinforcement Learning

Shows that LLM reasoning can be incentivized through pure reinforcement learning, with no human-annotated reasoning traces. Self-reflection, verification, and strategy-switching emerge on their own, and the patterns transfer to distill smaller models.

Introduction

The conventional wisdom was that strong reasoning required teaching models to imitate human-written chains of thought. DeepSeek-R1 inverts that: it rewards only the final answer's correctness and lets the reasoning process organize itself. The model spontaneously learns to spend more tokens on hard problems, double-check its own steps, and abandon failing strategies mid-stream — behaviors nobody explicitly demonstrated to it.

Key Findings
  • Pure RL with verifiable rewards (math, code, STEM) is enough to elicit advanced reasoning, removing the human-annotation bottleneck that caps supervised approaches and bakes in human bias.
  • "Aha moment" dynamics emerge: response length grows with problem difficulty, and the model develops self-reflection and verification on its own rather than being told to.
  • The emergent reasoning patterns can be distilled into much smaller models, so a single large RL run pays off across a whole model family — you don't need to repeat the expensive training per size.
Who Should Read This

Great fit if you build or fine-tune reasoning systems and want a recipe that sidesteps costly human chain-of-thought labeling, or if you care about how reasoning behaviors arise rather than just benchmark numbers. Look elsewhere if you need a turnkey product — this is a research model and method, and pure-RL training is reward-hackable and unstable on tasks where correctness can't be cheaply verified.

Information

  • Websitearxiv.org
  • OrganizationsDeepSeek-AI
  • AuthorsDeepSeek-AI, Daya Guo, Dejian Yang, Haowei Zhang, Junxiao Song, Ruoyu Zhang, Runxin Xu, Qihao Zhu, Shirong Ma, Peiyi Wang
  • Published date2025/01/22

More Items

Transfers RL-induced policy shifts from a smaller 'weak' teacher to a stronger target by using the teacher's post-/pre-RL log-ratio as a dense implicit reward applied on the student's on-policy states. Enables reuse of RL supervision without running RL rollouts on the target, improving sample/time efficiency.

Introduces KronQ, a post-training quantization framework that incorporates gradient covariance via a Kronecker‑factored Hessian to guide input/output weight rotations and sensitivity-driven mixed-precision allocation. Demonstrates stable 2-bit weight-only quantization on LLaMA-3-70B (7.93 PPL).

Explores unsupervised visual pretraining on visually rich documents to improve language-model intelligence; shows visual-pretrained models outperform text-only counterparts on the same corpora. Key aspects: direct use of images/layouts (no OCR-only pipeline), scalable across backbones and benchmarks.