mlsanityData to 7 Oct 2026

NEO: Non Equilibrium Sampling on the Orbit of a Deterministic Transform

arXiv 2103.10943 ↗First posted 17 Mar 2021stat.CO stat.ME stat.MLcited by 1

Not on the map. Why?

Abstract (arXiv)

Sampling from a complex distribution π and approximating its intractable normalizing constant Z are challenging problems. In this paper, a novel family of importance samplers (IS) and Markov chain Monte Carlo (MCMC) samplers is derived. Given an invertible map T, these schemes combine (with weights) elements from the forward and backward Orbits through points sampled from a proposal distribution ρ. The map T does not leave the target π invariant, hence the name NEO, standing for Non-Equilibrium Orbits. NEO-IS provides unbiased estimators of the normalizing constant and self-normalized IS estimators of expectations under π while NEO-MCMC combines multiple NEO-IS estimates of the normalizing constant and an iterated sampling-importance resampling mechanism to sample from π. For T chosen as a discrete-time integrator of a conformal Hamiltonian system, NEO-IS achieves state-of-the art performance on difficult benchmarks and NEO-MCMC is able to explore highly multimodal targets. Additionally, we provide detailed theoretical results for both methods. In particular, we show that NEO-MCMC is uniformly geometrically ergodic and establish explicit mixing time estimates under mild conditions.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 19 of its 51 references that are in the map. First posted on arXiv 17 Mar 2021.

Builds on

19 of 51 references.

References · 19

  1. 2013Auto-Encoding Variational Bayescited by 3,980
  2. 2019Normalizing Flows for Probabilistic Modeling and Inferencecited by 1,315
  3. 2019An Introduction to Variational Autoencoderscited by 997
  4. 2015Importance Weighted Autoencoderscited by 454
  5. 2018Pyro: Deep Universal Probabilistic Programmingcited by 379
  6. 2020Stochastic Normalizing Flowscited by 156
  7. 2018Neural Importance Samplingcited by 154
  8. 2020Your GAN is Secretly an Energy-based Model and You Should use Discriminator Driven Latent Samplingcited by 71
  9. 2020Targeted free energy estimation via learned mappingscited by 66
  10. 2017Generalizing Hamiltonian Monte Carlo with Neural Networkscited by 52
  11. 2016On the Quantitative Analysis of Decoder-Based Generative Modelscited by 40
  12. 2018Metropolis-Hastings Generative Adversarial Networkscited by 40
7 more
  1. 2017Reinterpreting Importance-Weighted Autoencoderscited by 36
  2. 2019Conformal Symplectic and Relativistic Optimizationcited by 28
  3. 2019Energy-Inspired Models: Learning with Sampler-Induced Distributionscited by 12
  4. 2019Convergence rates for optimised adaptive importance samplerscited by 11
  5. 2019Learning Deep Generative Models with Annealed Importance Samplingcited by 8
  6. 2020Unbiased Gradient Estimation for Variational Auto-Encoders using Coupled Markov Chainscited by 7
  7. 2019Normalizing Constant Estimation with Gaussianized Bridge Samplingcited by 6

Built on by

Cited by year

Citing papers per year: 2022: 1.

1 paper.