Semi-Empirical Objective Functions for MCMC Proposal Optimization
Not on the map. Why?
Abstract (arXiv)
Current objective functions used for training neural MCMC proposal distributions implicitly rely on architectural restrictions to yield sensible optimization results, which hampers the development of highly expressive neural MCMC proposal architectures. In this work, we introduce and demonstrate a semi-empirical procedure for determining approximate objective functions suitable for optimizing arbitrarily parameterized proposal distributions in MCMC methods. Our proposed Ab Initio objective functions consist of the weighted combination of functions following constraints on their global optima and transformation invariances that we argue should be upheld by general measures of MCMC efficiency for use in proposal optimization. Our experimental results demonstrate that Ab Initio objective functions maintain favorable performance and preferable optimization behavior compared to existing objective functions for neural MCMC optimization. We find that Ab Initio objective functions are sufficiently robust to enable the confident optimization of neural proposal distributions parameterized by deep generative networks extending beyond the regimes of traditional MCMC schemes
Key facts. Cited by 1 paper in the map (data through 13 Oct 2026). Builds on 15 of its 44 references that are in the map. First posted on arXiv 3 Jun 2021.
Builds on
15 of 44 references.
References · 15
- 2014Adam: A Method for Stochastic Optimizationcited by 37,093
- 2015Variational Inference with Normalizing Flowscited by 2,163
- 2019Normalizing Flows for Probabilistic Modeling and Inferencecited by 1,317
- 2014NICE: Non-linear Independent Components Estimationcited by 1,054
- 2019Learning Likelihoods with Conditional Normalizing Flowscited by 171
- 2019NeuTra-lizing Bad Geometry in Hamiltonian Monte Carlo Using Neural Transportcited by 74
- 2017Generalizing Hamiltonian Monte Carlo with Neural Networkscited by 52
- 2017A-NICE-MC: Adversarial Training for MCMCcited by 36
- 2019Gradient-based Adaptive Markov Chain Monte Carlocited by 14
- 2020A Neural Network MCMC sampler that maximizes Proposal Entropycited by 12
- 2019Introducing an Explicit Symplectic Integration Scheme for Riemannian Manifold Hamiltonian Monte Carlocited by 10
- 2013Variational MCMCcited by 7
3 more
- 2018Metropolis-Hastings view on variational inference and adversarial trainingcited by 6
- 2013Kernel Adaptive Metropolis-Hastingscited by 4
- 2020Deep Involutive Generative Models for Neural MCMCcited by 4
Built on by
Citing papers per year: 2021: 1.
1 paper.
- 2021Entropy-based adaptive Hamiltonian Monte Carlocited by 5
- 2021Entropy-based adaptive Hamiltonian Monte Carlo27 Oct 2021