Theory of Nonequilibrium Local Search on Random Satisfaction Problems.

We study local search algorithms to solve instances of the random k-satisfiability problem, equivalent to finding (if they exist) zero-energy ground states of statistical models with disorder on random hypergraphs. It is well known that the best such algorithms are akin to nonequilibrium processes in a high-dimensional space. In particular, algorithms known as focused, and which do not obey detailed balance, outperform simulated annealing and related methods in the task of finding the solution to a complex satisfiability problem, that is to find (exactly or approximately) the minimum in a complex energy landscape. A physical question of interest is if the dynamics of these processes can be well predicted by the well-developed theory of equilibrium Gibbs states. While it has been known empirically for some time that this is not the case, an alternative systematic theory that does so has been lacking. In this Letter we introduce such a theory based on the recently developed technique of cavity master equations and test it on the paradigmatic random 3-satisfiability problem. Our theory predicts the qualitative form of the phase boundary between the satisfiable (SAT) and unsatisfiable (UNSAT) region of the phase diagram where the numerics of a focused Metropolis search and cavity master equation cannot be distinguished.

[1]  E. Aurell,et al.  Dynamic message-passing approach for kinetic spin models with reversible dynamics. , 2014, Physical review. E, Statistical, nonlinear, and soft matter physics.

[2]  J. Herskowitz,et al.  Proceedings of the National Academy of Sciences, USA , 1996, Current Biology.

[3]  U. Seifert.  Stochastic thermodynamics, fluctuation theorems and molecular machines , 2012, Reports on progress in physics. Physical Society.

[4]  Erik Aurell,et al.  Local search methods based on variable focusing for random K-satisfiability. , 2015, Physical review. E, Statistical, nonlinear, and soft matter physics.

[5]  Stephen R. Williams,et al.  Fluctuation theorems. , 2007, Annual review of physical chemistry.

[6]  C. Jarzynski.  Equalities and Inequalities: Irreversibility and the Second Law of Thermodynamics at the Nanoscale , 2011 .

[7]  Alexander K. Hartmann,et al.  Solving satisfiability problems by fluctuations: The dynamics of stochastic local search algorithms , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[8]  A. Montanari,et al.  Majority dynamics on trees and the dynamic cavity method , 2009, 0907.0449.

[9]  Thomas Barthel,et al.  Matrix product algorithm for stochastic dynamics on networks applied to nonequilibrium Glauber dynamics. , 2018, Physical review. E.

[10]  Guilhem Semerjian,et al.  Biased landscapes for random constraint satisfaction problems , 2018, Journal of Statistical Mechanics: Theory and Experiment.

[11]  Pekka Orponen,et al.  Focused local search for random 3-satisfiability , 2005, ArXiv.

[12]  M. Mézard,et al.  Journal of Statistical Mechanics: Theory and Experiment , 2011 .

[13]  M. Mézard,et al.  Analytic and Algorithmic Solution of Random Satisfiability Problems , 2002, Science.

[14]  K. K. Nambiar,et al.  Foundations of Computer Science , 2001, Lecture Notes in Computer Science.

[15]  Cristopher Moore,et al.  Asymptotic analysis of the stochastic block model for modular networks and its algorithmic applications , 2011, Physical review. E, Statistical, nonlinear, and soft matter physics.

[16]  Kazue Kudo,et al.  Constrained quantum annealing of graph coloring , 2018, Physical Review A.

[17]  I. Neri,et al.  The cavity approach to parallel dynamics of Ising spins on a graph , 2009, 0905.3260.

[18]  Pekka Orponen,et al.  Circumspect descent prevails in solving random constraint satisfaction problems , 2007, Proceedings of the National Academy of Sciences.

[19]  Haijun Zhou,et al.  Ground-state entropy of the random vertex-cover problem. , 2009, Physical review. E, Statistical, nonlinear, and soft matter physics.

[20]  Andrea Montanari,et al.  Gibbs states and the set of solutions of random constraint satisfaction problems , 2006, Proceedings of the National Academy of Sciences.

[21]  Erik Aurell,et al.  Exploring the diluted ferromagnetic p-spin model with a cavity master equation. , 2018, Physical review. E.

[22]  Riccardo Zecchina,et al.  Coloring random graphs , 2002, Physical review letters.

[23]  Christian Borgs,et al.  Unreasonable effectiveness of learning neural networks: From accessible states and robust ensembles to basic algorithmic schemes , 2016, Proceedings of the National Academy of Sciences.

[24]  Robert E. Tarjan,et al.  A Linear-Time Algorithm for Testing the Truth of Certain Quantified Boolean Formulas , 1979, Inf. Process. Lett..

[25]  Bart Selman,et al.  The state of SAT , 2007, Discret. Appl. Math..

[26]  Giorgio Parisi,et al.  The backtracking survey propagation algorithm for solving random K-SAT problems , 2015, Nature Communications.

[27]  M. Weigt,et al.  Approximation schemes for the dynamics of diluted spin models: the Ising ferromagnet on a Bethe lattice , 2004, cond-mat/0402451.

[28]  E. Aurell,et al.  Behavior of heuristics on large and hard satisfiability problems. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.

[29]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[30]  M. Troyer,et al.  Nonstoquastic Hamiltonians and quantum annealing of an Ising spin glass , 2016, 1609.06558.

[31]  M. Troyer,et al.  Quantum versus classical annealing of Ising spin glasses , 2014, Science.

[32]  M. W. Johnson,et al.  Phase transitions in a programmable quantum spin glass simulator , 2018, Science.

[33]  D. Gillespie.  A General Method for Numerically Simulating the Stochastic Time Evolution of Coupled Chemical Reactions , 1976 .

[34]  H. Nishimori,et al.  Exponential Speedup of Quantum Annealing by Inhomogeneous Driving of the Transverse Field , 2018, 1801.02005.

[35]  Firas Hamze,et al.  Glassy Chimeras could be blind to quantum speedup: Designing better benchmarks for quantum annealing machines , 2014, 1401.1546.