no code implementations • 26 Apr 2024 • Gabriel Kronberger, Fabricio Olivetti de Franca, Harry Desmond, Deaglan J. Bartlett, Lukas Kammerer
This enables us to quantify the success probability of finding the best possible expressions, and to compare the search efficiency of genetic programming to random search in the space of semantically unique expressions.
1 code implementation • 27 Nov 2023 • Deaglan J. Bartlett, Lukas Kammerer, Gabriel Kronberger, Harry Desmond, Pedro G. Ferreira, Benjamin D. Wandelt, Bogdan Burlacu, David Alonso, Matteo Zennaro
We obtain an analytic approximation to the linear power spectrum with a root mean squared fractional error of 0. 2% between $k = 9\times10^{-3} - 9 \, h{\rm \, Mpc^{-1}}$ and across a wide range of cosmological parameters, and we provide physical interpretations for various terms in the expression.
no code implementations • 20 Sep 2022 • Lukas Kammerer, Gabriel Kronberger, Michael Kommenda
Fast Function Extraction (FFX) is a deterministic algorithm for solving symbolic regression problems.
no code implementations • 28 Sep 2021 • Gabriel Kronberger, Lukas Kammerer, Bogdan Burlacu, Stephan M. Winkler, Michael Kommenda, Michael Affenzeller
In this chapter we take a closer look at the distribution of symbolic regression models generated by genetic programming in the search space.
no code implementations • 28 Sep 2021 • Lukas Kammerer, Gabriel Kronberger, Bogdan Burlacu, Stephan M. Winkler, Michael Kommenda, Michael Affenzeller
Symbolic regression is a powerful system identification technique in industrial scenarios where no prior knowledge on model structure is available.
no code implementations • 24 Aug 2021 • Lukas Kammerer, Gabriel Kronberger, Michael Kommenda
The performance of genetic programming is compared with random forests and linear regression.
no code implementations • 22 Jul 2021 • Bogdan Burlacu, Lukas Kammerer, Michael Affenzeller, Gabriel Kronberger
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 calculation of population diversity and algebraic simplification of symbolic expression trees.
no code implementations • 6 Jul 2021 • Gabriel Kronberger, Lukas Kammerer, Michael Kommenda
We describe a method for the identification of models for dynamical systems from observational data.