Black-box search by elimination of fitness functions

DOI10.1145/1527125.1527135zbMath1369.68291MaRDI QIDQ5276065

R. Paul Wiegand, Gautham Anil

Publication date: 14 July 2017

Published in: Proceedings of the tenth ACM SIGEVO workshop on Foundations of genetic algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1527125.1527135

zbMATH Keywords

evolutionary algorithms; black-box optimization; elimination of functions

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

90C59: Approximation methods and heuristics in mathematical programming

68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)

Related Items

Choosing the right algorithm with hints from complexity theory, A framework for co-optimization algorithm performance and its application to worst-case optimization, From black-box complexity to designing new genetic algorithms, Ranking-based black-box complexity, Optimal static and self-adjusting parameter choices for the \((1+(\lambda ,\lambda ))\) genetic algorithm, Black-box search by unbiased variation, The runtime of the compact genetic algorithm on jump functions, Reducing the arity in unbiased black-box complexity, Playing mastermind with constant-size memory, Unbiasedness of estimation-of-distribution algorithms, \textsc{OneMax} in black-box models with several restrictions, The voting algorithm is robust to various noise models, Towards a Complexity Theory of Randomized Search Heuristics: Ranking-Based Black-Box Complexity