Theoretical Computer Science - Special issue on evolutionary computation
The Simple Genetic Algorithm: Foundations and Theory
The Simple Genetic Algorithm: Foundations and Theory
Proceedings of the 9th annual conference on Genetic and evolutionary computation
Evolutionary Computation
Abandoning objectives: Evolution through the search for novelty alone
Evolutionary Computation
Real-space evolutionary annealing
Proceedings of the 13th annual conference on Genetic and evolutionary computation
No free lunch theorems for optimization
IEEE Transactions on Evolutionary Computation
| Hi-index | 0.00 |
This paper proposes a measure-theoretic framework to study iterative stochastic optimizers that provides theoretical tools to explore how the optimization methods may be improved. Within this framework, optimizers form a closed, convex subset of a normed vector space, implying the existence of a distance metric between any two optimizers and a meaningful and computable spectrum of new optimizers between them. It is shown how the formalism applies to evolutionary algorithms in general. The analytic property of continuity is studied in the context of genetic algorithms, revealing the conditions under which approximations such as meta-modeling or surrogate methods may be effective. These results demonstrate the power of the proposed analytic framework, which can be used to propose and analyze new techniques such as controlled convex combinations of optimizers, meta-optimization of algorithm parameters, and more.