ABSTRACT
Unlike most research of symbolic regression with genetic programming (GP) concerning black-box optimization, this paper focuses on the scenario where the underlying function is available, but due to limited computational resources or product imperfection, the function needs to be approximated with simplicity to fit measured data. Taylor polynomial (TP) is commonly used in such scenario; however, its performance drops drastically away from the expansion point. On the other hand, solely using GP does not utilize the knowledge of the underlying function, even though possibly inaccurate. This paper proposes using GP as a TP enhancer, namely TPE-GP, to combine the advantages from TP and GP. Specifically, TPE-GP utilizes infinite-order operators to compensate the power of TP with finite order. Empirically, on functions that are expressible by TP, TP outperformed both gplearn and TPE-GP as expected, while TPE-GP outperformed gplearn due to the use of TP. On functions that are not expressible by TP but expressible by the function set (FS), TPE-GP was competitive with gplearn while both outperformed TP. Finally, on functions that are not expressible by both TP and FS, TPE-GP outperformed both TP and gplearn, indicating the hybrid did achieve the synergy effect from TP and GP.
- Baihe He, Qiang Lu, Qingyun Yang, Jake Luo, and Zhiguang Wang. 2022. Taylor genetic programming for symbolic regression. In Proceedings of the Genetic and Evolutionary Computation Conference. 946--954.Google ScholarDigital Library
- William G Horner. 1819. A New Method of Solving Numerical Equations of All Orders, by Continuous Approximation. Philosophical Transactions of the Royal Society of London 109 (1819), 308--335.Google ScholarCross Ref
- Xiang Huang, Shengluo Ma, CY Zhao, Hong Wang, and Shenghong Ju. 2023. Exploring high thermal conductivity polymers via interpretable machine learning with physical descriptors. arXiv preprint arXiv:2301.03030 (2023).Google Scholar
- Eiman Huzaifa, Adnan Khan, Masaud Shah, and Mubashir Khan. 2022. Taylor series expansion method to compute approximate solution for nonlinear dynamical system. Journal of Fractional Calculus and Nonlinear Systems 3, 1 (2022), 20--29.Google ScholarCross Ref
- John R. Koza. 1992. Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press, Cambridge, MA, USA.Google ScholarDigital Library
- Jiachen Li, Ye Yuan, and Hong-Bin Shen. 2022. Symbolic expression transformer: A computer vision approach for symbolic regression. arXiv preprint arXiv:2205.11798 (2022).Google Scholar
- Dazhuang Liu, Marco Virgolin, Tanja Alderliesten, and Peter AN Bosman. 2022. Evolvability degeneration in multi-objective genetic programming for symbolic regression. In Proceedings of the Genetic and Evolutionary Computation Conference. 973--981.Google ScholarDigital Library
- Keito Tanemura, Yuuki Tachibana, Yuki Tokuni, Hikaru Manabe, and Ryohei Miyadera. 2022. Application of Generic Programming to Unsolved Mathematical Problems. In 2022 IEEE 11th Global Conference on Consumer Electronics (GCCE). IEEE, 845--849.Google ScholarCross Ref
- Yiqun Wang, Nicholas Wagner, and James M. Rondinelli. 2019. Symbolic regression in materials science. MRS Communications 9, 3 (2019), 793--805.Google ScholarCross Ref
Index Terms
- Taylor Polynomial Enhancer using Genetic Programming for Symbolic Regression
Recommendations
Taylor genetic programming for symbolic regression
GECCO '22: Proceedings of the Genetic and Evolutionary Computation ConferenceGenetic programming (GP) is a commonly used approach to solve symbolic regression (SR) problems. Compared with the machine learning or deep learning methods that depend on the pre-defined model and the training dataset for solving SR problems, GP is more ...
Genetic programming performance prediction and its application for symbolic regression problems
Highlights- Theoretical analysis of GP performance prediction.
- Suggestion of upper bounds ...
AbstractPredicting the performance of Genetic Programming (GP) helps us identify whether it is an appropriate approach to solve the problem at hand. However, previous studies show that measuring the difficulty of a problem for GP and ...
Small Solutions for Real-World Symbolic Regression Using Denoising Autoencoder Genetic Programming
Genetic ProgrammingAbstractDenoising Autoencoder Genetic Programming (DAE-GP) is a model-based evolutionary algorithm that uses denoising autoencoder long short-term memory networks as probabilistic model to replace the standard recombination and mutation operators of ...
Comments