- Rating
- 1
- Confidence
- 4
- Informativeness
- 1
- Presentation
- 3
- Soundness
- 1
Read review
Paper summary
This paper investigates whether fitting error can serve as a reliable search signal for exact structural recovery in symbolic regression (SR) and proposes Random Duplicate-Free Symbolic Regression (RDF-SR) as a structure-agnostic search baseline. RDF-SR is compared against fitting-error-driven methods such as PySR, DSO, and RSRM.
Critical strengths
1.The paper focuses on an important issue that is often overlooked in conventional evaluations of symbolic regression.
2.The paper is generally well organized, and the progression among the research questions is easy to follow.
Critical weaknesses
1.The discussion of related work is insufficient. The paper places “local Taylor consistency” at the center of its title, theoretical analysis, and claimed contributions, yet the Related Work section does not discuss prior symbolic regression methods that have already exploited Taylor- or derivative-based structural information to guide the search.
2.RDF-SR is not truly a “fitting-error-free baseline,” and the paper’s wording is potentially misleading. More precisely, RDF-SR is not an “error-free search” method; it simply does not use fitting error to determine which structure should be explored next. These are two very different claims.
3.The RDF-SR experiments do not isolate the effect of fitting-error guidance, and therefore the paper’s central empirical conclusion is not actually established. The comparison is not an ablation of the same search algorithm with and without fitting-error guidance. Instead, it compares fundamentally different search mechanisms. At most, the results show that “this random duplicate-free enumeration strategy performs better on these relatively simple problems.” They do not justify the stronger conclusion that fitting-error guidance itself causes worse structural recovery.
4.There appear to be several problems with the theoretical analysis. In particular, the inference from Theorem 1 to the claim that “enlarging the sampling domain reduces spurious low-error solutions” does not seem mathematically justified. The argument appears to confuse a looser upper bound with an actual increase in the quantity being bounded. In addition, the theoretical result claiming “infinitely many spurious candidates” is disconnected from the finite symbolic search spaces used in the experiments. The construction with m→∞ necessarily leaves the practical search space as expression complexity grows. Therefore, it provides very limited support for the claim that spurious candidates are abundant within the actual bounded SR search space. Using the infinitude of an unbounded function family to justify practical abundance in a bounded expression space substantially overstates the theoretical significance.
5.Beyond the potential mathematical issues, the theoretical novelty itself appears limited. The main ingredients are largely standard facts from mathematical analysis and linear algebra. More importantly, the theoretical core does not actually resolve the central question suggested by the title, Rethinking Fitting Error. The analysis merely attempts to show that distinct functions can be locally similar and then makes a substantial conceptual leap to the conclusion that fitting error therefore misleads the search.
6.The new benchmark suffers from a clear circularity issue: the test targets are generated using RDF-SR, while RDF-SR is then used as a key baseline on the same benchmark. Unlike the original benchmark, the newly constructed target expressions come from a structural distribution that RDF-SR has already demonstrated it can access. The paper then asks other algorithms to compete with RDF-SR in terms of recovery and structural balance. This benchmark is therefore likely to be inherently biased toward the grammar accessibility and search distribution of RDF-SR, making the comparison potentially unfair.
7.The paper is validated only in highly idealized settings—noise-free, univariate, synthetic benchmarks—yet the conclusions are phrased as if they apply broadly to symbolic regression. In realistic SR problems, some of the most challenging issues arise precisely from noise, multivariate interactions, and other sources of complexity that are absent from the current experiments.
Questions for authors
See Weaknesses.
Clarification of the Paper’s Contributions, Theoretical Analysis, and Evaluation Design
We acknowledge that the original manuscript lacked clarity in its organization and presentation, failing to adequately convey the research scope and main contributions of this work. We sincerely apologize for this and would like to clarify our contributions. Our main contribution is not to propose a new SR algorithm or benchmark, but to investigate, through theoretical and experimental analyses, why structurally different expressions can achieve low fitting errors, the existence and structural diversity of low-error expressions, the effectiveness of fitting-error-guided search, and the impact of sampling ranges on search performance. Based on these analyses, we identify two key capabilities of SR algorithms: extracting effective search directions from fitting error and suppressing misleading search directions induced by fitting error. We further highlight the need to study and evaluate these capabilities separately. Finally, we present an illustrative benchmark design to demonstrate how the two capabilities can be independently evaluated.
Studies that use Taylor expansions or derivative information to guide expression search differ from our theoretical analysis in their research questions, objectives, and methods. These two lines of research should therefore be distinguished. We do not use Taylor consistency to guide expression search. Instead, we use it as a theoretical tool to derive a fitting-error upper bound that explains why candidate expressions structurally distinct from the target can still achieve low fitting errors. We further investigate the existence and structural diversity of such expressions.
GP, RL, and MCTS-based SR algorithms typically use fitness, rewards, or node values derived from fitting error to guide search. Since fitting error is integral to their search mechanisms, simply removing it would prevent them from operating as designed. We therefore introduce RDF-SR, a random duplicate-free search baseline that does not use fitting error for search guidance. Under the same search space and budget, we compare its recovery rate with those of fitting-error-driven algorithms. RDF-SR randomly explores unvisited expressions using only a binary criterion to identify the target, whereas fitting-error-driven algorithms additionally use fitting error to guide search. If fitting-error guidance is effective, these algorithms should achieve higher recovery rates. This comparison provides empirical evidence for assessing the effectiveness and limitations of fitting-error guidance.
Regarding the theoretical analysis, first, Theorem 1 does not imply that an increasing error upper bound necessarily leads to higher actual fitting errors. Rather, it shows that the low-error guarantee provided by low-order Taylor consistency weakens as the sampling range expands, so some candidate expressions may no longer achieve low fitting errors. We examine the actual effects of expanding the sampling range through experiments. Second, the infinitude of a search space does not imply that the subset of expressions satisfying specific conditions is also infinite. Even if the search space contains infinitely many expressions, those satisfying low-order Taylor consistency are not necessarily infinite in number. Finally, to connect our theoretical analysis with practical search spaces under finite complexity constraints, we have added Theorem 3, “Existence of Low-Order Taylor-Consistent Expressions in a Finite Constant-Free Search Space,” and Theorem 6, “Existence of Low-Order Taylor-Consistent Expressions in a Finite Search Space with Constants,” to the revised manuscript.
Using RDF-SR for both candidate generation and baseline comparison does not constitute circular reasoning. RDF-SR does not target specific expression structures or use fitting error or other metrics to guide search. Instead, it explores the valid expression space through random branch selection and node exhaustion without revisiting expressions, and thus does not deliberately favor particular structures. In subsequent evaluations, RDF-SR and other algorithms run independently under the same search space and budget. Generating an expression during dataset construction does not guarantee its recovery in later runs, as RDF-SR searches randomly.
The constructed dataset is neither intended to simulate real-world applications nor designed as a general-purpose SR benchmark. Rather, it serves as an illustrative example of an evaluation methodology. By constructing sets of structurally different expressions with similar fitting errors, we demonstrate how to independently evaluate two key SR capabilities: extracting effective search directions from fitting error and suppressing misleading search directions induced by fitting error.