mlsanityData to 14 Oct 2026

Active Learning in Genetic Programming: Guiding Efficient Data Collection for Symbolic Regression

arXiv 2308.00672 ↗First posted 31 Jul 2023cs.NE cs.LGcited by 3

Not on the map. Why?

Abstract (arXiv)

This paper examines various methods of computing uncertainty and diversity for active learning in genetic programming. We found that the model population in genetic programming can be exploited to select informative training data points by using a model ensemble combined with an uncertainty metric. We explored several uncertainty metrics and found that differential entropy performed the best. We also compared two data diversity metrics and found that correlation as a diversity metric performs better than minimum Euclidean distance, although there are some drawbacks that prevent correlation from being used on all problems. Finally, we combined uncertainty and diversity using a Pareto optimization approach to allow both to be considered in a balanced way to guide the selection of informative and unique data points for training.

Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 5 of its 29 references that are in the map. First posted on arXiv 31 Jul 2023.

Builds on

5 of 29 references.

References · 5

  1. 2020A Survey of Deep Active Learningcited by 554
  2. 2019AI Feynman: a Physics-Inspired Method for Symbolic Regressioncited by 548
  3. 2021Contemporary Symbolic Regression Methods and their Relative Performancecited by 215
  4. 2022Active Learning Improves Performance on Symbolic RegressionTasks in StackGPcited by 8
  5. 2022Correlation versus RMSE Loss Functions in Symbolic Regression Taskscited by 2

Built on by

Cited by year (2026 to 14 Oct)

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

3 papers.