Efficient, Multimodal, and Derivative-Free Bayesian Inference With Fisher-Rao Gradient Flows
Yifan Chen, Daniel Zhengyu Huang, Jiaoyang Huang, Sebastian Reich, Andrew M. Stuart
TL;DR
This work addresses Bayesian inverse problems where the forward model is expensive, gradients may be unavailable, and the posterior is potentially multimodal. It develops GMKI, a derivative-free sampler that combines Fisher-Rao gradient flows, Gaussian mixture approximations, and Kalman-type updates, achieved via an operator-splitting time discretization into exploration and exploitation steps. Theoretical results establish exponential convergence in the continuous-time limit, affine invariance, and exploration-inspired dynamics, while numerical experiments demonstrate GMKI’s ability to recover multiple modes efficiently in 1D, 2D, and a high-dimensional Navier–Stokes initial-condition problem. The approach offers a practical, scalable framework for fast posterior approximation in challenging inverse problems where forward evaluations are costly and gradient information is unavailable. Overall, GMKI provides a principled, efficient, and scalable derivative-free method for multimodal Bayesian inference with broad applicability in science and engineering.
Abstract
In this paper, we study efficient approximate sampling for probability distributions known up to normalization constants. We specifically focus on a problem class arising in Bayesian inference for large-scale inverse problems in science and engineering applications. The computational challenges we address with the proposed methodology are: (i) the need for repeated evaluations of expensive forward models; (ii) the potential existence of multiple modes; and (iii) the fact that gradient of, or adjoint solver for, the forward model might not be feasible. While existing Bayesian inference methods meet some of these challenges individually, we propose a framework that tackles all three systematically. Our approach builds upon the Fisher-Rao gradient flow in probability space, yielding a dynamical system for probability densities that converges towards the target distribution at a uniform exponential rate. This rapid convergence is advantageous for the computational burden outlined in (i). We apply Gaussian mixture approximations with operator splitting techniques to simulate the flow numerically; the resulting approximation can capture multiple modes thus addressing (ii). Furthermore, we employ the Kalman methodology to facilitate a derivative-free update of these Gaussian components and their respective weights, addressing the issue in (iii). The proposed methodology results in an efficient derivative-free sampler flexible enough to handle multi-modal distributions: Gaussian Mixture Kalman Inversion (GMKI). The effectiveness of GMKI is demonstrated both theoretically and numerically in several experiments with multimodal target distributions, including proof-of-concept and two-dimensional examples, as well as a large-scale application: recovering the Navier-Stokes initial condition from solution data at positive times.
