Iterated Agent for Symbolic Regression
Abstract
Symbolic regression (SR), the automated discovery of mathematical expressions from data, is a cornerstone of scientific inquiry. However, it is often hindered by the combinatorial explosion of the search space and a tendency to overfit. Popular methods, rooted in genetic programming, explore this space syntactically, often yielding overly complex, uninterpretable models. This paper introduces IdeaSearchFitter, a framework that employs Large Language Models (LLMs) as semantic operators within an evolutionary search. By generating candidate expressions guided by natural-language rationales, our method biases discovery towards models that are not only accurate but also conceptually coherent and interpretable. We demonstrate IdeaSearchFitter's efficacy across diverse challenges: it achieves competitive, noise-robust performance on the Feynman Symbolic Regression Database (FSReD), outperforming several strong baselines; discovers mechanistically aligned models with good accuracy-complexity trade-offs on real-world data; and derives compact, physically-motivated parametrizations for Parton Distribution Functions in a frontier high-energy physics application. IdeaSearchFitter is a specialized module within our broader iterated agent framework, IdeaSearch, which is publicly available at https://www.ideasearch.cn/.
Cite
@article{arxiv.2510.08317,
title = {Iterated Agent for Symbolic Regression},
author = {Zhuo-Yang Song and Zeyu Cai and Shutao Zhang and Jiashen Wei and Jichen Pan and Shi Qiu and Qing-Hong Cao and Tie-Jiun Hou and Xiaohui Liu and Ming-xing Luo and Hua Xing Zhu},
journal= {arXiv preprint arXiv:2510.08317},
year = {2025}
}
Comments
45 pages, 22 figures, 8 tables