How Well Does the Metropolis Algorithm Cope With Local Optima?

Abstract

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 a rigorous manner understand this ability, we conduct a mathematical runtime analysis of the MA on the CLIFF benchmark. Apart from one local optimum, cliff functions are monotonically increasing towards the global optimum. Consequently, to optimize a cliff function, the MA only once needs to accept an inferior solution. Despite seemingly being an ideal benchmark for the MA to profit from its main working principle, our mathematical runtime analysis shows that this hope does not come true. Even with the optimal temperature (the only parameter of the MA), the MA optimizes most cliff functions less efficiently than simple elitist evolutionary algorithms (EAs), which can only leave the local optimum by generating a superior solution possibly far away. This result suggests that our understanding of why the MA is often very successful in practice is not yet complete. Our work also suggests to equip the MA with global mutation operators, an idea supported by our preliminary experiments.

arXiv commentTo appear in the proceedings of GECCO 2023. With appendix containing all proofs. 28 pages

References in corpus (11)

• Multiplicative Drift Analysis
• Probabilistic Tools for the Analysis of Randomized Optimization Heuristics
• A First Runtime Analysis of the NSGA-II on a Multimodal Problem
• Does Comma Selection Help To Cope With Local Optima
• Runtime Analysis for the NSGA-II: Provable Speed-Ups From Crossover
• Theoretical Analyses of Multiobjective Evolutionary Algorithms on Multimodal Objectives
• On the Limitations of the Univariate Marginal Distribution Algorithm to Deception and Where Bivariate EDAs might help
• Choosing the Right Algorithm With Hints From Complexity Theory
• How the Move Acceptance Hyper-Heuristic Copes With Local Optima: Drastic Differences Between Jumps and Cliffs
• Drift Analysis
• How Well Does the Metropolis Algorithm Cope With Local Optima?

Cited by in corpus (4)

• How the Move Acceptance Hyper-Heuristic Copes With Local Optima: Drastic Differences Between Jumps and Cliffs
• How Well Does the Metropolis Algorithm Cope With Local Optima?
• Runtime Analysis of the Compact Genetic Algorithm on the LeadingOnes Benchmark
• A Flexible Evolutionary Algorithm With Dynamic Mutation Rate Archive