Fetching the paper…
Reading the bibliography…
We introduce DeepSeek-Prover-V1.5, an open-source language model designed for theorem proving in Lean 4, which enhances DeepSeek-Prover-V1 by optimizing both training and inference processes.
Temporal credit assignment in reinforcement learning
R. S. Sutton · 1984
Earlier work this paper cites.
Isabelle a Generic Theorem Prover
L. C. Paulson · 1994
Earlier work this paper cites.
Algorithms for inverse reinforcement learning
A. Y. Ng and S. J. Russell · 2000
Earlier work this paper cites.
Using confidence bounds for exploitation-exploration trade-offs
P. Auer · 2002
Earlier work this paper cites.
Finite-time analysis of the multiarmed bandit problem
P. Auer, N. Cesa-Bianchi, and P. Fischer · 2002
Earlier work this paper cites.
R-max-a general polynomial time algorithm for near-optimal reinforcement learning
R. I. Brafman and M. Tennenholtz · 2002
Earlier work this paper cites.
Efficient selectivity and backup operators in Monte-Carlo tree search
R. Coulom · 2006
Earlier work this paper cites.
Bandit based Monte-Carlo planning
L. Kocsis and C. Szepesvári · 2006
Earlier work this paper cites.
Parallel monte-carlo tree search
G. M. B. Chaslot, M. H. Winands, and H. J. van Den Herik · 2008
Earlier work this paper cites.
Formal theory of creativity, fun, and intrinsic motivation (1990–2010)
J. Schmidhuber · 2010
Earlier work this paper cites.
Reward design via online gradient ascent
J. Sorg, S. Singh, and R. L. Lewis · 2010
Earlier work this paper cites.
On upper-confidence bound policies for switching bandit problems
A. Garivier and E. Moulines · 2011
Earlier work this paper cites.
A reduction of imitation learning and structured prediction to no-regret online learning
S. Ross, G. Gordon, and D. Bagnell · 2011
Earlier work this paper cites.
A survey of monte carlo tree search methods
C. B. Browne, E. Powley, D. Whitehouse, S. M. Lucas, P. I. Cowling, P. Rohlfshagen, S. Tavener, D. Perez, S. Samothrakis, and S. Colton · 2012
Earlier work this paper cites.
Unifying count-based exploration and intrinsic motivation
M. G. Bellemare, S. Srinivasan, G. Ostrovski, T. Schaul, D. Saxton, and R. Munos · 2016
Earlier work this paper cites.
Vime: variational information maximizing exploration
R. Houthooft, X. Chen, Y. Duan, J. Schulman, F. De Turck, and P. Abbeel · 2016
Earlier work this paper cites.
PAC reinforcement learning with rich observations
A. Krishnamurthy, A. Agarwal, and J. Langford · 2016
Earlier work this paper cites.
Mastering the game of go with deep neural networks and tree search
D. Silver, A. Huang, C. J. Maddison, A. Guez, L. Sifre, G. Van Den Driessche, J. Schrittwieser, I. Antonoglou, V. Panneershelvam, M. Lanctot, et al · 2016
Earlier work this paper cites.
Curiosity-driven exploration by self-supervised prediction
D. Pathak, P. Agrawal, A. A. Efros, and T. Darrell · 2017
Earlier work this paper cites.
Proximal policy optimization algorithms
J. Schulman, F. Wolski, P. Dhariwal, A. Radford, and O. Klimov · 2017
Cited alongside, same era.
Attention is all you need
A. Vaswani, N. Shazeer, N. Parmar, J. Uszkoreit, L. Jones, A. N. Gomez, Ł. Kaiser, and I. Polosukhin · 2017
Cited alongside, same era.
A general reinforcement learning algorithm that masters chess, shogi, and go through self-play
D. Silver, T. Hubert, J. Schrittwieser, I. Antonoglou, M. Lai, A. Guez, M. Lanctot, L. Sifre, D. Kumaran, T. Graepel, et al · 2018
Cited alongside, same era.
Rudder: Return decomposition for delayed rewards
J. A. Arjona-Medina, M. Gillhofer, M. Widrich, T. Unterthiner, J. Brandstetter, and S. Hochreiter · 2019
Cited alongside, same era.
Exploration by random network distillation
Y. Burda, H. Edwards, A. Storkey, and O. Klimov · 2019
Cited alongside, same era.
Reward-free exploration for reinforcement learning
Aesop: White-box best-first proof search for lean
J. Limperg and A. H. From · 2023
Later among the works it cites.
Top-down design of protein architectures with reinforcement learning
I. D. Lutz, S. Wang, C. Norn, A. Courbet, A. J. Borst, Y. T. Zhao, A. Dosey, L. Cao, J. Xu, E. M. Leaf, et al · 2023
Later among the works it cites.
OpenAI · 2023
Later among the works it cites.
A language-agent approach to formal theorem-proving
A. Thakur, Y. Wen, and S. Chaudhuri · 2023
Later among the works it cites.
llmstep: Llm proofstep suggestions in lean
S. Welleck and R. Saha · 2023
Later among the works it cites.
minif2f-lean4
K. Yang · 2023
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
C. Jin, A. Krishnamurthy, M. Simchowitz, and T. Yu · 2020
Cited alongside, same era.
The Lean mathematical library
Mathlib Community · 2020
Cited alongside, same era.
Generative language modeling for automated theorem proving
S. Polu and I. Sutskever · 2020
Cited alongside, same era.
Mastering atari, go, chess and shogi by planning with a learned model
J. Schrittwieser, I. Antonoglou, T. Hubert, K. Simonyan, L. Sifre, S. Schmitt, A. Guez, E. Lockhart, D. Hassabis, T. Graepel, et al · 2020
Cited alongside, same era.
The lean 4 theorem prover and programming language
L. d. Moura and S. Ullrich · 2021
Cited alongside, same era.
Discovering faster matrix multiplication algorithms with reinforcement learning
A. Fawzi, M. Balog, A. Huang, T. Hubert, B. Romera-Paredes, M. Barekatain, A. Novikov, F. J. R Ruiz, J. Schrittwieser, G. Swirszcz, et al · 2022
Cited alongside, same era.
Hypertree proof search for neural theorem proving
G. Lample, M.-A. Lachaux, T. Lavril, X. Martinet, A. Hayat, G. Ebner, A. Rodriguez, and T. Lacroix · 2022
Cited alongside, same era.
Leandojo: theorem proving with retrieval-augmented language models
K. Yang, A. M. Swope, A. Gu, R. Chalamala, P. Song, S. Yu, S. Godil, R. Prenger, and A. Anandkumar · 2023
Later among the works it cites.
Tree of thoughts: deliberate problem solving with large language models
S. Yao, D. Yu, J. Zhao, I. Shafran, T. L. Griffiths, Y. Cao, and K. Narasimhan · 2023
Later among the works it cites.
Decomposing the enigma: Subgoal-based demonstration learning for formal theorem proving
X. Zhao, W. Li, and L. Kong · 2023
Later among the works it cites.
Lyra: Orchestrating dual correction in automated theorem proving
C. Zheng, H. Wang, E. Xie, Z. Liu, J. Sun, H. Xin, J. Shen, Z. Li, and Y. Li · 2023
Later among the works it cites.
Llemma: An open language model for mathematics
Z. Azerbayev, H. Schoelkopf, K. Paster, M. Dos Santos, S. M. McAleer, A. Q. Jiang, J. Deng, S. Biderman, and S. Welleck · 2024
Closest in time.
minictx: Neural theorem proving with (long-)contexts, 2024
J. Hu, T. Zhu, and S. Welleck · 2024
Closest in time.
Lean-star: Learning to interleave thinking and proving
H. Lin, Z. Sun, Y. Yang, and S. Welleck · 2024
Closest in time.
DeepSeekMath: Pushing the limits of mathematical reasoning in open language models
Z. Shao, P. Wang, Q. Zhu, R. Xu, J. Song, M. Zhang, Y. Li, Y. Wu, and D. Guo · 2024
Closest in time.
Theoremllama: Transforming general-purpose llms into lean4 experts
R. Wang, J. Zhang, Y. Jia, R. Pan, S. Diao, R. Pi, and T. Zhang · 2024
Closest in time.
Lean-github: Compiling github lean repositories for a versatile lean prover
Z. Wu, J. Wang, D. Lin, and K. Chen · 2024
Closest in time.
Deepseek-prover: Advancing theorem proving in llms through large-scale synthetic data
H. Xin, D. Guo, Z. Shao, Z. Ren, Q. Zhu, B. Liu, C. Ruan, W. Li, and X. Liang · 2024
Closest in time.
DeepSeek-Coder-V2: Breaking the barrier of closed-source models in code intelligence
Q. Zhu, D. Guo, Z. Shao, D. Yang, P. Wang, R. Xu, Y. Wu, Y. Li, H. Gao, S. Ma, et al · 2024
Closest in time.