Abstract
A Genetic Programming algorithm based on Solomonoff’s probabilistic induction is designed and used to face an Inductive Inference task, i.e., symbolic regression. To this aim, some test functions are dressed with increasing levels of noise and the algorithm is employed to denoise the resulting function and recover the starting functions. Then, the algorithm is compared against a classical parsimony–based GP. The results shows the superiority of the Solomonoff–based approach.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Solomonoff, R.J.: A formal theory of inductive inference. Information and Control 7(1), 1–22 (1964)
Solomonoff, R.J.: Progress in incremental machine learning. In: NIPS Workshop on Universal Learning Algorithms and Optimal Search, Whistler, B.C. (2002)
Koza, J.R.: Genetic Programming: on the programming of computers by means of natural selection. MIT Press, Cambridge (1992)
Zhang, B., Mühlenbein, H.: Balancing accuracy and parsimony in genetic programming. Evolutionary Computation 3(1), 17–38 (1995)
Gagné, C., Schoenauer, M., Parizeau, M., Tomassini, M.: Genetic programming, validation sets, and parsimony pressure. In: Collet, P., Tomassini, M., Ebner, M., Gustafson, S., Ekárt, A. (eds.) EuroGP 2006. LNCS, vol. 3905, pp. 98–109. Springer, Heidelberg (2006)
Whigham, P.A.: Grammatical Bias for Evolutionary Learning. PhD thesis, School of Computer Science, University of New South Wales, Australia (1996)
De Falco, I., Della Cioppa, A., Passaro, A., Tarantino, E.: Genetic programming for inductive inference of chaotic series. In: Bloch, I., Petrosino, A., Tettamanzi, A.G.B. (eds.) WILF 2005. LNCS (LNAI), vol. 3849, pp. 156–163. Springer, Heidelberg (2006)
De Falco, I., Della Cioppa, A., Maisto, D., Tarantino, E.: A genetic programming approach to Solomonoff’s probabilistic induction. In: Collet, P., Tomassini, M., Ebner, M., Gustafson, S., Ekárt, A. (eds.) EuroGP 2006. LNCS, vol. 3905, pp. 24–35. Springer, Heidelberg (2006)
Solomonoff, R.: Private communications (2006)
Gordon, V.S.D., Whitley, D.: Serial and parallel genetic algorithms as function optimizers. In: Forrest, S. (ed.) Proceedings of the Fifth International Conference on Genetic Algorithms, pp. 177–183. Morgan Kaufman, San Mateo (1993)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
De Falco, I., Della Cioppa, A., Maisto, D., Scafuri, U., Tarantino, E. (2007). Parsimony Doesn’t Mean Simplicity: Genetic Programming for Inductive Inference on Noisy Data. In: Ebner, M., O’Neill, M., Ekárt, A., Vanneschi, L., Esparcia-Alcázar, A.I. (eds) Genetic Programming. EuroGP 2007. Lecture Notes in Computer Science, vol 4445. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-71605-1_33
Download citation
DOI: https://doi.org/10.1007/978-3-540-71605-1_33
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-71602-0
Online ISBN: 978-3-540-71605-1
eBook Packages: Computer ScienceComputer Science (R0)