← Back to all news
Towards Data Science By Samit Ganguly

Three Samplers, One Posterior: NUTS vs. Emcee vs. Nested Sampling

Read the original on Towards Data Science →

The article compares three sampling methods—NumPyro’s NUTS, the affine‑invariant MCMC sampler Emcee, and the nested sampling algorithm dynesty—by benchmarking them against an exact ground truth. It evaluates how each sampler performs and documents their failures in practice. The comparison provides insights into the strengths and limitations of each approach for posterior inference.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at Towards Data Science.

Related stories

arXiv AI
Jun 10

Sample Where You Struggle: Sharpening Base Model Reasoning via Entropy-Guided Power Sampling

arXiv:2606. 09926v1 Announce Type: cross Abstract: Sampling from the sequence-level power distribution $p^\alpha$ elicits RL-level reasoning from base language models without any parameter updates, but the standard Metropolis--Hastings (MH), a Markov Chain Monte Carlo (MCMC) sampler, is both expensive and slow-mixing.

By Hong Guo, Nianhui Guo, Christoph Meinel, Haojin Yang
llmsreinforcement-learningbenchmarks
More like this →
arXiv Machine Learning
Oct 23

Generalizing Metropolis-Hastings for DAG Sampling

The paper introduces duet sampling, a generalization of the Metropolis-Hastings algorithm that selects two proposal distributions from a pool at each iteration to resample parents for multiple nodes in a directed acyclic graph (DAG). This approach enables Markov chain moves that mix more efficiently without extra computational cost, outperforming existing state‑of‑the‑art methods in experiments. The authors demonstrate that their novel moves, both alone and combined, achieve superior performance even when previous methods also adopt duet sampling.

By Daniele Nikzad, Mikko Koivisto
More like this →
arXiv Machine Learning
Oct 12

Amortised Inference through One-Step Implicit Sampling

The paper introduces OSIS, a one‑step implicit sampler that uses short‑time MCMC dynamics to define a local target for an implicitly modelled distribution. In the asymptotic limit, the model converges to a fixed point of the MCMC kernel, enabling unbiased sampling from the Bayesian posterior. Experiments show OSIS outperforms multi‑step amortised samplers and non‑amortised MCMC baselines while being far more efficient at sampling time.

By Vincent Pauline, Kirill Tamogashev, Arran Carter, Sanghyeok Choi, Stefan Bauer, Esmeralda S. Whitammer
diffusion
More like this →
arXiv Statistics ML
Oct 15

MCMC Can See Can't See

arXiv:2610.20020v1 Announce Type: cross Abstract: It is folklore that passing "convergence" diagnostics does not guarantee that a Markov chain has converged. We prove this as an impossibility for any...

By Daniel Matsui Smola
safety
More like this →