mlsanityData to 14 Oct 2026

Active Learning Improves Performance on Symbolic RegressionTasks in StackGP

arXiv 2202.04708 ↗First posted 9 Feb 2022cs.LGcited by 8

Not on the map. Why?

Abstract (arXiv)

In this paper we introduce an active learning method for symbolic regression using StackGP. The approach begins with a small number of data points for StackGP to model. To improve the model the system incrementally adds a data point such that the new point maximizes prediction uncertainty as measured by the model ensemble. Symbolic regression is re-run with the larger data set. This cycle continues until the system satisfies a termination criterion. We use the Feynman AI benchmark set of equations to examine the ability of our method to find appropriate models using fewer data points. The approach was found to successfully rediscover 72 of the 100 Feynman equations using as few data points as possible, and without use of domain expertise or data translation.

Key facts. Cited by 8 papers in the map (data through 14 Oct 2026). Builds on 2 of its 16 references that are in the map. First posted on arXiv 9 Feb 2022.

Builds on

2 of 16 references.

References · 2

  1. 2019AI Feynman: a Physics-Inspired Method for Symbolic Regressioncited by 548
  2. 2020Fitness Landscape Analysis of Dimensionally-Aware Genetic Programming Featuring Feynman Equationscited by 1

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2023: 4; 2024: 2; 2025: 1; 2026: 1.

8 papers.