Black-box search by elimination of fitness functions

  title={Black-box search by elimination of fitness functions},
  author={Gautham Anil and R. Paul Wiegand},
  booktitle={FOGA '09},
In black-box optimization an algorithm must solve one of many possible functions, though the precise instance is unknown. In practice, it is reasonable to assume that an algorithm designer has some basic knowledge of the problem class in order to choose appropriate methods. In traditional approaches, one focuses on how to select samples and direct search to minimize the number of function evaluations to find an optima. As an alternative view, we consider search processes as determining which… Expand
A Fitness Function Elimination Theory For Blackbox Optimization And Problem Class Learning
The modern view of optimization is that optimization algorithms are not designed in a vacuum, but can make use of information regarding the broad class of objective functions from which a problemExpand
Black-Box Complexity for Bounding the Performance of Randomized Search Heuristics
  • T. Jansen
  • Computer Science
  • Theory and Principled Methods for the Design of Metaheuristics
  • 2014
This chapter gives a precise and accessible introduction to the notion of black-box complexity, explains important properties and discusses several concrete examples. Expand
Ranking-Based Black-Box Complexity
A ranking-based black-box algorithm is presented that has a runtime of Θ(n/logn), which shows that the OneMax problem does not become harder with the additional ranking- basedness restriction. Expand
Black-Box Search by Unbiased Variation
This paper introduces a more restricted black-box model for optimisation of pseudo-Boolean functions which it is claimed captures the working principles of many randomised search heuristics including simulated annealing, evolutionary algorithms, randomised local search, and others. Expand
Choosing the Right Algorithm With Hints From Complexity Theory
This work argues that the purely academic question of what could be the best possible algorithm in a certain broad class of black-box optimizers can give fruitful indications in which direction to search for good established optimization heuristics and shows a remarkably good performance of the Metropolis algorithm. Expand
OneMax in Black-Box Models with Several Restrictions
This work shows that the (1+1) memory-restricted ranking-based black-box complexity of OneMax is linear, and provides improved lower bounds for the complexity of the OneMax in the regarded models. Expand
General Limits in Black-Box Optimization
This chapter makes precise what it means when talking of black-box optimization, and considers a very general framework without concrete references to evolutionary algorithms that covers an enormous array of optimization algorithms. Expand
From black-box complexity to designing new genetic algorithms
This work designs a new crossover-based genetic algorithm that uses mutation with a higher-than-usual mutation probability to increase the exploration speed and crossover with the parent to repair losses incurred by the more aggressive mutation. Expand
Lessons from the black-box: fast crossover-based genetic algorithms
A simple genetic algorithm is designed that first creates λ offspring from a single parent by mutation with a mutation probability that is k times larger than the usual one, and is the first time that crossover is shown to give an advantage for the OneMax class that is larger than a constant factor. Expand
A framework for co-optimization algorithm performance and its application to worst-case optimization
There exist algorithms that are aggregately-optimal for any budget and any starting point and also non-trivially strictly optimal for many budgets and starting points, and this framework can be used to bridge several fields of research, by allowing formalization of their various problems and views on performance. Expand


A New Framework for the Valuation of Algorithms for Black-Box Optimization
It can be concluded that randomized search heuristics whose (worst-case) expected optimization time for some problem is close to the black-box complexity of the problem are provably efficient (in theblack-box scenario). Expand
Upper and Lower Bounds for Randomized Search Heuristics in Black-Box Optimization
Lower bounds on the black-box complexity of problems are derived without complexity theoretical assumptions and are compared with upper bounds in this scenario. Expand
On Classes of Functions for which No Free Lunch Results Hold
The main result of this paper is proven that the fraction of subsets that are c.u.p. is negligibly small, which means that classes of objective functions resulting from important classes of real-world problems are likely not to be c. Expand
Time complexity of evolutionary algorithms for combinatorial optimization: A decade of results
This paper presents a survey of the results obtained in the last decade along computational time complexity analyzes of evolutionary algorithms, and the most common mathematical techniques are introduced. Expand
No free lunch theorems for optimization
A framework is developed to explore the connection between effective optimization algorithms and the problems they are solving. A number of "no free lunch" (NFL) theorems are presented whichExpand
Perhaps Not a Free Lunch But At Least a Free Appetizer
It is argued why the scenario on which the No Free Lunch Theorem is based does not model real life optimization, and why optimization techniques differ in their efficiency. Expand
On the analysis of the (1+1) evolutionary algorithm
A step towards a theory on Evolutionary Algorithms, in particular, the so-called (1+1) evolutionary Algorithm, is performed and linear functions are proved to be optimized in expected time O(nlnn) but only mutation rates of size (1/n) can ensure this behavior. Expand
Theoretical Aspects of Evolutionary Algorithms
Some fundamental results on evolutionary algorithms are presented in order to show how theoretical results on randomized search heuristics can be proved and how they contribute to the understanding of evolutionary algorithms. Expand
The No Free Lunch and problem description length
The No Free Lunch theorem is reviewed and cast within a simple framework for black-box search. A duality result which relates functions being optimized to algorithms optimizing them is obtained andExpand
A mathematical theory of communication
  • C. Shannon
  • Computer Science, Mathematics
  • Bell Syst. Tech. J.
  • 1948
In this final installment of the paper we consider the case where the signals or the messages or both are continuously variable, in contrast with the discrete nature assumed until now. To aExpand