Optimization of Annealed Importance Sampling Hyperparameters
Not on the map. Why?
Abstract (arXiv)
Annealed Importance Sampling (AIS) is a popular algorithm used to estimates the intractable marginal likelihood of deep generative models. Although AIS is guaranteed to provide unbiased estimate for any set of hyperparameters, the common implementations rely on simple heuristics such as the geometric average bridging distributions between initial and the target distribution which affect the estimation performance when the computation budget is limited. In order to reduce the number of sampling iterations, we present a parameteric AIS process with flexible intermediary distributions defined by a residual density with respect to the geometric mean path. Our method allows parameter sharing between annealing distributions, the use of fix linear schedule for discretization and amortization of hyperparameter selection in latent variable models. We assess the performance of Optimized-Path AIS for marginal likelihood estimation of deep generative models and compare it to compare it to more computationally intensive AIS.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 35 of its 52 references that are in the map. First posted on arXiv 27 Sep 2022.
Builds on
35 of 52 references.
References · 35
- 2014Adam: A Method for Stochastic Optimizationcited by 37,240
- 2022Generative Adversarial Networkscited by 5,627
- 2013Auto-Encoding Variational Bayescited by 4,053
- 2016Improved Techniques for Training GANscited by 2,970
- 2015Variational Inference with Normalizing Flowscited by 2,170
- 2016Variational Inference: A Review for Statisticianscited by 1,472
- 2016Improving Variational Inference with Inverse Autoregressive Flowcited by 640
- 2015Importance Weighted Autoencoderscited by 456
- 2018Assessing Generative Models via Precision and Recallcited by 406
- 2016Adversarial Feature Learningcited by 350
- 2013Black Box Variational Inferencecited by 319
- 2015A note on the evaluation of generative modelscited by 292
23 more
- 2020Stochastic Normalizing Flowscited by 157
- 2017Variational Sequential Monte Carlocited by 95
- 2017Filtering Variational Objectivescited by 91
- 2021Annealed Flow Transport Monte Carlocited by 90
- 2016Variational inference for Monte Carlo objectivescited by 84
- 2017Auto-Encoding Sequential Monte Carlocited by 65
- 2018Importance Weighting and Variational Inferencecited by 55
- 2018Hamiltonian Variational Auto-Encodercited by 41
- 2016On the Quantitative Analysis of Decoder-Based Generative Modelscited by 40
- 2021MCMC Variational Inference via Uncorrected Hamiltonian Annealingcited by 39
- 2021Monte Carlo Variational Auto-Encoderscited by 36
- 2021Differentiable Annealed Importance Sampling and the Perils of Gradient Noisecited by 36
- 2015Neural Adaptive Sequential Monte Carlocited by 34
- 2016Reparameterization Gradients through Acceptance-Rejection Sampling Algorithmscited by 22
- 2015Sandwiching the marginal likelihood using bidirectional Monte Carlocited by 20
- 2015Nested Sequential Monte Carlo Methodscited by 19
- 2016Variational Inference with Hamiltonian Monte Carlocited by 17
- 2020Evaluating Lossy Compression Rates of Deep Generative Modelscited by 16
- 2021q-Paths: Generalizing the Geometric Annealing Path using Power Meanscited by 12
- 2016Measuring the reliability of MCMC inference with bidirectional Monte Carlocited by 8
- 2020MetFlow: A New Efficient Method for Bridging the Gap between Markov Chain Monte Carlo and Variational Inferencecited by 7
- 2015Variational Optimization of Annealing Schedulescited by 5
- 2013Towards Automatic Model Comparison: An Adaptive Sequential Monte Carlo Approachcited by 2
Built on by
Citing papers per year: 2023: 1.
1 paper.