Author of the publication

The Mean-Field Approximation: Information Inequalities, Algorithms, and Complexity

, , and . (2018)cite arxiv:1802.06126Comment: Updated bibliography.

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Mean-field approximation, convex hierarchies, and the optimality of correlation rounding: a unified perspective., , and . STOC, page 1226-1236. ACM, (2019)The Mean-Field Approximation: Information Inequalities, Algorithms, and Complexity, , and . (2018)cite arxiv:1802.06126Comment: Updated bibliography.Spectral independence, coupling with the stationary distribution, and the spectral gap of the Glauber dynamics., , and . CoRR, (2021)Perfectly sampling k ≥ (8/3 + o(1))Δ-colorings in graphs., , and . STOC, page 1589-1600. ACM, (2021)Accuracy-Memory Tradeoffs and Phase Transitions in Belief Propagation., , , and . COLT, volume 99 of Proceedings of Machine Learning Research, page 1756-1771. PMLR, (2019)Universality of Spectral Independence with Applications to Fast Mixing in Spin Glasses., , , , and . SODA, page 5029-5056. SIAM, (2024)The Vertex Sample Complexity of Free Energy is Polynomial., , and . COLT, volume 75 of Proceedings of Machine Learning Research, page 1395-1419. PMLR, (2018)Towards the sampling Lovász Local Lemma., , and . CoRR, (2020)A First Principle Based Investigation on the Effects of Stacking Configuration and Biaxial Strain on the Electronic Properties of Bilayer MoS2., , , , , and . ISDCS, page 1-5. IEEE, (2021)Entropic independence: optimal mixing of down-up random walks., , , , and . STOC, page 1418-1430. ACM, (2022)