Tight lipschitz hardness for optimizing mean field spin glasses

B Huang, M Sellke - 2022 IEEE 63rd Annual Symposium on …, 2022 - ieeexplore.ieee.org
We study the problem of algorithmically optimizing the Hamiltonian of a spherical or Ising
mean field spin glass. The maximum asymptotic value OPT of this random function is …

Rapid mixing of Glauber dynamics up to uniqueness via contraction

Z Chen, K Liu, E Vigoda - SIAM Journal on Computing, 2023 - SIAM
For general antiferromagnetic 2-spin systems, including the hardcore model on weighted
independent sets and the antiferromagnetic Ising model, there is an for the partition function …

Rapid mixing of Glauber dynamics via spectral independence for all degrees

X Chen, W Feng, Y Yin, X Zhang - SIAM Journal on Computing, 2024 - SIAM
We prove an optimal lower bound on a spectral gap of the Glauber dynamics for
antiferromagnetic two-spin systems with vertices in the tree uniqueness regime. This …

Parallel discrete sampling via continuous walks

N Anari, Y Huang, T Liu, TD Vuong, B Xu… - Proceedings of the 55th …, 2023 - dl.acm.org
We develop a framework for sampling from discrete distributions µ on the hypercube {±1} n
by sampling from continuous distributions supported on ℝ n obtained by convolution with …

Algorithmic threshold for multi-species spherical spin glasses

B Huang, M Sellke - arXiv preprint arXiv:2303.12172, 2023 - arxiv.org
We study efficient optimization of the Hamiltonians of multi-species spherical spin glasses.
Our results characterize the maximum value attained by algorithms that are suitably …

The threshold energy of low temperature Langevin dynamics for pure spherical spin glasses

M Sellke - Communications on Pure and Applied Mathematics, 2023 - Wiley Online Library
We study the Langevin dynamics for spherical pp‐spin models, focusing on the short time
regime described by the Cugliandolo–Kurchan equations. Confirming a prediction of …

Towards derandomising markov chain monte carlo

W Feng, H Guo, C Wang, J Wang… - 2023 IEEE 64th Annual …, 2023 - ieeexplore.ieee.org
We present a new framework to derandomise certain Markov chain Monte Carlo (MCMC)
algorithms. As in MCMC, we first reduce counting problems to sampling from a sequence of …

Combinatorial approach for factorization of variance and entropy in spin systems

Z Chen - Proceedings of the 2024 Annual ACM-SIAM …, 2024 - SIAM
We present a simple combinatorial framework for establishing approximate tensorization of
variance and entropy in the setting of spin systems (aka undirected graphical models) based …

Fast Sampling of b-Matchings and b-Edge Covers

Z Chen, Y Gu - Proceedings of the 2024 Annual ACM-SIAM …, 2024 - SIAM
For an integer b≥ 1, ab-matching (resp. b-edge cover) of a graph G=(V, E) is a subset S⊆ E
of edges such that every vertex is incident with at most (resp. at least) b edges from S. We …

Fast sampling via spectral independence beyond bounded-degree graphs

I Bezáková, A Galanis, LA Goldberg… - ACM Transactions on …, 2024 - dl.acm.org
Spectral independence is a recently developed framework for obtaining sharp bounds on
the convergence time of the classical Glauber dynamics. This new framework has yielded …