Lower bounds for comparison based evolution strategies using VC-dimension and sign patterns

DOI10.1007/S00453-010-9391-3MaRDI QIDQ633835zbMATH OpenOpenAlexFDO

Authors Hervé Fournier, Olivier Teytaud

Publication date 30 March 2011

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00453-010-9391-3

zbMATH Keywords

VC-dimensionsphere functionconvergence speedsign patternsevolution algorithms

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Randomized algorithms (68W20) Analysis of algorithms (68W40)

Recommendations

• scientific article; zbMATH DE number 6019556
• Simplified drift analysis for proving lower bounds in evolutionary computation
• scientific article; zbMATH DE number 1247171
• scientific article; zbMATH DE number 2013567
• Evolution strategies with additive noise: a convergence rate lower bound
• On the approximation ability of evolutionary optimization with application to minimum set cover
• Evolutionary and population-based methods versus constructive search strategies in dynamic combinatorial optimization

Cites work

• scientific article; zbMATH DE number 1100794 (Why is no real title available?)
• scientific article; zbMATH DE number 2038775 (Why is no real title available?)
• scientific article; zbMATH DE number 893887 (Why is no real title available?)
• Algorithmic analysis of a basic evolutionary algorithm for continuous optimization
• Convergence results for the (1,)-SA-ES using the theory of -irreducible Markov chains
• Evolution strategies. A comprehensive introduction
• Expected runtimes of evolutionary algorithms for the Eulerian cycle problem
• Foundations of Genetic Algorithms
• On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
• On the density of families of sets
• On the number of zero-patterns of a sequence of polynomials
• `` Direct Search Solution of Numerical and Statistical Problems

Cited in

(6)

• Optimal parameter choices via precise black-box analysis
• Ranking-based black-box complexity
• Black-box search by unbiased variation
• Random drift particle swarm optimization algorithm: convergence analysis and parameter selection
• Scaling-invariant functions versus positively homogeneous functions
• scientific article; zbMATH DE number 6019556 (Why is no real title available?)

This page was built for publication: Lower bounds for comparison based evolution strategies using VC-dimension and sign patterns

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q633835)