- Rating
- 2
- Confidence
- 4
- Informativeness
- 1
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
This paper proposes an LLM-guided framework for evolving symbolic regression algorithms (mainly for PySR). The LLM modifies components of PySR and BasicSR, including mutation, selection, survival, and loss functions, using performance across training tasks as feedback. Repeated evaluations reduce the influence of stochastic search outcomes during algorithm selection. The resulting algorithms are evolved and evaluated on SRBench.
Critical strengths
-
The research problem is meaningful. Symbolic regression is an important and active research area.
-
The experiments cover a broad range of settings. The paper investigates multiple training objectives, noise levels, search budgets, and application domains, and examines the effects of reevaluation and individual algorithm components.
Critical weaknesses
1. The comparisons do not establish competitiveness with recent symbolic regression methods.
Demonstrating improvements over the original PySR and several traditional methods is insufficient. Recent methods—including MOD-SR[1], LLM-SR[2], RESTART[3], SR-Scientist[4], GenSR[5], PiT-PO[6] and so on—represent substantial developments in symbolic regression, and several report improvements over PySR under their respective evaluation settings. The final evolved algorithms should therefore be compared directly with representative recent methods, not only traditional methods in Fig 2 and Tab 1.
The recovery improvement decreases from 50.6% → 58.6% in Table 1 to 47.0% → 51.5% after excluding training and validation tasks. On black-box tasks, the best Evolved PySR achieves an average $R^2& of 0.811, below the original PySR’s 0.814. For context, GenSR reports 0.8416 (which is the work in ICLR 2026, not the latest method), compared with 0.817 for the best evolved algorithm in this paper. Different task subsets and budgets prevent a direct ranking, but reinforce the need for a comparison with recent methods. Moreover, MDLFormer’s Appendix Table 8 reports black-box results, whereas its corresponding entry in this paper’s Table 1 is left blank.
Without demonstrating competitive performance over contemporary methods, the results primarily establish an incremental improvement to PySR, rather than a substantive advance over the current state of symbolic regression.
2. The methodological novelty is limited, and a closely related method is omitted.
Using an LLM to modify evolutionary search operators through task-level performance feedback is already explored in prior work. In particular, the paper omits LLM-Meta-SR[7], which uses an LLM to generate selection-operator code, evolves that code in an outer loop, runs symbolic regression in an inner loop, and uses performance across multiple tasks to guide subsequent modifications. This substantially overlaps with the central design of the present framework.
Modifying additional components and incorporating reevaluation provide extensions, but the paper does not establish a sufficiently distinct algorithmic contribution. The analysis also attributes much of the improvement to affine scaling in the loss and subtree duplication, both of which the paper acknowledges have precedents in earlier symbolic regression research.
3.Training on SRBench leaves generalization beyond familiar equation families insufficiently established.
An LLM may possess prior knowledge of public benchmarks and common physical equations. When optimizing search algorithms on SRBench, it may generate rules particularly suited to these familiar structures. Such specialization can be encoded in the resulting algorithm even when no LLM is used at inference time.
4.The main recovery results include tasks used to develop the algorithms.
Table 1 evaluates recovery on all 130 tasks, including the 20 training tasks and 20 validation tasks used for algorithm development and selection. Consequently, the headline results mix development performance with generalization performance.
The main comparison in Tab. 1 should evaluate all methods on the same strictly held-out tasks. This matters quantitatively, because the reported improvement falls from 8.0 percentage points to 4.5 percentage points after excluding training and validation tasks.
5. The improvements are strongly objective-dependent, and evidence of broader practical gains is limited.
The evolved PySR selected for its best recovery performance achieves a black-box of only 0.659, compared with 0.814 for the original PySR. Even the mixed-objective version reaches only 0.811. Thus, improved exact recovery does not translate into improved predictive performance and can come with a substantial trade-off.
The empirical-data results also provide limited evidence of a broad improvement: successful trials increase from 72/90 to 74/90, with the recovery difference confined to the Rydberg task. These findings support useful specialization for particular objectives, but provide weaker support for the broader claim of a generally improved symbolic regression algorithm.
[1] MOD-SR: Unifying Multimodal Learning and Direct Optimization with Gradient-Guided Diffusion Model for Symbolic Regression, ICML 2026.
[2] LLM-SR: Scientific Equation Discovery via Programming with Large Language Models, ICLR 2025.
[3] Robust Equation Structure Learning with Adaptive Refinement, ICLR 2026.
[4] SR-Scientist: Scientific Equation Discovery With Agentic AI, ICLR 2026.
[5] GenSR: Symbolic Regression Based on Equation Generative Space, ICLR 2026.
[6] LLM-Based Scientific Equation Discovery via Physics-Informed Token-Regularized Policy Optimization, KDD 2026.
[7] LLM-Meta-SR: In-Context Learning for Evolving Selection Operators in Symbolic Regression, IEEE Transactions on Evolutionary Computation,2026
Questions for authors
No
Response
Thank you for the feedback! Our response to each point is below.
We now compare with all methods you list. Evolved PySR is competitive with LLM-based methods while making no LLM calls at inference. Full details are in Appendix G.
We evaluated base and evolved PySR on LSR-Synth for 30 minutes (single CPU) or 1 hour (8 cores) and calculated metrics matching each paper's evaluation.
Evolved PySR improves over base PySR by 11–17 points. At the larger budget, it generally outperforms SR-Scientist and RESTART and roughly matches PiT-PO. These methods call an LLM throughout the search (1,000+ queries per problem, and almost 40× that for PiT-PO), whereas evolved PySR runs a standard evolutionary search on CPU with no LLM calls.
Thanks for the pointer; it is now cited and discussed in Related Work. We agree that our work shares its overall framework and do not claim the meta-evolution outer loop as a novel contribution. What's new relative to LLM-Meta-SR:
We consistently find that the evolved algorithm generalizes to new problem families:
We've revised all headline numbers in the abstract and tables to report only held-out results, which preserve the method's advantage (54.3% vs. 50.2% for base PySR).
The drop in black-box R2 in the GT-evolved PySR is due to the built-in affine-scaling of the evolved loss function. This doesn’t affect GT recovery, which accepts a constant offset, but it can leave coefficients uncalibrated for R2. Fitting a scale and offset to equations on the training data before evaluating R2 improves black-box score to 0.823.
The question of generalization of the evolved algorithm has already been discussed in answers to W3 and W1. The new LSR-Synth results are the most convincing evidence of discovering a generally improved SR algorithm: LSR-Synth measures numeric accuracy on held-out data rather than symbolic recovery, and evolved PySR improves on every metric and budget.