Spectral Lower Bounds for Local Search

Local search is a powerful heuristic in optimization and computer science, the complexity of which has been studied in the white box and black box models. In the black box model, we are given a graph G = (V,E) and oracle access to a function f : V →ℝ. The local search problem is to find a vertex v that is a local minimum, i.e. with f(v) ≤ f(u) for all (u,v) ∈ E, using as few queries to the oracle as possible. We show that if a graph G admits a lazy, irreducible, and reversible Markov chain with stationary distribution π, then the randomized query complexity of local search on G is Ω( √(n)/t_mix·exp(3σ)), where t_mix is the mixing time of the chain and σ = max_u,v ∈ V(G)π(v)/π(u). This theorem formally establishes a connection between the query complexity of local search and the mixing time of the fastest mixing Markov chain for the given graph. We also get several corollaries that lower bound the complexity as a function of the spectral gap, one of which slightly improves a result from prior work.