A Local Lemma for Focused Stochastic Algorithms

by   Dimitris Achlioptas, et al.

We develop a framework for the rigorous analysis of focused stochastic local search algorithms. These are algorithms that search a state space by repeatedly selecting some constraint that is violated in the current state and moving to a random nearby state that addresses the violation, while hopefully not introducing many new ones. An important class of focused local search algorithms with provable performance guarantees has recently arisen from algorithmizations of the Lovász Local Lemma (LLL), a non-constructive tool for proving the existence of satisfying states by introducing a background measure on the state space. While powerful, the state transitions of algorithms in this class must be, in a precise sense, perfectly compatible with the background measure. In many applications this is a very restrictive requirement and one needs to step outside the class. Here we introduce the notion of measure distortion and develop a framework for analyzing arbitrary focused stochastic local search algorithms, recovering LLL algorithmizations as the special case of no distortion. Our framework takes as input an arbitrary such algorithm and an arbitrary probability measure and shows how to use the measure as a yardstick of algorithmic progress, even for algorithms designed independently of the measure.


A New Perspective on Stochastic Local Search and the Lovasz Local Lemma

We present a new perspective on the analysis of stochastic local search ...

A new notion of commutativity for the algorithmic Lovász Local Lemma

The Lovász Local Lemma (LLL) is a powerful tool in probabilistic combina...

Using Stochastic local search in designing microstrip antenna for 5G communication

Well this paper defines methods to explore what is known as the local se...

Unweighted Stochastic Local Search can be Effective for Random CSP Benchmarks

We present ULSA, a novel stochastic local search algorithm for random bi...

Improving the Performance of Stochastic Local Search for Maximum Vertex Weight Clique Problem Using Programming by Optimization

The maximum vertex weight clique problem (MVWCP) is an important general...

Efficiently list-edge coloring multigraphs asymptotically optimally

We give polynomial time algorithms for the seminal results of Kahn, who ...

Why Local Search Excels in Expression Simplification

Simplifying expressions is important to make numerical integration of la...

Please sign up or login with your details

Forgot password? Click here to reset