mlsanityData to 14 Oct 2026

Machine-Learned Premise Selection for Lean

arXiv 2304.00994 ↗First posted 17 Mar 2023cs.AI cs.LG cs.LOcited by 10

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

  1. 2019The Lean mathematical librarycited by 134
  2. 2016DeepMath - Deep Sequence Models for Premise Selectioncited by 81
  3. 2017ENIGMA: Efficient Learning-based Inference Guiding Machinecited by 26
  4. 2013MizAR 40 for Mizar 40cited by 23
  5. 2018ATPboost: Learning Premise Selection in Binary Setting with ATP Feedbackcited by 12
  6. 2021Online Machine Learning Techniques for Coq: A Comparisoncited by 7

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2023: 1; 2024: 5; 2025: 2; 2026: 2.

10 papers.