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

Nathan Haut, Wolfgang Banzhaf, Bill Punch
7/31/2023
cs.NEcs.LG

No official code found. Best implementation: hoolagans/StackGP (3 stars, MIT, last commit 2026-04-29).

Abstract

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.

View on arXivView PDF

Code Implementations(1)

hoolagans/StackGPCommunity100%
MIT

Stack based genetic programming system in Python

30Python, Jupyter NotebookMay 16, 20225 months agoMIT

Similar Papers

Cite this paper

@article{haut2023active,
  title  = {Active Learning in Genetic Programming: Guiding Efficient Data Collection for Symbolic Regression},
  author = {Nathan Haut and Wolfgang Banzhaf and Bill Punch},
  year   = {2023},
  eprint = {2308.00672},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2308.00672v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2308.00672.svg)](https://codeofpaper.com/paper/2308.00672)

Discussion