Optimizing at the Ergodic Edge
Stefan Boettcher, Martin Frank
Abstract
Using a simple, annealed model, some of the key features of the recently introduced extremal optimization heuristic are demonstrated. In particular, it is shown that the dynamics of local search possesses a generic critical point under the variation of its sole parameter, separating phases of too greedy (non-ergodic, jammed) and too random (ergodic) exploration. Comparison of various local search methods within this model suggests that the existence of the critical point is essential for the optimal performance of the heuristic.
Create a lesson
Related papers
Discovering like a scientist: Literature-informed dimensionless learning for physical closure of data-driven equations
Hao Xu, Tianhao Wu, Dongxiao Zhang
Identifying the Shear Piezoelectric Coefficient using Physics-Informed Neural Networks under Exact Boundary and Initial Constraints
Suhas Suresh Bharadwaj
Fracture-Bench: A Controlled Benchmark Suite for Machine Learning Surrogates in Phase-Field Fracture Mechanics
Meenu Krishnan U., Maryam Hakimzadeh, Indrashish Saha et al.
Noise-resilient collective order through temporal memory in self-propelled particles
Mihir Durve, Sauro Succi, Antonio Celani
Site-orbit masked twin-branch Transformer for symmetry-constrained crystal generation
Junchi Liu, Haoran Si, Luo Yan et al.
Maximal correlation and optimal transformations of probability distributions in tensor-train format: a variational algorithm
Kayo Kinjo, Jun Ohkubo