mlsanityData to 14 Oct 2026

Discovering Mathematical Formulas from Data via GPT-guided Monte Carlo Tree Search

arXiv 2401.14424 ↗First posted 24 Jan 2024cs.LG cs.AIcited by 10

Not on the map. Why?

Abstract (arXiv)

Finding a concise and interpretable mathematical formula that accurately describes the relationship between each variable and the predicted value in the data is a crucial task in scientific research, as well as a significant challenge in artificial intelligence. This problem is referred to as symbolic regression, which is an NP-hard problem. In the previous year, a novel symbolic regression methodology utilizing Monte Carlo Tree Search (MCTS) was advanced, achieving state-of-the-art results on a diverse range of datasets. although this algorithm has shown considerable improvement in recovering target expressions compared to previous methods, the lack of guidance during the MCTS process severely hampers its search efficiency. Recently, some algorithms have added a pre-trained policy network to guide the search of MCTS, but the pre-trained policy network generalizes poorly. To optimize the trade-off between efficiency and versatility, we introduce SR-GPT, a novel algorithm for symbolic regression that integrates Monte Carlo Tree Search (MCTS) with a Generative Pre-Trained Transformer (GPT). By using GPT to guide the MCTS, the search efficiency of MCTS is significantly improved. Next, we utilize the MCTS results to further refine the GPT, enhancing its capabilities and providing more accurate guidance for the MCTS. MCTS and GPT are coupled together and optimize each other until the target expression is successfully determined. We conducted extensive evaluations of SR-GPT using 222 expressions sourced from over 10 different symbolic regression datasets. The experimental results demonstrate that SR-GPT outperforms existing state-of-the-art algorithms in accurately recovering symbolic expressions both with and without added noise.

Key facts. Cited by 10 papers in the map (data through 14 Oct 2026). Builds on 17 of its 40 references that are in the map. First posted on arXiv 24 Jan 2024.

Builds on

17 of 40 references.

References · 17

  1. 2018Soft Actor-Critic: Off-Policy Maximum Entropy Deep Reinforcement Learning with a Stochastic Actorcited by 4,885
  2. 2014Empirical Evaluation of Gated Recurrent Neural Networks on Sequence Modelingcited by 2,367
  3. 2013Generating Sequences With Recurrent Neural Networkscited by 554
  4. 2019AI Feynman: a Physics-Inspired Method for Symbolic Regressioncited by 548
  5. 2019Deep symbolic regression: Recovering mathematical expressions from data via risk-seeking policy gradientscited by 309
  6. 2021Neural Symbolic Regression that Scalescited by 192
  7. 2015Maximum Entropy Deep Inverse Reinforcement Learningcited by 176
  8. 2020AI Feynman 2.0: Pareto-optimal symbolic regression exploiting graph modularitycited by 144
  9. 2017L2 Regularization versus Batch and Weight Normalizationcited by 124
  10. 2016Extrapolation and learning equationscited by 110
  11. 2021Recent advances and clinical applications of deep learning in medical image analysiscited by 104
  12. 2021Symbolic Regression via Neural-Guided Genetic Programming Population Seedingcited by 101
5 more
  1. 2019Integration of Neural Network-Based Symbolic Regression in Deep Learning for Scientific Discoverycited by 93
  2. 2023Transformer-based Planning for Symbolic Regressioncited by 79
  3. 2022Symbolic Physics Learner: Discovering governing equations via Monte Carlo tree searchcited by 66
  4. 2023Deep Generative Symbolic Regression with Monte-Carlo-Tree-Searchcited by 41
  5. 2023The Mathematical Gamecited by 1

Built on by

Cited by year (2026 to 14 Oct)

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

10 papers.