Active Learning in Genetic Programming: Guiding Efficient Data Collection for Symbolic Regression
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.
Code (1)
Tasks
Active LearningDiversityregressionSymbolic RegressionSimilar Papers 제목 키워드 기반
Boolean matrix logic programming for active learning of gene functions in genome-scale metabolic network models
Reasoning about hypotheses and updating knowledge through empirical observations are central to scientific discovery. In this work, we applied logic-based machine learning methods to drive biological discovery by guiding…
Active LearningExperimental Designscientific discoveryActive learning of digenic functions with boolean matrix logic programming
We apply logic-based machine learning techniques to facilitate cellular engineering and drive biological discovery, based on comprehensive databases of metabolic processes called genome-scale metabolic network models (GE…
Active LearningExperimental DesignGuiding Genetic Programming with Graph Neural Networks
In evolutionary computation, it is commonly assumed that a search algorithm acquires knowledge about a problem instance by sampling solutions from the search space and evaluating them with a fitness function. This is nec…
Graph Neural NetworkSymbolic RegressionHash-Based Tree Similarity and Simplification in Genetic Programming for Symbolic Regression
We introduce in this paper a runtime-efficient tree hashing algorithm for the identification of isomorphic subtrees, with two important applications in genetic programming for symbolic regression: fast, online calculatio…
DiversityregressionSymbolic RegressionMulti-threaded Memory Efficient Crossover in C++ for Generational Genetic Programming
C++ code snippets from a multi-core parallel memory-efficient crossover for genetic programming are given. They may be adapted for separate generation evolutionary algorithms where large chromosomes or small RAM require …
C++ codeEvolutionary Algorithms