Affine OneMax
Pages 335 - 336
Abstract
A new class of test functions for black box optimization is introduced. Affine OneMax (AOM) functions are defined as compositions of OneMax and invertible affine maps on bit vectors. The black box complexity of the class is upper bounded by a polynomial of large degree in the dimension. Tunable complexity is achieved by expressing invertible linear maps as finite products of transvections. Finally, experimental results are given to illustrate the performance of search algorithms on AOM functions.
References
[1]
Carola Doerr. Complexity theory for discrete black-box optimization heuristics. In Benjamin Doerr and Frank Neumann, editors, Theory of Evolutionary Computation: Recent Developments in Discrete Optimization, pages 133--212, Cham, 2020. Springer International Publishing.
[2]
Stefan Droste, Thomas Jansen, and Ingo Wegener. Upper and lower bounds for randomized search heuristics in black-box optimization. Theory of Computing Systems, 39(4):525--544, 2006.
[3]
HNCO. https://github.com/courros/hnco. v0.16.
[4]
Stuart A. Kauffman. The origins of order: self-organisation and selection in evolution. Oxford University Press, 1993.
[5]
Eyal Kushilevitz and Yishay Mansour. Learning decision trees using the Fourier spectrum. SIAM Journal on Computing, 22(6):1331--1348, 1993.
[6]
Gunar Liepins and Michael Vose. Representational issues in genetic optimization. J. Exp. Theor. Artif. Intell., 2:101--115, 1990.
[7]
Gunar Liepins and Michael Vose. Polynomials, basis sets, and deceptiveness in genetic algorithms. Complex Systems, 5, 1991.
[8]
Sancho Salcedo-Sanz and Carlos Bousoño-Calzón. On the application of linear transformations for genetic algorithms optimization. KES Journal, 11:89--104, 2007.
[9]
Christopher Schumacher, Michael Vose, and Darrell Whitley. The no free lunch and problem description length. In Proc. of the 3rd Annual Conf. on Genetic and Evolutionary Computation (GECCO'01), pages 565--570, San Francisco, CA, USA, 2001. Morgan Kaufmann Publishers Inc.
Recommendations
Herding Evolutionary Algorithm
GECCO Companion '15: Proceedings of the Companion Publication of the 2015 Annual Conference on Genetic and Evolutionary ComputationIn this paper, we address the problem of black box optimization over binary vectors. We introduce a novel evolutionary algorithm called Herding Evolutionary Algorithm which relies on herding to generate individuals with empirical moments close to those ...
Benchmarking parameter-free amalgam on functions with and without noise
We describe a parameter-free estimation-of-distribution algorithm EDA called the adapted maximum-likelihood Gaussian model iterated density-estimation evolutionary algorithm AMaLGaM-ID<inline-formula><inline-graphic xlink="EVCO_a_00094inline1.gif" ...
OneMax in Black-Box Models with Several Restrictions
Black-box complexity studies lower bounds for the efficiency of general-purpose black-box optimization algorithms such as evolutionary algorithms and other search heuristics. Different models exist, each one being designed to analyze a different aspect ...
Comments
Information & Contributors
Information
Published In
July 2021
2047 pages
Copyright © 2021 Owner/Author.
Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the Owner/Author.
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 08 July 2021
Check for updates
Author Tags
Qualifiers
- Poster
Conference
GECCO '21
Sponsor:
Acceptance Rates
Overall Acceptance Rate 1,669 of 4,410 submissions, 38%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 29Total Downloads
- Downloads (Last 12 months)1
- Downloads (Last 6 weeks)0
Reflects downloads up to 25 Jan 2025
Other Metrics
Citations
Cited By
View allView Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in