Skip to main content

A Genetic Programming Approach to Solomonoff’s Probabilistic Induction

  • Conference paper
Genetic Programming (EuroGP 2006)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3905))

Included in the following conference series:

Abstract

In the context of Solomonoff’s Inductive Inference theory, Induction operator plays a key role in modeling and correctly predicting the behavior of a given phenomenon. Unfortunately, this operator is not algorithmically computable. The present paper deals with a Genetic Programming approach to Inductive Inference, with reference to Solomonoff’s algorithmic probability theory, that consists in evolving a population of mathematical expressions looking for the ‘optimal’ one that generates a collection of data and has a maximal a priori probability. Validation is performed on Coulomb’s Law, on the Henon series and on the Arosa Ozone time series. The results show that the method is effective in obtaining the analytical expression of the first two problems, and in achieving a very good approximation and forecasting of the third.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Li, M., Vitànyi, P.: An introduction to Kolmogorov complexity and its applications, 2nd edn. Springer, Heidelberg (1997)

    Book  MATH  Google Scholar 

  2. Solomonoff, R.J.: Complexity–based induction systems: comparisons and convergence theorems. IEEE Trans. on Information Theory IT 24, 422–432 (1978)

    Article  MathSciNet  MATH  Google Scholar 

  3. Solomonoff, R.J.: Progress in incremental machine learning. In: NIPS Workshop on Universal Learning Algorithms and Optimal Search, Whistler, B.C (2002)

    Google Scholar 

  4. Solomonoff, R.J.: A formal theory of inductive inference. Information and Control 7, 1–22, 224–254 (1964)

    Article  MathSciNet  MATH  Google Scholar 

  5. Koza, J.R.: Genetic Programming: on the programming of computers by means of natural selection. MIT Press, Cambridge (1992)

    MATH  Google Scholar 

  6. Cramer, N.L.: A representation for the adaptive generation of simple sequential programs. In: Grefenstette, J.J. (ed.) Int. Conf. on Genetic Algorithms and Their Applications, Lawrence Erlbaum Ass., Hillsdale, N.J, pp. 183–187 (1985)

    Google Scholar 

  7. Whigham, P.A.: Grammatical Bias for Evolutionary Learning. PhD thesis, School of Computer Science. University of New South Wales, Australia (1996)

    Google Scholar 

  8. Hénon, M.: A two–dimensional mapping with a strange attractor. Communications of Mathematical Physics 50, 69–77 (1976)

    Article  MathSciNet  MATH  Google Scholar 

  9. Hipel, K.W., McLeod, A.I.: Time Series Modelling of Water Resources and Environmental Systems. Elsevier, Amsterdam (1994)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

De Falco, I., Della Cioppa, A., Maisto, D., Tarantino, E. (2006). A Genetic Programming Approach to Solomonoff’s Probabilistic Induction. In: Collet, P., Tomassini, M., Ebner, M., Gustafson, S., Ekárt, A. (eds) Genetic Programming. EuroGP 2006. Lecture Notes in Computer Science, vol 3905. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11729976_3

Download citation

  • DOI: https://doi.org/10.1007/11729976_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-33143-8

  • Online ISBN: 978-3-540-33144-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics