analiza aiqbench
This research demonstrates a reinforcement learning agent capable of solving symbolic equations step-by-step, effectively casting algebraic problems as Markov Decision Processes with dynamic action spaces. The model matches or exceeds prior state-of-the-art results on closed equations and specific restricted-open families without relying on supervised solution traces for the core policy. While the approach is confined to controlled equation families rather than general open-equation solving, it highlights significant progress in applying RL to formal mathematical reasoning tasks.
Reinforcement Learning for Symbolic Equation Solving
arXiv:2608.30162v1 Announce Type: new Abstract: We present a reinforcement-learning agent that solves symbolic equations step by step, covering both nonlinear closed equations (radicals, exponentials, trigonometric) and a controlled class of restricted-open families requiring a change of variables (CoV) such as completing the square. We cast algebra as an MDP with a dynamic action space and a tree-structured policy (TreeMLP). The main policy learns from reward alone with no supervised solution traces; the CoV substitution comes from a supervised generator interchangeable with a CAS call. On closed equations the agent matches the prior best on CommonCore (0.93 greedy vs. ConPoLe's 0.925) under a single policy. On four hand-designed restricted-open families (quadratic, cubic, quartic, exponential) it reaches 0.79 beam / 0.67 greedy, exceeding the strongest non-learned search (A-star, 0.64). Learned CoV timing has content only on the exponential family, the one requiring a nested CoV, where a natural rule solves none of the held-out equations while the policy solves 75% from reward alone. At 10x scale a sharp seed-level bimodality emerges; a UCB learning-progress curriculum shows a non-significant positive trend toward mitigating it. We do not claim general open-equation solving: every open-equation result is confined to these four controlled families.
Abstract:We present a reinforcement-learning agent that solves symbolic equations step by step, covering both nonlinear closed equations (radicals, exponentials, trigonometric) and a controlled class of restricted-open families requiring a change of variables (CoV) such as completing the square. We cast algebra as an MDP with a dynamic action space and a tree-structured policy (TreeMLP). The main policy learns from reward alone with no supervised solution traces; the CoV substitution comes from a supervised generator interchangeable with a CAS call. On closed equations the agent matches the prior best on CommonCore (0.93 greedy vs. ConPoLe's 0.925) under a single policy. On four hand-designed restricted-open families (quadratic, cubic, quartic, exponential) it reaches 0.79 beam / 0.67 greedy, exceeding the strongest non-learned search (A-star, 0.64). Learned CoV timing has content only on the exponential family, the one requiring a nested CoV, where a natural rule solves none of the held-out equations while the policy solves 75% from reward alone. At 10x scale a sharp seed-level bimodality emerges; a UCB learning-progress curriculum shows a non-significant positive trend toward mitigating it. We do not claim general open-equation solving: every open-equation result is confined to these four controlled families.
Machine Learning (cs.LG)
arXiv:2608.30162 [cs.LG]
(or arXiv:2608.30162v1 [cs.LG] for this version)
https://doi.org/10.48550/arXiv.2608.30162 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Text integral sub licența deschisă a publicației · 287 cuvinte
Subiecte conexe
Learning Fast Monomial Orders for Gr\"obner Basis Computations
arXiv · 31 aug. 2026
Enhancing Transformer Representations of Symbolic ODE Expressions
arXiv · 22 sept. 2026
Dynamical System Transfer Learning with Reduced Order Models
Towards Data Science · 5 sept. 2026
Achieving Olympiad-Level Geometry Large Language Model Agent via Complexity Boosting Reinforcement Learning
arXiv · 3 sept. 2026