Universality of Spectral Independence with Applications to Fast Mixing in Spin Glasses

07/19/2023
by   Nima Anari, et al.
0

We study Glauber dynamics for sampling from discrete distributions μ on the hypercube {± 1}^n. Recently, techniques based on spectral independence have successfully yielded optimal O(n) relaxation times for a host of different distributions μ. We show that spectral independence is universal: a relaxation time of O(n) implies spectral independence. We then study a notion of tractability for μ, defined in terms of smoothness of the multilinear extension of its Hamiltonian – logμ – over [-1,+1]^n. We show that Glauber dynamics has relaxation time O(n) for such μ, and using the universality of spectral independence, we conclude that these distributions are also fractionally log-concave and consequently satisfy modified log-Sobolev inequalities. We sharpen our estimates and obtain approximate tensorization of entropy and the optimal O(n) mixing time for random Hamiltonians, i.e. the classically studied mixed p-spin model at sufficiently high temperature. These results have significant downstream consequences for concentration of measure, statistical testing, and learning.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/12/2021

On Mixing of Markov Chains: Coupling, Spectral Independence, and Entropy Factorization

For general spin systems, we prove that a contractive coupling for any l...
research
11/05/2021

Entropic Independence II: Optimal Sampling and Concentration via Restricted Modified Log-Sobolev Inequalities

We introduce a framework for obtaining tight mixing times for Markov cha...
research
07/25/2023

Spectral Independence Lecture Notes

These are self-contained lecture notes for spectral independence. For an...
research
07/16/2020

Rapid mixing from spectral independence beyond the Boolean domain

We extend the notion of spectral independence (introduced by Anari, Liu,...
research
04/27/2023

Fast Sampling of b-Matchings and b-Edge Covers

For an integer b ≥ 1, a b-matching (resp. b-edge cover) of a graph G=(V,...
research
03/08/2022

Localization Schemes: A Framework for Proving Mixing Bounds for Markov Chains

Two recent and seemingly-unrelated techniques for proving mixing bounds ...

Please sign up or login with your details

Forgot password? Click here to reset