Weiming Feng

Orcid: 0000-0003-4636-1023

Affiliations:
  • ETH Zürich, Switzerland
  • UC Berkeley, CA, USA (2023)
  • University of Edinburgh, UK (2021-2023)
  • Nanjing University, China (PhD 2021)


According to our database1, Weiming Feng authored at least 27 papers between 2018 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
On Deterministically Approximating Total Variation Distance.
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

2023
Swendsen-Wang dynamics for the ferromagnetic Ising model with external fields.
Inf. Comput., October, 2023

A simple polynomial-time approximation algorithm for the total variation distance between two product distributions.
TheoretiCS, 2023

An FPRAS for two terminal reliability in directed acyclic graphs.
CoRR, 2023

Approximate Counting for Spin Systems in Sub-Quadratic Time.
CoRR, 2023

On the Mixing Time of Glauber Dynamics for the Hard-Core and Related Models on G(n, d/n).
Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

Towards derandomising Markov chain Monte Carlo.
Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

2022
Rapid Mixing from Spectral Independence beyond the Boolean Domain.
ACM Trans. Algorithms, 2022

Perfect sampling from spatial mixing.
Random Struct. Algorithms, 2022

A simple polynomial-time approximation algorithm for total variation distances between product distributions.
CoRR, 2022

Sampling from the ferromagnetic Ising model with external fields.
CoRR, 2022

Optimal mixing for two-state anti-ferromagnetic spin systems.
Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022

Improved Bounds for Randomly Colouring Simple Hypergraphs.
Proceedings of the Approximation, 2022

2021
Dynamic Sampling from Graphical Models.
SIAM J. Comput., 2021

Fast Sampling and Counting <i>k</i>-SAT Solutions in the Local Lemma Regime.
J. ACM, 2021

Optimal Mixing Time for the Ising Model in the Uniqueness Regime.
CoRR, 2021

Sampling constraint satisfaction solutions in the local lemma regime.
Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021

Distributed Metropolis Sampler with Optimal Parallelism.
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

Dynamic Inference in Probabilistic Graphical Models.
Proceedings of the 12th Innovations in Theoretical Computer Science Conference, 2021

Rapid mixing of Glauber dynamics via spectral independence for all degrees.
Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021

2020
What can be sampled locally?
Distributed Comput., 2020

Fast sampling and counting k-SAT solutions in the local lemma regime.
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020

2019
Dynamic MCMC Sampling.
CoRR, 2019

Fully-Asynchronous Distributed Metropolis Sampler with Optimal Speedup.
CoRR, 2019

2018
Local Rejection Sampling with Soft Filters.
CoRR, 2018

Distributed Symmetry Breaking in Sampling (Optimal Distributed Randomly Coloring with Fewer Colors).
CoRR, 2018

On Local Distributed Sampling and Counting.
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, 2018


  Loading...