Reap: Uncovering Monte Carlo proof search with a lightweight model
cs.AI
Submitted: 2026-11-02
Updated: 2026-11-02
Code: https://github.com/frenzymath/reap
Terminology
Sources
- Multiscale Policy Optimization for Long-Horizon LLM Agents
- ProofNet: Autoformalizing and Formally Proving Undergraduate-Level Mathematics
- Seed-Prover: Deep and Broad Reasoning for Automated Theorem Proving
- Leanabell-Prover-V2: Verifier-integrated Reasoning for Formal Theorem Proving via Reinforcement Learning
- Pythagoras-Prover: Advancing Efficient Formal Proving via Augmented Lean Formalisation
- HunyuanProver: A Scalable Data Synthesis Framework and Guided Tree Search for Automated Theorem Proving
- Generative Language Modeling for Automated Theorem Proving
- DeepSeek-Prover-V2: Advancing Formal Mathematical Reasoning via Reinforcement Learning for Subgoal Decomposition
- REAL-Prover: Retrieval Augmented Lean Prover for Mathematical Reasoning
- Representation Learning with Contrastive Predictive Coding
- Kimina-Prover Preview: Towards Large Formal Reasoning Models with Reinforcement Learning
- DeepSeek-Prover: Advancing Theorem Proving in LLMs through Large-Scale Synthetic Data
Related papers
- Multi-Objective Structured Pruning of LLMs for Latency and Model Size Optimization
- MAVEN-T: Reinforced Heterogeneous Distillation for Real-Time Multi-Agent Trajectory Prediction
- Model Discovery Agent: LLM-assisted Bayesian experiment design for data-efficient discovery of mechanistic world models
- Embeddings for Preferences, Not Semantics
- Can We Trust Item Response Theory for AI Evaluation?
- Diagnosing Task Insensitivity in Language Agents