1 citations · 1 across the 6 of their papers we have counts for
8 papers
An -Time Sampler for Zero-Field Ferromagnetic Ising Models
Weiming Feng, Heng Guo, Yiyao Zhang
We give an approximate sampler for ferromagnetic Ising models with no field on arbitrary graphs that runs in time , w…
Rapid mixing in positively weighted restricted Boltzmann machines
Weiming Feng, Heng Guo, Minji Yang
We show polylogarithmic mixing time bounds for the alternating-scan sampler for positively weighted restricted Boltzmann machines. This is done via analysing the same chain and the…
Rapid Mixing of Glauber Dynamics for Monotone Systems via Entropic Independence
Weiming Feng, Minji Yang
We study the mixing time of Glauber dynamics on monotone systems. For monotone systems satisfying the entropic independence condition, we prove a new mixing time comparison result…
Faster Mixing of the Jerrum-Sinclair Chain
Xiaoyu Chen, Weiming Feng, Zhe Ju +3
We show that the Jerrum-Sinclair Markov chain on matchings mixes in time on any graph with vertices, edges, and maximum degree , for any constant…
Approximating the total variation distance between spin systems
Weiming Feng, Hongyang Liu, Minji Yang
Spin systems form an important class of undirected graphical models. For two Gibbs distributions and induced by two spin systems on the same graph , we study th…
Deterministic counting from coupling independence
Xiaoyu Chen, Weiming Feng, Heng Guo +2
We show that spin systems with bounded degrees and coupling independence admit fully polynomial time approximation schemes (FPTAS). We design a new recursive deterministic counting…
Rapid Mixing via Coupling Independence for Spin Systems with Unbounded Degree
Xiaoyu Chen, Weiming Feng
We develop a new framework to prove the mixing or relaxation time for the Glauber dynamics on spin systems with unbounded degree. It works for general spin systems including both $…
Optimal Mixing for Randomly Sampling Edge Colorings on Trees Down to the Max Degree
Charlie Carlson, Xiaoyu Chen, Weiming Feng +1
We address the convergence rate of Markov chains for randomly generating an edge coloring of a given tree. Our focus is on the Glauber dynamics which updates the color at a randoml…