Heng Guo

Publication Activity (10 Years)

Years Active: 2009-2024
Publications (10 Years): 69

Top Topics

Uniform Sampling

Boltzmann Machine

Top Venues

SIAM J. Comput.

Publications

Weiming Feng, Heng Guo
An FPRAS for Two Terminal Reliability in Directed Acyclic Graphs. ICALP (2024)
Konrad Anand, Weiming Feng, Graham Freifeld, Heng Guo, Jiaheng Wang
Approximate Counting for Spin Systems in Sub-Quadratic Time. ICALP (2024)
Weiming Feng, Heng Guo, Chunyang Wang, Jiaheng Wang, Yitong Yin
Towards derandomising Markov chain Monte Carlo. FOCS (2023)
Weiming Feng, Heng Guo, Jiaheng Wang
Swendsen-Wang dynamics for the ferromagnetic Ising model with external fields. Inf. Comput. 294 (2023)
Weiming Feng, Heng Guo, Mark Jerrum, Jiaheng Wang
A simple polynomial-time approximation algorithm for the total variation distance between two product distributions. TheoretiCS 2 (2023)
Heng Guo, Mark Jerrum
Counting Vertices of Integral Polytopes Defined by Facets. Discret. Comput. Geom. 70 (3) (2023)
Weiming Feng, Heng Guo, Mark Jerrum, Jiaheng Wang
A simple polynomial-time approximation algorithm for the total variation distance between two product distributions. SOSA (2023)
Weiming Feng, Heng Guo, Jiaheng Wang
Improved Bounds for Randomly Colouring Simple Hypergraphs. APPROX/RANDOM (2022)
Weiming Feng, Heng Guo, Chunyang Wang, Jiaheng Wang, Yitong Yin
Towards derandomising Markov chain Monte Carlo. CoRR (2022)
Weiming Feng, Heng Guo, Mark Jerrum, Jiaheng Wang
A simple polynomial-time approximation algorithm for total variation distances between product distributions. CoRR (2022)
Andreas Galanis, Heng Guo, Jiaheng Wang
Inapproximability of Counting Hypergraph Colourings. ACM Trans. Comput. Theory 14 (3-4) (2022)
Weiming Feng, Heng Guo, Jiaheng Wang
Sampling from the ferromagnetic Ising model with external fields. CoRR (2022)
Andreas Galanis, Leslie Ann Goldberg, Heng Guo, Andrés Herrera-Poyatos
Fast sampling of satisfying assignments from random k-SAT. CoRR (2022)
Weiming Feng, Heng Guo, Yitong Yin, Chihao Zhang
Rapid Mixing from Spectral Independence beyond the Boolean Domain. ACM Trans. Algorithms 18 (3) (2022)
Weiming Feng, Heng Guo, Jiaheng Wang
Improved bounds for randomly colouring simple hypergraphs. CoRR (2022)
Weiming Feng, Heng Guo, Yitong Yin
Perfect sampling from spatial mixing. Random Struct. Algorithms 61 (4) (2022)
Jin-Yi Cai, Zhiguo Fu, Heng Guo, Tyson Williams
FKT is Not Universal - A Planar Holant Dichotomy for Symmetric Constraints. Theory Comput. Syst. 66 (1) (2022)
Zhuolin Yang, Zhikuan Zhao, Boxin Wang, Jiawei Zhang, Linyi Li, Hengzhi Pei, Bojan Karlas, Ji Liu, Heng Guo, Ce Zhang, Bo Li
Improving Certified Robustness via Statistical Learning with Logical Reasoning. NeurIPS (2022)
Weiming Feng, Heng Guo, Yitong Yin, Chihao Zhang
Rapid Mixing from Spectral Independence beyond the Boolean Domain. SODA (2021)
Andreas Galanis, Leslie Ann Goldberg, Heng Guo, Kuan Yang
Counting Solutions to Random CNF Formulas. SIAM J. Comput. 50 (6) (2021)
Heng Guo, Chao Liao, Pinyan Lu, Chihao Zhang
Zeros of Holant Problems: Locations and Algorithms. ACM Trans. Algorithms 17 (1) (2021)
Weiming Feng, Heng Guo, Yitong Yin, Chihao Zhang
-SAT Solutions in the Local Lemma Regime. J. ACM 68 (6) (2021)
Andreas Galanis, Heng Guo, Jiaheng Wang
Inapproximability of counting hypergraph colourings. CoRR (2021)
Heng Guo, Mark Jerrum
Approximately counting bases of bicircular matroids. Comb. Probab. Comput. 30 (1) (2021)
Heng Guo, Mark Jerrum
Counting vertices of integer polytopes defined by facets. CoRR (2021)
Zhuolin Yang, Zhikuan Zhao, Hengzhi Pei, Boxin Wang, Bojan Karlas, Ji Liu, Heng Guo, Bo Li, Ce Zhang
End-to-end Robustness for Sensing-Reasoning Machine Learning Pipelines. CoRR (2020)
Heng Guo, Kun He
Tight bounds for popping algorithms. Random Struct. Algorithms 57 (2) (2020)
Weiming Feng, Heng Guo, Yitong Yin, Chihao Zhang
Rapid mixing from spectral independence beyond the Boolean domain. CoRR (2020)
Heng Guo, Tyson Williams
The complexity of planar Boolean #CSP with complex weights. J. Comput. Syst. Sci. 107 (2020)
Heng Guo, Giorgos Mousa
Local-to-Global Contraction in Simplicial Complexes. CoRR (2020)
Heng Guo, Jingcheng Liu, Pinyan Lu
Zeros of ferromagnetic 2-spin systems. SODA (2020)
Andreas Galanis, Leslie Ann Goldberg, Heng Guo, Kuan Yang
Counting Solutions to Random CNF Formulas. ICALP (2020)
Weiming Feng, Heng Guo, Yitong Yin, Chihao Zhang
Fast sampling and counting k-SAT solutions in the local lemma regime. STOC (2020)
Mary Cryan, Heng Guo, Giorgos Mousa
Modified log-Sobolev Inequalities for Strongly Log-Concave Distributions. FOCS (2019)
Heng Guo, Chao Liao, Pinyan Lu, Chihao Zhang
Zeros of Holant problems: locations and algorithms. SODA (2019)
Heng Guo, Mark Jerrum, Jingcheng Liu
Uniform Sampling Through the Lovász Local Lemma. J. ACM 66 (3) (2019)
Ivona Bezáková, Andreas Galanis, Leslie Ann Goldberg, Heng Guo, Daniel Stefankovic
Approximation via Correlation Decay When Strong Spatial Mixing Fails. SIAM J. Comput. 48 (2) (2019)
Weiming Feng, Heng Guo, Yitong Yin, Chihao Zhang
Fast sampling and counting k-SAT solutions in the local lemma regime. CoRR (2019)
Heng Guo, Jingcheng Liu, Pinyan Lu
Zeros of ferromagnetic 2-spin systems. CoRR (2019)
Heng Guo, Chao Liao, Pinyan Lu, Chihao Zhang
Counting Hypergraph Colorings in the Local Lemma Regime. SIAM J. Comput. 48 (4) (2019)
Andreas Galanis, Leslie Ann Goldberg, Heng Guo, Kuan Yang
Counting solutions to random CNF formulas. CoRR (2019)
Heng Guo, Mark Jerrum
A Polynomial-Time Approximation Algorithm for All-Terminal Network Reliability. SIAM J. Comput. 48 (3) (2019)
Weiming Feng, Heng Guo, Yitong Yin
Perfect sampling from spatial mixing. CoRR (2019)
Mary Cryan, Heng Guo, Giorgos Mousa
Modified log-Sobolev inequalities for strongly log-concave distributions. CoRR (2019)
Heng Guo, Mark Jerrum
Perfect simulation of the Hard Disks Model by Partial Rejection Sampling. CoRR (2018)
Heng Guo, Mark Jerrum
Approximately counting bases of bicircular matroids. CoRR (2018)
Heng Guo, Chao Liao, Pinyan Lu, Chihao Zhang
Counting hypergraph colourings in the local lemma regime. STOC (2018)
Jin-Yi Cai, Heng Guo, Tyson Williams
Clifford gates in the Holant framework. Theor. Comput. Sci. 745 (2018)
Heng Guo, Kun He
Tight bounds for popping algorithms. CoRR (2018)
Heng Guo, Mark Jerrum
Perfect Simulation of the Hard Disks Model by Partial Rejection Sampling. ICALP (2018)
Jin-Yi Cai, Heng Guo, Tyson Williams
Holographic algorithms beyond matchgates. Inf. Comput. 259 (1) (2018)
Heng Guo, Mark Jerrum
A Polynomial-Time Approximation Algorithm for All-Terminal Network Reliability. ICALP (2018)
Heng Guo, Kaan Kara, Ce Zhang
Layerwise Systematic Scan: Deep Boltzmann Machines and Beyond. AISTATS (2018)
Heng Guo, Chao Liao, Pinyan Lu, Chihao Zhang
Zeros of Holant problems: locations and algorithms. CoRR (2018)
Heng Guo, Pinyan Lu
Uniqueness, Spatial Mixing, and Approximation for Ferromagnetic 2-Spin Systems. ACM Trans. Comput. Theory 10 (4) (2018)
Heng Guo, Mark Jerrum
A simple FPRAS for bi-directed reachability. CoRR (2017)
Jin-Yi Cai, Heng Guo, Tyson Williams
Clifford Gates in the Holant Framework. CoRR (2017)
Heng Guo, Mark Jerrum, Jingcheng Liu
Uniform sampling through the Lovasz local lemma. STOC (2017)
Leslie Ann Goldberg, Heng Guo
The Complexity of Approximating complex-valued Ising and Tutte partition functions. Comput. Complex. 26 (4) (2017)
Heng Guo, Mark Jerrum
Random cluster dynamics for the Ising model is rapidly mixing. SODA (2017)
Heng Guo, Kaan Kara, Ce Zhang
Layerwise Systematic Scan: Deep Boltzmann Machines and Beyond. CoRR (2017)
Heng Guo, Chao Liao, Pinyan Lu, Chihao Zhang
Counting hypergraph colorings in the local lemma regime. CoRR (2017)
Jin-Yi Cai, Heng Guo, Tyson Williams
A Complete Dichotomy Rises from the Capture of Vanishing Signatures. SIAM J. Comput. 45 (5) (2016)
Heng Guo, Pinyan Lu
Uniqueness, Spatial Mixing, and Approximation for Ferromagnetic 2-Spin Systems. APPROX-RANDOM (2016)
Heng Guo
Mapping the complexity of counting problems. Bull. EATCS 120 (2016)
Ivona Bezáková, Andreas Galanis, Leslie Ann Goldberg, Heng Guo, Daniel Stefankovic
Approximation via Correlation Decay When Strong Spatial Mixing Fails. ICALP (2016)
Heng Guo, Mark Jerrum, Jingcheng Liu
Uniform Sampling through the Lovász Local Lemma. CoRR (2016)
Jin-Yi Cai, Andreas Galanis, Leslie Ann Goldberg, Heng Guo, Mark Jerrum, Daniel Stefankovic, Eric Vigoda
#BIS-hardness for 2-spin systems on bipartite bounded degree graphs in the tree non-uniqueness region. J. Comput. Syst. Sci. 82 (5) (2016)
Heng Guo, Mark Jerrum
Random cluster dynamics for the Ising model is rapidly mixing. CoRR (2016)
Heng Guo, Pinyan Lu
Uniqueness, Spatial Mixing, and Approximation for Ferromagnetic 2-Spin Systems. CoRR (2015)
Jin-Yi Cai, Zhiguo Fu, Heng Guo, Tyson Williams
A Holant Dichotomy: Is the FKT Algorithm Universal? CoRR (2015)
Ivona Bezáková, Andreas Galanis, Leslie Ann Goldberg, Heng Guo, Daniel Stefankovic
Approximation via Correlation Decay when Strong Spatial Mixing Fails. CoRR (2015)
Jin-Yi Cai, Zhiguo Fu, Heng Guo, Tyson Williams
A Holant Dichotomy: Is the FKT Algorithm Universal? FOCS (2015)
Jin-Yi Cai, Heng Guo, Tyson Williams
The Complexity of Counting Edge Colorings and a Dichotomy for Some Higher Domain Holant Problems. FOCS (2014)
Jin-Yi Cai, Heng Guo, Tyson Williams
The Complexity of Counting Edge Colorings and a Dichotomy for Some Higher Domain Holant Problems. CoRR (2014)
Leslie Ann Goldberg, Heng Guo
The complexity of approximating complex-valued Ising and Tutte partition functions with applications to quantum simulation. CoRR (2014)
Jin-Yi Cai, Heng Guo, Tyson Williams
Holographic Algorithms Beyond Matchgates. ICALP (1) (2014)
Jin-Yi Cai, Andreas Galanis, Leslie Ann Goldberg, Heng Guo, Mark Jerrum, Daniel Stefankovic, Eric Vigoda
#BIS-Hardness for 2-Spin Systems on Bipartite Bounded Degree Graphs in the Tree Non-uniqueness Region. APPROX-RANDOM (2014)
Jin-Yi Cai, Heng Guo, Tyson Williams
Holographic Algorithms Beyond Matchgates. CoRR (2013)
Heng Guo, Pinyan Lu, Leslie G. Valiant
The Complexity of Symmetric Boolean Parity Holant Problems. SIAM J. Comput. 42 (1) (2013)
Jin-Yi Cai, Leslie Ann Goldberg, Heng Guo, Mark Jerrum
Approximating the Partition Function of Two-Spin Systems on Bipartite Graphs. CoRR (2013)
Jin-Yi Cai, Heng Guo, Tyson Williams
A complete dichotomy rises from the capture of vanishing signatures: extended abstract. STOC (2013)
Heng Guo, Tyson Williams
The Complexity of Planar Boolean #CSP with Complex Weights. ICALP (1) (2013)
Jin-Yi Cai, Xi Chen, Heng Guo, Pinyan Lu
Inapproximability after Uniqueness Phase Transition in Two-Spin Systems. COCOA (2012)
Jin-Yi Cai, Xi Chen, Heng Guo, Pinyan Lu
Inapproximability After Uniqueness Phase Transition in Two-Spin Systems CoRR (2012)
Heng Guo, Tyson Williams
The Complexity of Planar Boolean #CSP with Complex Weights CoRR (2012)
Jin-Yi Cai, Heng Guo, Tyson Williams
A Complete Dichotomy Rises from the Capture of Vanishing Signatures CoRR (2012)
Heng Guo, Sangxia Huang, Pinyan Lu, Mingji Xia
The Complexity of Weighted Boolean #CSP Modulo k. STACS (2011)
Heng Guo, Pinyan Lu, Leslie G. Valiant
The Complexity of Symmetric Boolean Parity Holant Problems - (Extended Abstract). ICALP (1) (2011)
Heng Guo, Hanpin Wang, Zhongyuan Xu, Yongzhi Cao
On Model Checking Boolean BI. CSL (2009)