- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
The paper proposes L2G-SR, a method that uses a learned structural verifier to guide large language models for symbolic regression. The authors point out that traditional symbolic regression mainly uses numerical fitting error to guide search, but a lower prediction error does not mean that the candidate expression has the correct mathematical structure. To solve this problem, this paper first designs an improved Tree Edit Distance (TED), which provides supervision signals for structural differences between candidate and target expressions through constant abstraction, commutativity handling, and multiple algebraic representations. Then, the authors use large-scale synthetic data to train a multimodal verifier, enabling it to predict the structural distance between a candidate expression and the unknown target expression based on observed data, candidate expressions, and auxiliary regression features. Finally, the authors integrate the verifier into an iterative search framework composed of two LLM roles, Analyst and Generator, alternately using numerical fitting error and predicted TED to guide candidate selection, formula modification, and search.
Critical strengths
This paper focuses on the inconsistency between numerical fitting and structure recovery in symbolic regression, with a clear and practically meaningful research motivation. L2G-SR constructs structural supervision signals by improving TED, and combines formula tree addresses and auxiliary regression features to train a structural verifier, providing structural feedback beyond numerical error for search.
Critical weaknesses
-
Existing work, Symbolic Regression via MDLformer-Guided Search: From Minimizing Prediction Error to Minimizing Description Length, has already used a learned model to estimate description length and used it as search guidance to improve the structural recovery ability of symbolic regression. L2G-SR directly predicts the TED between a candidate expression and the unknown target expression, and integrates it into an LLM-driven iterative search framework. Although the two differ in structural scoring methods and search algorithms, the core idea of both is to use learned structure-related signals to compensate for the insufficiency of numerical fitting error. Therefore, the paper has not yet fully explained what substantive methodological innovation direct TED prediction brings compared with the existing MDLformer. In addition, the paper lacks a direct comparison with MDLformer, making it difficult to determine whether the performance improvement comes from the new structural guidance or from other mechanisms such as LLM search, formula diagnosis, and post-processing. The authors are suggested to compare on common benchmarks and matched computational budgets, and further analyze the advantages and disadvantages of the two structural guidance methods to clarify the incremental contribution of this paper.
-
The core goal of symbolic regression is not only to obtain a low numerical fitting error, but also to recover the mathematical structure of the target expression. However, this paper mainly uses NMSE, equation-level accuracy (Acco-01), and true normalized tree edit distance (True TED) to evaluate algorithm performance, and does not directly report the expression recovery rate.
Questions for authors
See Weaknesses