ImageNet classification with deep convolutional neural networks
Alex Krizhevsky, Ilya Sutskever et al.
0
Citations
0
Influential Citations
—
Venue
2026
Year
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. Finite, noisy data often yield numerically competitive expressions that imply very different behavior outside the observed regime, making numerical fit and syntactic complexity insufficient measures of scientific credibility. Existing approaches largely focus on improving expressions, yet the search typically retains little beyond the resulting formula and score, losing the scientific record, such as motivations and probes, that inform what to try next. AutoSR preserves this record in a \textbf{Research State}, coupling each candidate equation with the reasoning, computational evidence, and independent review developed along its branch. Proposer--reviewer agents develop these states under progressive-widening Monte Carlo tree search (PW-MCTS), which allocates computation across competing investigations, while the accumulated research record is ultimately synthesized into a final report that explains the leading relation and the basis for its selection. Across nine selected challenges from two benchmark suites, AutoSR recovers algebraically equivalent relations in every case, including three cp3-bench problems that no published system recovers and six structurally diverse LSR-Transform problems. Overall, AutoSR extends symbolic regression from equation-level search toward automated scientific investigation, allowing scientific knowledge and accumulated evidence to shape both what is explored and how the resulting equation is justified.
Symbolic regression has long been challenged by the ambiguity of finite, noisy data: many expressions fit equally well numerically but diverge outside the observed range. Traditional methods optimize for numerical fit and syntactic simplicity, which are insufficient for scientific credibility. AutoSR addresses this by preserving the entire research process—motivations, probes, and reviews—rather than just the final equation. This is a paradigm shift from equation-level search to investigation-level search, aligning with the broader trend toward automated scientific discovery.
The paper's emphasis on 'Research States' is particularly significant. By coupling each candidate equation with the reasoning and evidence that led to it, AutoSR enables more informed exploration and justification. This is a step toward AI systems that not only find solutions but also explain why they are scientifically plausible. The use of proposer-reviewer agents under progressive-widening MCTS is a novel mechanism to balance exploration and exploitation across competing research directions.
AutoSR was evaluated on nine selected challenges from two benchmark suites: cp3-bench and LSR-Transform. It recovered algebraically equivalent relations in all nine cases. Notably, it solved three cp3-bench problems that no published system has recovered, demonstrating its ability to handle challenging scientific discovery tasks. The six LSR-Transform problems were structurally diverse, showing the method's generality. These results are impressive, though the paper does not provide quantitative metrics like error rates or computational costs, which would strengthen the evaluation.
AutoSR represents a significant step toward automated scientific investigation. By preserving and utilizing the scientific record, it addresses the credibility gap in symbolic regression. This could impact fields like physics, biology, and engineering, where discovering interpretable and justifiable equations is crucial. The approach also opens avenues for integrating large language models as agents in research processes, potentially leading to more autonomous and transparent AI-driven discovery. However, the computational overhead and reliance on agent quality remain open challenges.
Alex Krizhevsky, Ilya Sutskever et al.
Ashish Vaswani, Noam Shazeer et al.
Douglas M. Bates, Martin Mächler et al.
Diederik P. Kingma, Jimmy Ba