Tight Runtime Bounds for Static Unary Unbiased Evolutionary Algorithms on Linear Functions.
Carola DoerrDuri Andrea JanettJohannes LenglerPublished in: CoRR (2023)
Keyphrases
- linear functions
- evolutionary algorithm
- upper bound
- lower bound
- optimization problems
- worst case
- differential evolution
- genetic algorithm
- knapsack problem
- boolean functions
- pairwise
- simulated annealing
- function classes
- covering numbers
- sample complexity
- markov networks
- sample size
- objective function
- training data
- solution quality
- graph cuts
- vc dimension
- machine learning