pith. sign in

arxiv: 1903.03704 · v1 · pith:X36J3WADnew · submitted 2019-03-09 · 📊 stat.CO · stat.ML

NeuTra-lizing Bad Geometry in Hamiltonian Monte Carlo Using Neural Transport

classification 📊 stat.CO stat.ML
keywords geometryneuralposteriorcarlodistributionhamiltonianmonteneutra
0
0 comments X
read the original abstract

Hamiltonian Monte Carlo is a powerful algorithm for sampling from difficult-to-normalize posterior distributions. However, when the geometry of the posterior is unfavorable, it may take many expensive evaluations of the target distribution and its gradient to converge and mix. We propose neural transport (NeuTra) HMC, a technique for learning to correct this sort of unfavorable geometry using inverse autoregressive flows (IAF), a powerful neural variational inference technique. The IAF is trained to minimize the KL divergence from an isotropic Gaussian to the warped posterior, and then HMC sampling is performed in the warped space. We evaluate NeuTra HMC on a variety of synthetic and real problems, and find that it significantly outperforms vanilla HMC both in time to reach the stationary distribution and asymptotic effective-sample-size rates.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 7 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Non-Vacuous Certification of Transport MCMC via Oscillation-Controlled Normalizing Flows

    cs.LG 2026-05 unverdicted novelty 8.0

    First non-vacuous 95%-rigorous spectral-gap certificates for Transport MCMC on banana and other targets, obtained via spectral normalization, coverage-based empirical oscillation bounds, and oscillation-regularized training.

  2. Self-Certifying Transport MCMC via Dual Spectral-Gap Certificates

    cs.LG 2026-05 unverdicted novelty 8.0

    CerT-MCMC introduces dual certificates for spectral-gap bounds in learned-transport MCMC, with the quantile-core version remaining non-vacuous up to D=20 and tracking effective sample size within 7%.

  3. Variational Inference via Entropic Transport Descent

    cs.LG 2026-06 unverdicted novelty 7.0

    ETD derives particle updates in ParVI from the JKO scheme lifted to couplings and relaxed by KL chain rule, reducing each step to Sinkhorn and showing gains over SVGD in high-dim and multimodal tests.

  4. Folded Transport MCMC: Eliminating Label Switching by Sampling on a Fundamental Domain

    cs.LG 2026-06 unverdicted novelty 7.0

    Folded Transport MCMC eliminates label switching in exchangeable-component models by restricting the Markov chain to a fundamental domain with a symmetrised normalising flow proposal while preserving a computable conv...

  5. Adaptive Riemannian Manifold Hamiltonian Monte Carlo with Hierarchical Metric

    stat.CO 2026-04 unverdicted novelty 7.0

    An adaptive hierarchical RMHMC sampler with closed-form leapfrog integrator and automatic mass matrix tuning for efficient MCMC in high-dimensional Bayesian problems.

  6. Using Symbolic Regression to Emulate the Radial Fourier Transform of the S\'ersic profile for Fast, Accurate and Differentiable Galaxy Profile Fitting

    astro-ph.IM 2025-08 conditional novelty 7.0

    Symbolic regression yields an emulator for the radial Fourier transform of the Sérsic profile that enables 2.5 times faster galaxy profile fitting with minimal accuracy loss.

  7. Corrected Integrated Laplace Approximation for Bayesian Inference in Latent Gaussian Models

    stat.ML 2026-05 unverdicted novelty 5.0

    An importance sampling correction is added to integrated Laplace approximation so that the approximate posterior for latent Gaussian models converges to the true posterior as the number of samples grows.