Sequential Neural Methods for Likelihood-free Inference
Conor Durkan, George Papamakarios, Iain Murray · arXiv (Cornell University) · 2018
Likelihood-free inference refers to inference when a likelihood function cannot be explicitly evaluated, which is often the case for models based on simulators. Most of the literature is based on sample-based `Approximate Bayesian Computation' methods, but recent work suggests that approaches based on deep neural conditional density estimators can obtain state-of-the-art results with fewer simulations. The neural approaches vary in how they choose which simulations to run and what they learn: an approximate posterior or a surrogate likelihood. This work provides some direct controlled comparisons between these choices.
Cited by 6 works. doi:10.48550/arxiv.1811.08723 Open-access PDF
Authors
References
- Adam: A Method for Stochastic Optimization
- WaveNet: A Generative Model for Raw Audio
- Keeping the neural networks simple by minimizing the description length of the weights
- Algorithm 778: L-BFGS-B
- Pixel Recurrent Neural Networks
- MADE: Masked Autoencoder for Distribution Estimation
- Fast $ε$-free Inference of Simulation Models with Bayesian Conditional Density Estimation
- Flexible statistical inference for mechanistic models of neural dynamics
- Reliable Uncertainty Estimates in Deep Neural Networks using Noise Contrastive Priors
- Sequential Neural Likelihood: Fast Likelihood-free Inference with Autoregressive Flows