arXiv AI

AutoSR: Automatic Symbolic Regression by Searching Research States

arXiv:2608. 16876v1 Announce Type: cross Abstract: We introduce Automatic Symbolic Regression (AutoSR), a fully automated system that instantiates Research-Space Symbolic Regression by searching persistent scientific investigations rather than isolated equations.

arXiv Machine Learning
Aug 31

Probabilistic Symbolic Regression for Equation Discovery via Operator-induced and Regularized Symbolic Forests

The paper presents a probabilistic symbolic regression framework that models mathematical expressions as ensembles of symbolic trees, using a regularizing prior to control complexity and an Occam’s window-based posterior to capture uncertainty across plausible models. It provides theoretical guarantees on posterior concentration, including near‑parametric rates when an exact finite formula exists and oracle results under misspecification. Empirical results show the method outperforms state‑of‑the‑art competitors in predictive accuracy, symbolic complexity, and structural recovery on benchmark scientific equations and a materials discovery task.

By Somjit Roy, Pritam Dey, Bani K. Mallick, Debdeep Pati
arXiv Machine Learning
Sep 21

MOSAIC-SR: Transformer-Guided Symbolic Regression for Scientific Equation Recovery

MOSAIC‑SR is a new symbolic regression method that combines a pretrained Transformer with search‑based refinement. The Transformer generates multiple initial sketches, which seed searches that jointly recover equation structure and constants using scale‑aware optimization and symbolic repair. On the SRSD‑Feynman dataset and six other benchmarks, MOSAIC‑SR achieves the highest symbolic solution rate and ranks among the top two in predictive accuracy, even when irrelevant dummy variables are present.

By Peiyi Zheng, Yanming Kang, Hans De Sterck, Giang Tran
Hugging Face Trending Papers
Aug 5

A-SR: Self-Evolving Agentic LLMs for Symbolic Regression via Hierarchical Coordination

Symbolic regression aims to discover closed-form equations from data, but existing LLM-guided methods often rely on a unified proposal loop that compresses heterogeneous search failures into a scalar score and a single prompt. We propose A-SR, a self-evolving agentic framework that shifts the control unit from expression edits to role-conditioned evidence views.

arXiv AI
Aug 6

A-SR: Self-Evolving Agentic LLMs for Symbolic Regression via Hierarchical Coordination

arXiv:2608. 04872v1 Announce Type: cross Abstract: Symbolic regression aims to discover closed-form equations from data, but existing LLM-guided methods often rely on a unified proposal loop that compresses heterogeneous search failures into a scalar score and a single prompt.

By Wenxiao Zhao, Dong Liu, Kaiyi Xu, Feng Liu, Zhen Zhao, Fei Ben, Shu Wang, Wenhao Li, Yingnian Wu, Fenghua Ling, Haobo Li, Lei Bai
arXiv AI
Aug 3

Library Reachability in LSR-Synth: How Anti-Memorization Design Changes the Measurement of Symbolic Discovery

arXiv:2607. 28684v1 Announce Type: new Abstract: Existing benchmarks for scientific equation discovery are largely composed of well-known equations available in the public domain, making it difficult to determine whether a model is discovering laws from data or merely recalling answers from its training corpus.

By Zhan'ao Yao, Liang Yin, Zhihao Gao, Boxuan Zhang, Xiaoyu Wu, Linjing Li, Rongyan Wang, Tingwei Chen, Youwei Wang, Xiaolin Zhao, Jiahui Shi, Jianjun Liu