AI Paper Atlas

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

NeurIPS 2021 · Learning theory and algorithms › Sample complexity · approach: Density and property estimation · 1 citations (OpenAlex)

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 changedWhereMeasuredEffect
Replace black-box MCMC mean estimation with an adaptive multiplicative estimator using progressive sampling and trace averagingGibbs partition-function estimation with TPA and paired product estimation · Gibbs partition functionsMarkov chain stepsImproved
Use adaptive per-interval mean estimation instead of the super-product-chain estimatorDoubly adaptive partition-function estimation · High-precision estimationMarkov chain steps: ℓ²∑_{i=1}^ℓ τ_iMixed

Closest papers by meaning

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.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy