The reviewed record of science sign in
Pith

arxiv: 2203.06481 · v1 · pith:U2NENF3D · submitted 2022-03-12 · stat.ML · cs.LG· stat.ME

GATSBI: Generative Adversarial Training for Simulation-Based Inference

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:U2NENF3Drecord.jsonopen to challenge →

classification stat.ML cs.LGstat.ME
keywords gatsbiinferenceposterioradversarialhigh-dimensionalgansimplicitsimulation-based
0
0 comments X
read the original abstract

Simulation-based inference (SBI) refers to statistical inference on stochastic models for which we can generate samples, but not compute likelihoods. Like SBI algorithms, generative adversarial networks (GANs) do not require explicit likelihoods. We study the relationship between SBI and GANs, and introduce GATSBI, an adversarial approach to SBI. GATSBI reformulates the variational objective in an adversarial setting to learn implicit posterior distributions. Inference with GATSBI is amortised across observations, works in high-dimensional posterior spaces and supports implicit priors. We evaluate GATSBI on two SBI benchmark problems and on two high-dimensional simulators. On a model for wave propagation on the surface of a shallow water body, we show that GATSBI can return well-calibrated posterior estimates even in high dimensions. On a model of camera optics, it infers a high-dimensional posterior given an implicit prior, and performs better than a state-of-the-art SBI approach. We also show how GATSBI can be extended to perform sequential posterior estimation to focus on individual observations. Overall, GATSBI opens up opportunities for leveraging advances in GANs to perform Bayesian inference on high-dimensional simulation-based models.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Promptbreeder: Self-Referential Self-Improvement Via Prompt Evolution

    cs.CL 2023-09 unverdicted novelty 8.0

    Promptbreeder evolves both task prompts and the mutation prompts that improve them using LLMs, outperforming Chain-of-Thought and Plan-and-Solve on arithmetic and commonsense reasoning benchmarks.

  2. Fast and Robust Simulation-Based Inference With Optimization Monte Carlo

    cs.LG 2025-11 conditional novelty 6.0

    Optimization Monte Carlo reformulates stochastic simulator inference as gradient-based deterministic optimization for faster, accurate posterior estimation in high-dimensional or challenging settings.