Open AccessProceedings Article
SEARCH, blackbox optimization, and sample complexity
Hillol Kargupta,David E. Goldberg +1 more
- 01 May 1996
- pp 291-324
TL;DR: A closed form bound on the sample complexity in terms of the cardinality of the relation space, class space, desired quality of the solution and the reliability is presented and leads to the identification of the class of order-k delineable problems that can be solved in polynomial sample complexity.
read more
Abstract: The SEARCH (Search Envisioned As Relation and Class Hierarchizing) framework developed elsewhere (Kargupta, 1995; Kargupta and Goldberg, 1995) offered an alternate perspective toward blackbox optimization -- optimization in presence of little domain knowledge. The SEARCH framework investigates the conditions essential for transcending the limits of random enumerative search using a framework developed in terms of relations, classes and partial ordering. This paper presents a summary of some of the main results of that work. A closed form bound on the sample complexity in terms of the cardinality of the relation space, class space, desired quality of the solution and the reliability is presented. This also leads to the identification of the class of order-k delineable problems that can be solved in polynomial sample complexity. These results are applicable to any blackbox search algorithms, including evolutionary optimization techniques.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
•Book
Metaheuristics: From Design to Implementation
El-Ghazali Talbi
- 22 Jun 2009
TL;DR: This book provides a complete background on metaheuristics and shows readers how to design and implement efficient algorithms to solve complex optimization problems across a diverse range of applications, from networking and bioinformatics to engineering design, routing, and scheduling.
The compact genetic algorithm
TL;DR: The compact genetic algorithm (cGA) is introduced which represents the population as a probability distribution over the set of solutions and is operationally equivalent to the order-one behavior of the simple GA with uniform crossover.
1.1K
The equation for response to selection and its use for prediction
TL;DR: In this paper, an exact response to selection (RS) equation is derived for proportionate selection given an infinite population in linkage equilibrium, where the genotype frequencies are the product of the univariate marginal frequencies.
550
Schemata, Distributions and Graphical Models in Evolutionary Optimization
TL;DR: For the test functions considered, the performance of FDA—in number of generations till convergence—is similar to that of a genetic algorithm for the OneMax function.
342
A Review on Estimation of Distribution Algorithms
Pedro Larrañaga
- 01 Jan 2002
TL;DR: This chapter reviews the Estimation of Distribution Algorithms proposed for the solution of combinatorial optimization problems and optimization in continuous domains using one unified notation.
116
References
Genetic algorithms in search, optimization and machine learning
David E. Goldberg
- 01 Jan 1989
TL;DR: This book brings together the computer techniques, mathematical tools, and research results that will enable both students and practitioners to apply genetic algorithms to problems in many fields.
58.6K
•Book
Genetic algorithms in search, optimization, and machine learning
David E. Goldberg
- 01 Sep 1988
TL;DR: In this article, the authors present the computer techniques, mathematical tools, and research results that will enable both students and practitioners to apply genetic algorithms to problems in many fields, including computer programming and mathematics.
Optimization by Simulated Annealing
TL;DR: There is a deep and useful connection between statistical mechanics and multivariate or combinatorial optimization (finding the minimum of a given function depending on many parameters), and a detailed analogy with annealing in solids provides a framework for optimization of very large and complex systems.
46.9K
•Book
Adaptation in natural and artificial systems
John H. Holland
- 01 Jan 1975
TL;DR: Names of founding work in the area of Adaptation and modiication, which aims to mimic biological optimization, and some (Non-GA) branches of AI.