| name | deepseek-math-v2-self-verifiable |
| title | DeepSeekMath-V2: Self-Verifiable Mathematical Reasoning Through Iterative Training |
| version | 0.0.2 |
| engine | skillxiv-v0.0.2-claude-opus-4.6 |
| license | MIT |
| url | https://arxiv.org/abs/2511.22570 |
| keywords | ["mathematical-reasoning","proof-verification","self-verification","iterative-training","llm-alignment"] |
| description | Synergistic verifier-generator training loop enabling LLMs to identify logical issues in mathematical proofs without reference solutions, improving reasoning rigor through meta-verification. Apply when you need to scale mathematical reasoning without hand-labeled proof annotations. |
Summary
DeepSeekMath-V2 introduces a self-verifiable mathematical reasoning system through an iterative training cycle between proof verification and generation components. Instead of using final-answer rewards, the approach directly addresses proof rigor by training an LLM-based verifier that identifies logical issues and a generator that performs self-verification, creating synergistic improvement cycles.
Core Technique
The system operates through three coupled components:
-
Verifier Training: Train an LLM to identify logical issues in proofs using meta-verification—where the verifier itself must identify which rubrics it should evaluate against. This eliminates the need for reference solutions or ground-truth proof steps.
-
Generator Self-Verification: Train the proof generator to analyze its own work using the same rubrics as the external verifier, enabling deliberate self-refinement during generation rather than blind trial-and-error.
-
Verification-Scaled Labeling: Use the verifier to automatically label challenging proofs, creating training data that progressively improves both components in a reinforcement cycle.
Implementation
Meta-verification: The verifier outputs both a proof evaluation and the reasoning criteria it applied. This self-aware approach ensures the verifier produces faithful analyses rather than hallucinated critiques.
Synergistic scaling: Allocate compute to verification as a first-class post-training component, not just as an evaluation metric. Scaling verification compute directly improves the verifier's ability to label and improve the generator.
Iterative refinement: Cycle between: (1) generator creates proofs with self-verification, (2) external verifier identifies remaining issues, (3) both components retrain on improved data, (4) repeat.
When to Use
- Training mathematical reasoning models for high-stakes applications (olympiad math, formal verification)
- Scaling reasoning training without expensive human proof annotations
- Building verifiable reasoning pipelines where proof correctness matters more than speed
- Improving model accuracy on complex multi-step mathematical problems
When NOT to Use
- Tasks where final-answer accuracy is sufficient without proof correctness
- Simple computation-heavy problems better served by symbolic solvers
- Scenarios with abundant high-quality proof annotations (pure supervised learning may be simpler)
- Real-time reasoning where iterative verification adds too much latency
Key References
