Learning Interestingness in Automated Mathematical Theory Formation
Not on the map. Why?
Abstract (arXiv)
We take two key steps in automating the open-ended discovery of new mathematical theories, a grand challenge in artificial intelligence. First, we introduce FERMAT, a reinforcement learning (RL) environment that models concept discovery and theorem-proving using a set of symbolic actions, opening up a range of RL problems relevant to theory discovery. Second, we explore a specific problem through FERMAT: automatically scoring the interestingness of mathematical objects. We investigate evolutionary algorithms for synthesizing nontrivial interestingness measures. In particular, we introduce an LLM-based evolutionary algorithm that features function abstraction, leading to notable improvements in discovering elementary number theory and finite fields over hard-coded baselines. We open-source the FERMAT environment at this URL(https://github.com/trishullab/Fermat).
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 17 of its 52 references that are in the map. First posted on arXiv 5 Nov 2025.
Builds on
17 of 52 references.
References · 17
- 2017Curiosity-driven Exploration by Self-supervised Predictioncited by 1,194
- 2016Unifying Count-Based Exploration and Intrinsic Motivationcited by 639
- 2023Eureka: Human-Level Reward Design via Coding Large Language Modelscited by 571
- 2020Generative Language Modeling for Automated Theorem Provingcited by 388
- 2022Draft, Sketch, and Prove: Guiding Formal Theorem Provers with Informal Proofscited by 291
- 2020DreamCoder: Growing generalizable, interpretable knowledge with wake-sleep Bayesian program learningcited by 161
- 2024Symbolic Regression with a Learned Concept Librarycited by 83
- 2023An In-Context Learning Agent for Formal Theorem-Provingcited by 82
- 2025STP: Self-play LLM Theorem Provers with Iterative Conjecturing and Provingcited by 79
- 2022Top-Down Synthesis for Library Learningcited by 58
- 2023LILO: Learning Interpretable Libraries by Compressing and Documenting Codecited by 49
- 2024Learning Formal Mathematics From Intrinsic Motivationcited by 45
5 more
- 2020Meta-learning curiosity algorithmscited by 25
- 2016Solving and Verifying the boolean Pythagorean Triples problem via Cube-and-Conquercited by 23
- 2019The Ramanujan Machine: Automatically Generated Conjectures on Fundamental Constantscited by 5
- 2023First-Explore, then Exploit: Meta-Learning to Solve Hard Exploration-Exploitation Trade-Offscited by 4
- 2024Automated conjecturing with TxGraffiticited by 4
Built on by
Citing papers per year: 2026: 2.
2 papers.
- 2026Artificial Intelligence and the Structure of Mathematicscited by 4
- 2026Learning to Discover Interesting Mathematicscited by 0
- 2026Learning to Discover Interesting Mathematics23 Sep 2026
- 2026Artificial Intelligence and the Structure of Mathematics7 Apr 2026
Similar, not cited
Close in wording, no citation either way
- 2025Mathematical exploration and discovery at scale
- 2026Measuring Progress in Reasoning Toward Mathematical Discovery with Automatic Verification
- 2024Mathematics and Machine Creativity: A Survey on Bridging Mathematics with AI
- 2026Agentic Neurosymbolic Collaboration for Mathematical Discovery: A Case Study in Combinatorial Design
- 2025AI Mathematician as a Partner in Advancing Mathematical Discovery -- A Case Study in Homogenization Theory
- 2025A Matter of Interest: Understanding Interestingness of Math Problems in Humans and Language Models
- 2026Artificial Intelligence for Mathematical Reasoning: An Integrated Survey of Language Models, Neuro-symbolic Systems, and Verified Discovery
- 2026Iteris: Agentic Research Loops for Computational Mathematics