mlsanityData to 7 Oct 2026

Alleviating Overfitting in Transformation-Interaction-Rational Symbolic Regression with Multi-Objective Optimization

arXiv 2501.01905 ↗First posted 3 Jan 2025cs.LGcited by 2

Not on the map. Why?

Abstract (arXiv)

The Transformation-Interaction-Rational is a representation for symbolic regression that limits the search space of functions to the ratio of two nonlinear functions each one defined as the linear regression of transformed variables. This representation has the main objective to bias the search towards simpler expressions while keeping the approximation power of standard approaches. The performance of using Genetic Programming with this representation was substantially better than with its predecessor (Interaction-Transformation) and ranked close to the state-of-the-art on a contemporary Symbolic Regression benchmark. On a closer look at these results, we observed that the performance could be further improved with an additional selective pressure for smaller expressions when the dataset contains just a few data points. The introduction of a penalization term applied to the fitness measure improved the results on these smaller datasets. One problem with this approach is that it introduces two additional hyperparameters: i) a criteria to when the penalization should be activated and, ii) the amount of penalization to the fitness function. In this paper, we extend Transformation-Interaction-Rational to support multi-objective optimization, specifically the NSGA-II algorithm, and apply that to the same benchmark. A detailed analysis of the results show that the use of multi-objective optimization benefits the overall performance on a subset of the benchmarks while keeping the results similar to the single-objective approach on the remainder of the datasets. Specifically to the small datasets, we observe a small (and statistically insignificant) improvement of the results suggesting that further strategies must be explored.

Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 6 of its 43 references that are in the map. First posted on arXiv 3 Jan 2025.

Builds on

6 of 43 references.

References · 6

  1. 2019AI Feynman: a Physics-Inspired Method for Symbolic Regressioncited by 536
  2. 2015Non-stochastic Best Arm Identification and Hyperparameter Optimizationcited by 219
  3. 2021Contemporary Symbolic Regression Methods and their Relative Performancecited by 209
  4. 2021Shape-constrained Symbolic Regression -- Improving Extrapolation with Prior Knowledgecited by 27
  5. 2018A Greedy Search Tree Heuristic for Symbolic Regressioncited by 17
  6. 2022Transformation-Interaction-Rational Representation for Symbolic Regressioncited by 3

Built on by

Cited by year

Citing papers per year: 2025: 2.

2 papers.