Skip to main content

Extending population-based incremental learning to continuous search spaces

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1498))

Abstract

An alternative to Darwinian-like artificial evolution is offered by Population-Based Incremental Learning (PBIL): this algorithm memorizes the best past individuals and uses this memory as a distribution, to generate the next population from scratch.

This paper extends PBIL from boolean to continuous search spaces. A Gaussian model is used for the distribution of the population. The center of this model is constructed as in boolean PBIL. Several ways of defining and adjusting the variance of the model are investigated.

The approach is validated on several large-sized problems.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. T. Bäck. Evolutionary Algorithms in theory and practice. New-York:Oxford University Press, 1995.

    Google Scholar 

  2. S. Baluja. An empirical comparizon of seven iterative and evolutionary function optimization heuristics. Technical Report CMU-CS-95-193, Carnegie Mellon University, 1995.

    Google Scholar 

  3. S. Baluja and R. Caruana. Removing the genetics from the standard genetic algorithms. In A. Prieditis and S. Russel, editors, Proc. of ICML95, pages 38–46. Morgan Kaufmann, 1995.

    Google Scholar 

  4. S. Baluja and S. Davies. Using optimal dependency-trees for combinatorial optimization: Learning the structure of the search space. In Proc. of ICML97. Morgan Kaufmann, 1997.

    Google Scholar 

  5. D. B. Fogel. Evolutionary Computation. Toward a New Philosophy of Machine Intelligence. IEEE Press, Piscataway, NJ, 1995.

    Google Scholar 

  6. D. E. Goldberg. Genetic algorithms in search, optimization and machine learning. Addison Wesley, 1989.

    Google Scholar 

  7. J. Horn and D.E. Goldberg. Genetic algorithms difficulty and the modality of fitness landscapes. In L. D. Whitley and M. D. Vose, editors, Foundations of Genetic Algorithms 3, pages 243–269. Morgan Kaufmann, 1995.

    Google Scholar 

  8. S. W. Mahfoud. A comparison of parallel and sequential niching techniques. In L. J. Eshelman, editor, Proc. of ICGA '95, pages 136–143. Morgan Kaufmann, 1995.

    Google Scholar 

  9. T.M. Mitchell. Machine Learning. McGraw Hill, 1995.

    Google Scholar 

  10. I. Rechenberg. Evolutionstrategie: Optimierung Technisher Systeme nach Prinzipien des Biologischen Evolution. Fromman-Holzboog Verlag, Stuttgart, 1973.

    Google Scholar 

  11. G. Rudolph. Convergence Properties of Evolutionary Algorithms. Kovac, Hamburg, 1997.

    Google Scholar 

  12. S. Russell and A. Norwig. Artificial Intelligence, a modern approach. Prentice Hall, 1995.

    Google Scholar 

  13. H.-P. Schwefel. Numerical Optimization of Computer Models. John Wiley & Sons, New-York, 1981. 1995-2nd edition.

    Google Scholar 

  14. M. Sebag and M. Schoenauer. Mutation by imitation in boolean evolution strategies. In H.-M. Voigt, W. Ebeling, I. Rechenberg, and H.-P. Schwefel, editors, Proc. of PPSN-IV, pages 356–365. Springer-Verlag, LNCS 1141, 1996.

    Google Scholar 

  15. I. Servet, L. Trave-Massuyes, and D. Stern. Telephone network traffic overloading diagnosis and evolutionary computation technique. In Artificial Evolution'97, pages 137–144. Springer Verlag, LNCS 1363, 1997.

    Google Scholar 

  16. R. Storn and K. Price. Minimizing the real functions of the ICEC'96 contest by differential evolution. In Proc. of ICEC96, pages 842–844, 1996.

    Google Scholar 

  17. L.D. Whitley, K. Mathias, and P. Fitzhorn. Delta coding: an iterative strategy for GAs. In R. K. Belew and L. B. Booker, editors, Proc. of ICGA '89, pages 77–84. Morgan Kaufmann, 1989.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Agoston E. Eiben Thomas Bäck Marc Schoenauer Hans-Paul Schwefel

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sebag, M., Ducoulombier, A. (1998). Extending population-based incremental learning to continuous search spaces. In: Eiben, A.E., Bäck, T., Schoenauer, M., Schwefel, HP. (eds) Parallel Problem Solving from Nature — PPSN V. PPSN 1998. Lecture Notes in Computer Science, vol 1498. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0056884

Download citation

  • DOI: https://doi.org/10.1007/BFb0056884

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65078-2

  • Online ISBN: 978-3-540-49672-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics