mlsanityData to 7 Oct 2026

LEMMA: Bootstrapping High-Level Mathematical Reasoning with Learned Symbolic Abstractions

arXiv 2211.08671 ↗First posted 16 Nov 2022cs.AIcited by 5

On the map: LLM reasoning → Mathematical reasoning

Abstract (arXiv)

Humans tame the complexity of mathematical reasoning by developing hierarchies of abstractions. With proper abstractions, solutions to hard problems can be expressed concisely, thus making them more likely to be found. In this paper, we propose Learning Mathematical Abstractions (LEMMA): an algorithm that implements this idea for reinforcement learning agents in mathematical domains. LEMMA augments Expert Iteration with an abstraction step, where solutions found so far are revisited and rewritten in terms of new higher-level actions, which then become available to solve new problems. We evaluate LEMMA on two mathematical reasoning tasks--equation solving and fraction simplification--in a step-by-step fashion. In these two domains, LEMMA improves the ability of an existing agent, both solving more problems and generalizing more effectively to harder problems than those seen during training.

Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). Placed in Mathematical reasoning, one of 17 directions in LLM reasoning. Builds on 8 of its 17 references that are in the map. First posted on arXiv 16 Nov 2022.

Builds on

8 of 17 references.

References · 8

  1. 2017Thinking Fast and Slow with Deep Learning and Tree Searchcited by 245
  2. 2022HyperTree Proof Search for Neural Theorem Provingcited by 192
  3. 2016DeepCoder: Learning to Write Programscited by 145
  4. 2022Formal Mathematics Statement Curriculum Learningcited by 141
  5. 2018Reinforcement Learning of Theorem Provingcited by 69
  6. 2021Leveraging Language to Learn Program Abstractions and Search Heuristicscited by 44
  7. 2021TacticZero: Learning to Prove Theorems from Scratch with Deep Reinforcement Learningcited by 37
  8. 2021Contrastive Reinforcement Learning of Symbolic Reasoning Domainscited by 17

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2023: 1; 2024: 3; 2025: 0; 2026: 1.

5 papers.

Similar, not cited

Close in wording, no citation either way

  1. 2022Peano: Learning Formal Mathematical Reasoning
  2. 2026VERIFY-RL: Verifiable Recursive Decomposition for Reinforcement Learning in Mathematical Reasoning
  3. 2025AbstRaL: Augmenting LLMs' Reasoning by Reinforcing Abstract Thinking
  4. 2026Adaptive Problem Generation via Symbolic Representations
  5. 2025LogicPuzzleRL: Cultivating Robust Mathematical Reasoning in LLMs via Reinforcement Learning
  6. 2026Artificial Intelligence for Mathematical Reasoning: An Integrated Survey of Language Models, Neuro-symbolic Systems, and Verified Discovery
  7. 2022Learning to Reason With Relational Abstractions
  8. 2025MathSmith: Towards Extremely Hard Mathematical Reasoning by Forging Synthetic Problems with a Reinforced Policy