Papers › Local equations describe unreasonably efficient stochastic algorithms in random K-SAT
Local equations describe unreasonably efficient stochastic algorithms in random K-SAT
David Machado, Jonathan González-García, Roberto Mulet
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
Despite significant advances in characterizing the highly nonconvex landscapes of constraint satisfaction problems, the good performance of certain algorithms in solving hard combinatorial optimization tasks remains poorly understood. This gap in understanding stems largely from the lack of theoretical tools for analyzing their out-of-equilibrium dynamics. To address this challenge, we develop a system of approximate master equations that capture the behavior of local search algorithms in constraint satisfaction problems. Our framework shows excellent qualitative agreement with the phase diagrams of two paradigmatic algorithms: Focused Metropolis Search (FMS) and greedy-WalkSAT (G-WalkSAT) for random 3-SAT. The equations not only confirm the numerical observation that G-WalkSAT's algorithmic threshold is nearly parameter-independent, but also successfully predict FMS's threshold beyond the clustering transition. We also exploit these equations in a decimation scheme, demonstrating that the computed marginals encode valuable information about the local structure of the solution space explored by stochastic algorithms. Notably, our decimation approach achieves a threshold that surpasses the clustering transition, outperforming conventional methods like Belief Propagation-guided decimation. These results challenge the prevailing assumption that long-range correlations are always necessary to describe efficient local search dynamics and open a new path to designing efficient algorithms to solve combinatorial optimization problems.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections