Machine-Learned Premise Selection for Lean
Not on the map. Why?
Abstract (arXiv)
We introduce a machine-learning-based tool for the Lean proof assistant that suggests relevant premises for theorems being proved by a user. The design principles for the tool are (1) tight integration with the proof assistant, (2) ease of use and installation, (3) a lightweight and fast approach. For this purpose, we designed a custom version of the random forest model, trained in an online fashion. It is implemented directly in Lean, which was possible thanks to the rich and efficient metaprogramming features of Lean 4. The random forest is trained on data extracted from mathlib -- Lean's mathematics library. We experiment with various options for producing training features and labels. The advice from a trained model is accessible to the user via the suggest_premises tactic which can be called in an editor while constructing a proof interactively.
Key facts. Cited by 10 papers in the map (data through 14 Oct 2026). Builds on 6 of its 16 references that are in the map. First posted on arXiv 17 Mar 2023.
Builds on
6 of 16 references.
References · 6
- 2019The Lean mathematical librarycited by 134
- 2016DeepMath - Deep Sequence Models for Premise Selectioncited by 81
- 2017ENIGMA: Efficient Learning-based Inference Guiding Machinecited by 26
- 2013MizAR 40 for Mizar 40cited by 23
- 2018ATPboost: Learning Premise Selection in Binary Setting with ATP Feedbackcited by 12
- 2021Online Machine Learning Techniques for Coq: A Comparisoncited by 7
Built on by
Citing papers per year: 2023: 1; 2024: 5; 2025: 2; 2026: 2.
10 papers.
- 2023LeanDojo: Theorem Proving with Retrieval-Augmented Language Modelscited by 427
- 2024Lean Copilot: Large Language Models as Copilots for Theorem Proving in Leancited by 58
- 2024LeanAgent: Lifelong Learning for Formal Theorem Provingcited by 35
- 2025Proving Olympiad Inequalities by Synergizing LLMs and Symbolic Reasoningcited by 17
- 2024Graph2Tac: Online Representation Learning of Formal Math Conceptscited by 15
- 2024Rigor with Machine Learning from Field Theory to the Poincar'e Conjecturecited by 12
- 2024Learning Guided Automated Reasoning: A Brief Surveycited by 7
- 2025Premise Selection for a Lean Hammercited by 6
- 2026Neuro-Symbolic Proof Generation for Scaling Systems Software Verificationcited by 1
- 2026Beyond Correctness: Toward Automated Novelty Verification with Lean 4cited by 0
- 2026Beyond Correctness: Toward Automated Novelty Verification with Lean 42 Aug 2026
- 2026Neuro-Symbolic Proof Generation for Scaling Systems Software Verification20 Mar 2026
- 2025Premise Selection for a Lean Hammer9 Jun 2025
- 2025Proving Olympiad Inequalities by Synergizing LLMs and Symbolic Reasoning19 Feb 2025
- 2024LeanAgent: Lifelong Learning for Formal Theorem Proving8 Oct 2024
- 2024Lean Copilot: Large Language Models as Copilots for Theorem Proving in Lean18 Apr 2024
- 2024Learning Guided Automated Reasoning: A Brief Survey6 Mar 2024
- 2024Rigor with Machine Learning from Field Theory to the Poincar'e Conjecture20 Feb 2024
- 2024Graph2Tac: Online Representation Learning of Formal Math Concepts5 Jan 2024
- 2023LeanDojo: Theorem Proving with Retrieval-Augmented Language Models27 Jun 2023