Benchmarking the (1+1)-CMA-ES on the BBOB-2009 noisy testbed

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback
Take a look at the new version of this page: [ beta version ]. Tell us what you think.

Benchmarking the (1+1)-CMA-ES on the BBOB-2009 noisy testbed

Full text

Pdf (817 KB)

Source

Genetic And Evolutionary Computation Conference archive
Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference: Late Breaking Papers table of contents

Montreal, Québec, Canada

WORKSHOP SESSION: Black box optimization benchmarking (BBOB) table of contents

Pages: 2467-2472

Year of Publication: 2009

ISBN:978-1-60558-505-5

Authors

Anne Auger	INRIA Saclay Ile-de-France, Orsay, France
Nikolaus Hansen	Microsoft Research-INRIA Joint Centre, Orsay Cedex, France

Sponsors

SIGEVO: ACM Special Interest Group on Genetic and Evolutionary Computation
ACM: Association for Computing Machinery

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 8, Downloads (12 Months): 31, Citation Count: 0

Additional Information:

abstract references index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/1570256.1570345 What is a DOI?

ABSTRACT

We benchmark an independent-restart-(1+1)-CMA-ES on the BBOB-2009 noisy testbed. The (1+1)-CMA-ES is an adaptive stochastic algorithm for the optimization of objective functions defined on a continuous search space in a black-box scenario. The maximum number of function evaluations used here equals 10⁴ times the dimension of the search space. The algorithm could only solve $4$ functions with moderate noise in 5-D and 2 functions in 20-D.

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Anne Auger , Nikolaus Hansen, Benchmarking the (1+1)-CMA-ES on the BBOB-2009 function testbed, Proceedings of the 11th annual conference companion on Genetic and evolutionary computation conference, July 08-12, 2009, Montreal, Québec, Canada [doi>10.1145/1570256.1570344]
	2	S. Finck, N. Hansen, R. Ros, and A. Auger. Real-parameter black-box optimization benchmarking 2009: Presentation of the noisy functions. Technical Report 2009/21, Research Center PPE, 2009.
	3	Nikolaus Hansen, Benchmarking a BI-population CMA-ES on the BBOB-2009 function testbed, Proceedings of the 11th annual conference companion on Genetic and evolutionary computation conference, July 08-12, 2009, Montreal, Québec, Canada [doi>10.1145/1570256.1570333]
	4	N. Hansen, A. Auger, S. Finck, and R. Ros. Real-parameter black-box optimization benchmarking 2009: Experimental setup. Technical Report RR-6828, INRIA, 2009.
	5	N. Hansen, S. Finck, R. Ros, and A. Auger. Real-parameter black-box optimization benchmarking 2009: Noisy functions definitions. Technical Report RR-6869, INRIA, 2009.
	6	Nikolaus Hansen , Andreas Ostermeier, Completely Derandomized Self-Adaptation in Evolution Strategies, Evolutionary Computation, v.9 n.2, p.159-195, June 2001 [doi>10.1162/106365601750190398]