18 citations · 25 across the 7 of their papers we have counts for
7 papers · 1 filter
Almost-Linear Planted Cliques Elude the Metropolis Process
Zongchen Chen, Elchanan Mossel, Ilias Zadik
A seminal work of Jerrum (1992) showed that large cliques elude the Metropolis process. More specifically, Jerrum showed that the Metropolis algorithm cannot find a clique of size…
Sampling Colorings and Independent Sets of Random Regular Bipartite Graphs in the Non-Uniqueness Region
Zongchen Chen, Andreas Galanis, Daniel Štefankovič +1
For spin systems, such as the -colorings and independent-set models, approximating the partition function in the so-called non-uniqueness region, where the model exhibits long-r…
Rapid Mixing for Colorings via Spectral Independence
Zongchen Chen, Andreas Galanis, Daniel Štefankovič +1
The spectral independence approach of Anari et al. (2020) utilized recent results on high-dimensional expanders of Alev and Lau (2020) and established rapid mixing of the Glauber d…
Hardness of Identity Testing for Restricted Boltzmann Machines and Potts models
Antonio Blanca, Zongchen Chen, Daniel Štefankovič +1
We study identity testing for restricted Boltzmann machines (RBMs), and more generally for undirected graphical models. Given sample access to the Gibbs distribution corresponding…
Optimal Convergence Rate of Hamiltonian Monte Carlo for Strongly Logconcave Distributions
Zongchen Chen, Santosh S. Vempala
We study Hamiltonian Monte Carlo (HMC) for sampling from a strongly logconcave density proportional to where is -strongly convex and …
Lower bounds for testing graphical models: colorings and antiferromagnetic Ising models
Ivona Bezakova, Antonio Blanca, Zongchen Chen +2
We study the identity testing problem in the context of spin systems or undirected graphical models, where it takes the following form: given the parameter specification of the mod…