Reshaping Global Loop Structure to Accelerate Local Optimization by Smoothing Rugged Landscapes

TL;DR

This paper introduces a structured graph copy-and-reconnect method to reshape global loop structures, smoothing rugged energy landscapes and improving local optimization efficiency in probabilistic graphical models.

Contribution

It generalizes the M-layer construction by replacing uniform random rewiring with a structured kernel, enhancing optimization by controlling global loop structures without altering local interactions.

Findings

Reduces computational cost for Ising model benchmarks.

Increases polynomial-time algorithmic threshold for maximum independent set.

Smooths energy landscapes by collapsing configurational complexity.

Abstract

Probabilistic graphical models with frustration exhibit rugged energy landscapes that trap iterative optimization dynamics. These landscapes are shaped not only by local interactions, but crucially also by the global loop structure of the graph. The famous Bethe approximation treats the graph as a tree, effectively ignoring global structure, thereby limiting its effectiveness for optimization. Loop expansions capture such global structure in principle, but are often impractical due to combinatorial explosion. The $M$-layer construction provides an alternative: make $M$ copies of the graph and reconnect edges between them uniformly at random. This provides a controlled sequence of approximations from the original graph at $M=1$, to the Bethe approximation as $M \rightarrow \infty$. Here we generalize this construction by replacing uniform random rewiring with a structured mixing kernel $Q$ that sets the probability that any two layers are interconnected. As a result, the global loop structure can be shaped without modifying local interactions. We show that, after this copy-and-reconnect transformation, there exists a regime in which layer-to-layer fluctuations decay, increasing the probability of reaching the global minimum of the energy function of the original graph. This yields a highly general and practical tool for optimization. Using this approach, the computational cost required to reach these optimal solutions is reduced across sparse and dense Ising benchmarks, including spin glasses and planted instances. When combined with replica-exchange Monte Carlo, the same construction increases the polynomial-time algorithmic threshold for the maximum independent set problem. A cavity analysis shows that structured inter-layer coupling significantly smooths rugged energy landscapes by collapsing configurational complexity and suppressing many suboptimal metastable states.