Monte Carlo algorithms are very effective in finding the largest independent set in sparse random graphs

Abstract

The effectiveness of stochastic algorithms based on Monte Carlo dynamics in solving hard optimization problems is mostly unknown. Beyond the basic statement that at a dynamical phase transition the ergodicity breaks and a Monte Carlo dynamics cannot sample correctly the probability distribution in times linear in the system size, there are almost no predictions nor intuitions on the behavior of this class of stochastic dynamics. The situation is particularly intricate because, when using a Monte Carlo based algorithm as an optimization algorithm, one is usually interested in the out of equilibrium behavior which is very hard to analyse. Here we focus on the use of Parallel Tempering in the search for the largest independent set in a sparse random graph, showing that it can find solutions well beyond the dynamical threshold. Comparison with state-of-the-art message passing algorithms reveals that parallel tempering is definitely the algorithm performing best, although a theory explaining its behavior is still lacking.

Exploring Quantum Annealing Architectures: A Spin Glass Perspective

“…These experiments were conducted using 2D topologies, which might limit their potential for quantum advantage, as state‐of‐the‐art classical methods have been shown to find low‐energy configurations in these models efficiently. [ 58 ] Yet, the 2D topologies used in these RAA studies are not a fundamental constraint of the platform, as RAAs can achieve all‐to‐all connectivity by moving the atoms. [ 59 ] The trade‐off for this advantage is the need for additional simulation time and, hence, longer coherence times.…”

Stochastic Gradient Descent-like relaxation is equivalent to Metropolis dynamics in discrete optimization and inference problems

“…The effectiveness of MC methods is witnessed by their success in hard discrete combinatorial problems [7][8][9][10][11][12] . The theory beyond MC algorithms is very strong thanks to the theory of Markov chains and many concepts borrowed from the principles of statistical mechanics (e.g.…”

Hard optimization problems have soft edges

“…No algorithm currently offers to find a clique of size less than and bigger than , in quasi-linear time, for arbitrary N . Parallel Tempering enhanced with an early stopping strategy 24 , 25 , is able to explore solutions below , but only at the expense of greatly increased computational cost. Some of these procedures identify some, but perhaps not all of the planted clique sites, and require some “ cleanup ” steps to complete the identification of the whole clique.…”