mlsanityData to 7 Oct 2026

Generative Bayesian Inference with GANs

arXiv 2208.12113 ↗First posted 25 Aug 2022stat.ME stat.CO stat.MLcited by 5

Not on the map. Why?

Abstract (arXiv)

In the absence of explicit or tractable likelihoods, Bayesians often resort to approximate Bayesian computation (ABC) for inference. Our work bridges ABC with deep neural implicit samplers based on generative adversarial networks (GANs) and adversarial variational Bayes. Both ABC and GANs compare aspects of observed and fake data to simulate from posteriors and likelihoods, respectively. We develop a Bayesian GAN (B-GAN) sampler that directly targets the posterior by solving an adversarial optimization problem. B-GAN is driven by a deterministic mapping learned on the ABC reference by conditional GANs. Once the mapping has been trained, iid posterior samples are obtained by filtering noise at a negligible additional cost. We propose two post-processing local refinements using (1) data-driven proposals with importance reweighting, and (2) variational Bayes. We support our findings with frequentist-Bayesian results, showing that the typical total variation distance between the true and approximate posteriors converges to zero for certain neural network generators and discriminators. Our findings on simulated data show highly competitive performance relative to some of the most recent likelihood-free posterior simulators.

Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). Builds on 27 of its 65 references that are in the map. First posted on arXiv 25 Aug 2022.

Builds on

27 of 65 references.

References · 27

  1. 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,277
  2. 2017Improved Training of Wasserstein GANscited by 2,223
  3. 2014Conditional Generative Adversarial Netscited by 2,152
  4. 2019Normalizing Flows for Probabilistic Modeling and Inferencecited by 1,315
  5. 2017Spectrally-normalized margin bounds for neural networkscited by 681
  6. 2017Towards Principled Methods for Training Generative Adversarial Networkscited by 460
  7. 2017Nonparametric regression using deep neural networks with ReLU activation functioncited by 431
  8. 2018Sequential Neural Likelihood: Fast Likelihood-free Inference with Autoregressive Flowscited by 217
  9. 2017Flexible statistical inference for mechanistic models of neural dynamicscited by 162
  10. 2017Adversarial Variational Bayes: Unifying Variational Autoencoders and Generative Adversarial Networkscited by 107
  11. 2020On Contrastive Learning for Likelihood-free Inferencecited by 96
  12. 2015Approximating Likelihood Ratios with Calibrated Discriminative Classifierscited by 87
15 more
  1. 2018How Well Generative Adversarial Networks Learn Distributionscited by 78
  2. 2015Bayesian Optimization for Likelihood-Free Inference of Simulator-Based Statistical Modelscited by 61
  3. 2018Likelihood-free inference with emulator networkscited by 61
  4. 2020Conditional Sampling with Monotone GANs: from Generative Models to Likelihood-Free Inferencecited by 40
  5. 2017Variational Inference using Implicit Distributionscited by 39
  6. 2022GATSBI: Generative Adversarial Training for Simulation-Based Inferencecited by 36
  7. 2019Approximate Bayesian computation with the Wasserstein distancecited by 34
  8. 2018Unbiased Implicit Variational Inferencecited by 33
  9. 2019Using Wasserstein Generative Adversarial Networks for the Design of Monte Carlo Simulationscited by 32
  10. 2017Bayesian GANcited by 31
  11. 2017Efficient acquisition rules for model-based approximate Bayesian computationcited by 16
  12. 2018Robust Bayesian Synthetic Likelihood via a Semi-Parametric Approachcited by 6
  13. 2019Batch simulations and uncertainty quantification in Gaussian process surrogate approximate Bayesian computationcited by 5
  14. 2016An Extended Empirical Saddlepoint Approximation for Intractable Likelihoodscited by 3
  15. 2021Approximate Bayesian Computation via Classificationcited by 2

Built on by

Cited by year

Citing papers per year: 2024: 4; 2025: 1.

5 papers.