9 citations · 9 across the 2 of their papers we have counts for
2 papers
cs.NE2023★ 9 cited
How Well Does the Metropolis Algorithm Cope With Local Optima?
Benjamin Doerr, Taha El Ghazi El Houssaini, Amirhossein Rajabi +1
The Metropolis algorithm (MA) is a classic stochastic local search heuristic. It avoids getting stuck in local optima by occasionally accepting inferior solutions. To better and in…
cs.NE2023
Larger Offspring Populations Help the Genetic Algorithm to Overcome the Noise
Alexandra Ivanova, Denis Antipov, Benjamin Doerr
Evolutionary algorithms are known to be robust to noise in the evaluation of the fitness. In particular, larger offspring population sizes often lead to strong robustness. We analy…