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

DOI10.1007/s00453-010-9391-3zbMath1211.68505OpenAlexW2037227622MaRDI QIDQ633835

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-dimensionconvergence speedsphere functionsign patternsevolution algorithms

Mathematics Subject Classification ID

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

Related Items (5)

Scaling-invariant functions versus positively homogeneous functions ⋮ Random drift particle swarm optimization algorithm: convergence analysis and parameter selection ⋮ Black-box search by unbiased variation ⋮ Ranking-based black-box complexity ⋮ Optimal parameter choices via precise black-box analysis

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Evolution strategies. A comprehensive introduction
• Convergence results for the (1,\(\lambda\))-SA-ES using the theory of \(\varphi\)-irreducible Markov chains
• Algorithmic analysis of a basic evolutionary algorithm for continuous optimization
• Expected runtimes of evolutionary algorithms for the Eulerian cycle problem
• 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
• On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
• Foundations of Genetic Algorithms

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