Reasoning & Test-Time Compute · 2025
DeepSeek-R1: Incentivizing Reasoning via RL (RLVR)
It showed that a base language model can be trained to produce long chains of reasoning largely through reinforcement learning against automatically checkable rewards (correct answers, passing tests), without first needing large amounts of human-written reasoning demonstrations.
Editorial record
Plain-language summary
The team applied reinforcement learning where the reward comes from verifying the final result (a math answer being correct or code passing tests) rather than from human preference labels. Under this pressure the model learned on its own to write longer reasoning, check its work, and backtrack, with a pure-RL variant (R1-Zero) developing these behaviors from a base model before a small amount of supervised data was added for readability. This demonstrated that reinforcement learning with verifiable rewards (RLVR) is a scalable path to reasoning models, and the released weights made such training widely reproducible.
Knowledge graph
Relationships
Antecedents
Parallel workEvidence: Probable
OpenAI o1 / o3 Reasoning Systems
R1 openly parallels closed o-series behavior
P-225 system card
Applies toEvidence: Strongly supported
SWE-agent / OpenHands (autonomous software engineering)
Verifiable-reward logic applies to SWE-bench-graded agents
P-235
ExtendsEvidence: Direct
DeepSeek (V2/V3; MLA + efficient MoE + FP8)
DeepSeek-R1 reasoning extends the family
P-364
Descendants
Depends onEvidence: Direct
Verifiers & Process Supervision (GSM8K / Let's Verify Step by Step)
RLVR uses verifiers/process rewards
P-224
Depends onEvidence: Strongly supported
Chain-of-Thought Prompting Elicits Reasoning
RLVR learns long chains of thought
P-224
Source record
Provenance
- Record ID
- P-224
- Record created
- 2026-07-13
- Last reviewed
- 2026-07-14
- Record version
- 2
- https://arxiv.org/abs/2501.12948
- arXiv:2501.12948
Citation caveat: Citation metadata is approximate and marked unverified in the source dataset.