A semi-amortized method is introduced that divides parameters into smaller blocks, and uses conditional independence to identify the information needed to infer each block, and trains neural estimators for blocks whose posterior updates are computationally expensive or frequently repeated.
Abstract
Amortized Bayesian inference uses simulations to perform Bayesian estimation when likelihoods are expensive or analytically unavailable. However, learning the full joint posterior is challenging in high-dimensional models with complex dependencies. We introduce a semi-amortized method that divides parameters into smaller blocks, and uses conditional independence to identify the information needed to infer each block. We train neural estimators for blocks whose posterior updates are computationally expensive or frequently repeated. Each estimator learns from simulations of the relevant model components to approximate the block's full conditional posterior, given the relevant observations and the values of the variables on which it depends. A Markov chain then alternates direct draws from these estimators with conventional updates of the remaining variables. Each neural update uses the current conditioning values and requires neither likelihood evaluation nor an acceptance-rejection step. Where the same conditional structure recurs, one estimator can be reused across blocks and datasets, with an output dimension determined by the block rather than the full model. We illustrate the approach in high-dimensional and computationally expensive hierarchical and spatiotemporal models.
A sequential procedure to estimate the posterior is developed, incorporating an importance sampling step that introduces a locally amortized likelihood-to-evidence ratio estimator, which provides a graphical diagnostic of calibration over neighborhoods that are deliberately broader than the available posterior.
A new family of subsampled pseudo-posteriors is developed that replaces the full-data pseudo-posterior with an aggregate of mini-batch pseudo-posteriors and establishes finite-sample total variation bounds to the full-data pseudo-posterior, allowing discontinuous and intractable moment functions.
Sampling from the posterior is the central task of computational Bayesian inverse problems. The standard workhorse in Bayesian inference---Markov chain Monte Carlo (MCMC)---is sequential, yields correlated samples, and must be rerun for each new observation. Conditional flow matching offers an amortized alternative: a...
Jan Blechschmidt, O. Ernst, Moritz Poguntke et al.· 0 citations
Simulation-based inference (SBI) enables Bayesian inference when a simulator is available but the likelihood is intractable. Modern SBI methods train neural networks on simulated data to obtain an amortized approximation of the posterior, making inference for new observations fast. A central challenge in SBI is to extr...
Hierarchical data is ubiquitous in the empirical sciences and most commonly analyzed with generalized linear mixed-effects models (GLMMs), which have interpretable parameters. Bayesian inference for GLMMs yields calibrated uncertainty estimates but requires Markov Chain Monte Carlo (MCMC); the gold-standard No-U-Turn S...
Alex Kipnis, Marcel Binz, Eric Schulz· 0 citations
Martingale posteriors and related predictive resampling methods replace the likelihood--prior pair used within Bayesian inference with a predictive model for future observations. These methods are simple to implement and increasingly popular due to their computational efficiency, but little is known about their ability...
Hui Wang, Edwin Fong, David T. Frazier· 0 citations
Learn how Google DeepMind and GovTech Singapore uses lightweight on-device Gemma models to intercept conversational scams in private chats with zero cloud data egress.