Tight Runtime Bounds for Static Unary Unbiased Evolutionary Algorithms on Linear Functions.
Carola DoerrDuri Andrea JanettJohannes LenglerPublished in: GECCO (2023)
Keyphrases
- linear functions
- evolutionary algorithm
- upper bound
- lower bound
- optimization problems
- worst case
- boolean functions
- differential evolution
- pairwise
- simulated annealing
- genetic algorithm
- vc dimension
- knapsack problem
- covering numbers
- objective function
- sample size
- model selection
- generalization error
- probability distribution
- cost function
- function classes