Skip to main content

On the Anytime Behavior of IPOP-CMA-ES

  • Conference paper

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

Abstract

Anytime algorithms aim to produce a high-quality solution for any termination criterion. A recent proposal is to improve automatically the anytime behavior of single-objective optimization algorithms by incorporating the hypervolume, a well-known quality measure in multi-objective optimization, into an automatic configuration tool. In this paper, we show that the anytime behavior of IPOP-CMA-ES can be significantly improved with respect to its default parameters by applying this method. We also show that tuning IPOP-CMA-ES with respect to the final quality obtained after a large termination criterion leads to better results at that particular termination criterion, but worsens the performance of IPOP-CMA-ES when stopped earlier. The main conclusion is that IPOP-CMA-ES should be tuned with respect to the anytime behavior if the exact termination criterion is not known in advance.

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Auger, A., Hansen, N.: A restart CMA evolution strategy with increasing population size. In: Proc. of CEC 2005, pp. 1769–1776. IEEE Press, Piscataway (2005)

    Google Scholar 

  2. Balaprakash, P., Birattari, M., Stützle, T.: Improvement Strategies for the F-Race Algorithm: Sampling Design and Iterative Refinement. In: Bartz-Beielstein, T., Blesa Aguilera, M.J., Blum, C., Naujoks, B., Roli, A., Rudolph, G., Sampels, M. (eds.) HM 2007. LNCS, vol. 4771, pp. 108–122. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  3. Hansen, N., Ostermeier, A.: Completely derandomized self-adaptation in evolution strategies. Evolutionary Computation 9(2), 159–195 (2001)

    Article  Google Scholar 

  4. Herrera, F., Lozano, M., Molina, D.: Test suite for the special issue of Soft Computing on scalability of evolutionary algorithms and other metaheuristics for large scale continuous optimization problems (2010), http://sci2s.ugr.es/eamhco/

  5. Hoos, H.H., Stützle, T.: Stochastic Local Search—Foundations and Applications. Morgan Kaufmann Publishers, San Francisco (2005)

    MATH  Google Scholar 

  6. Hutter, F., Hoos, H.H., Leyton-Brown, K., Murphy, K.P.: An experimental investigation of model-based parameter optimisation: SPO and beyond. In: Rothlauf, F. (ed.) Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2009, pp. 271–278. ACM Press, New York (2009)

    Chapter  Google Scholar 

  7. Liao, T., Montes de Oca, M.A., Stützle, T.: Computational results for an automatically tuned IPOP-CMA-ES on the CEC’05 benchmark set. Tech. Rep. TR/IRIDIA/2011-022, IRIDIA, Université Libre de Bruxelles, Belgium (2011)

    Google Scholar 

  8. Liao, T., Montes de Oca, M.A., Stützle, T.: Tuning parameters across mixed dimensional instances: A performance scalability study of Sep-G-CMA-ES. In: Krasnogor, N., Lanzi, P.L. (eds.) GECCO (Companion), pp. 703–706. ACM Press, New York (2011)

    Google Scholar 

  9. López-Ibáñez, M., Dubois-Lacoste, J., Stützle, T., Birattari, M.: The irace package, iterated race for automatic algorithm configuration. Tech. Rep. TR/IRIDIA/2011-004, IRIDIA, Université Libre de Bruxelles, Belgium (2011)

    Google Scholar 

  10. López-Ibáñez, M., Liao, T., Stützle, T.: On the anytime behavior of IPOP-CMA-ES: Supplementary material (2012), http://iridia.ulb.ac.be/supp/IridiaSupp2012-010/

  11. López-Ibáñez, M., Stützle, T.: Automatically improving the anytime behaviour of optimisation algorithms. Tech. Rep. TR/IRIDIA/2012-012, IRIDIA, Université Libre de Bruxelles, Belgium (2012)

    Google Scholar 

  12. Smit, S.K., Eiben, A.E.: Beating the ’world champion’ evolutionary algorithm via REVAC tuning. In: Ishibuchi, H., et al. (eds.) Proc. of CEC 2010, pp. 1–8. IEEE Press, Piscataway (2010)

    Google Scholar 

  13. Suganthan, P.N., Hansen, N., Liang, J., Deb, K., Chen, Y.P., Auger, A., Tiwari, S.: Problem definitions and evaluation criteria for the CEC 2005 special session on real-parameter optimization. Tech. rep., Nanyang Technological University, Singapore (2005)

    Google Scholar 

  14. Zilberstein, S.: Using anytime algorithms in intelligent systems. AI Magazine 17(3), 73–83 (1996)

    Google Scholar 

  15. Zitzler, E., Thiele, L., Laumanns, M., Fonseca, C.M., Grunert da Fonseca, V.: Performance assessment of multiobjective optimizers: an analysis and review. IEEE Transactions on Evolutionary Computation 7(2), 117–132 (2003)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

López-Ibáñez, M., Liao, T., Stützle, T. (2012). On the Anytime Behavior of IPOP-CMA-ES. In: Coello, C.A.C., Cutello, V., Deb, K., Forrest, S., Nicosia, G., Pavone, M. (eds) Parallel Problem Solving from Nature - PPSN XII. PPSN 2012. Lecture Notes in Computer Science, vol 7491. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32937-1_36

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-32937-1_36

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-32936-4

  • Online ISBN: 978-3-642-32937-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics