Research map / Learning theory and algorithms / Sample complexity
Fast Doubly-Adaptive MCMC to Estimate the Gibbs Partition Function with Weak Mixing Time Bounds
Shahrzad Haddadan, Yue Zhuang, Cyrus Cousins, Eli Upfal
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Replace black-box MCMC mean estimation with an adaptive multiplicative estimator using progressive sampling and trace averaging | Gibbs partition-function estimation with TPA and paired product estimation · Gibbs partition functions | Markov chain steps | Improved |
| Use adaptive per-interval mean estimation instead of the super-product-chain estimator | Doubly adaptive partition-function estimation · High-precision estimation | Markov chain steps: ℓ²∑_{i=1}^ℓ τ_i | Mixed |
Closest papers by meaning
- Ensuring Rapid Mixing and Low Bias for Asynchronous Gibbs Sampling (ICML 2016 · similarity 0.90)
- Minibatch Gibbs Sampling on Large Graphical Models (ICML 2018 · similarity 0.88)
- Poisson-Minibatching for Gibbs Sampling with Convergence Rate Guarantees (NeurIPS 2019 · similarity 0.88)
- Diffusive Gibbs Sampling (ICML 2024 · similarity 0.87)
- Fast training and sampling of Restricted Boltzmann Machines (ICLR 2025 · similarity 0.86)
- Progressive Inference-Time Annealing of Diffusion Models for Sampling from Boltzmann Densities (NeurIPS 2025 · similarity 0.86)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
