Sequential Entropic Optimal Transport for Bayesian Inverse Problems via Multilevel Monte Carlo
Abstract
We consider the problem of Bayesian estimation associated to inverse problems governed by partial differential equations (PDEs). In most cases of practical interest, one must use numerical solvers to implement computational methods based on Monte Carlo methods. This inevitably leads to an adaptation of multilevel Monte Carlo (MLMC) methods to reduce computational efforts to achieve a pre-specified mean square error (MSE). MLMC is based on sampling coupled versions of Bayesian posteriors associated to increasingly precise numerical solves of the PDE. In this article we present a novel method to implement MLMC based upon sequential entropic optimal transport couplings learned with light Schrödinger bridges, and correct the transport with Metropolis--Hastings steps that preserve the pairing. We bound the mean square error associated to a version of our new estimation method and show, for an elliptic inverse problem, that to achieve a MSE of 𝒪(δ2) (δ>0) one can have an optimal cost of 𝒪(δ−2). The results feature explicit bounds on the effect of the fitted transport and of the Metropolis--Hastings correction. From a numerical perspective, on elliptic, Darcy-flow and Navier-Stokes problems, the method reduces the variance of the most precise solver by a factor of five to ten and is faster than multilevel sequential Monte Carlo [arXiv:1503.07259] at tight accuracies.
Related
- On Sequential Entropic Optimal Transport Filter and its Multilevel Variants
- First-order Γ-expansion for entropic optimal transport with non-degenerate costs
- Amortized Bayesian Inference on Multilevel Models of Arbitrary Structure
- On the Linear Convergence of SISTA for Entropic Martingale Optimal Transport
- Low-Budget Active Learning through Entropic Optimal Transport
BibTeX
@misc{beh2026sequential,
title = {{Sequential Entropic Optimal Transport for Bayesian Inverse Problems via Multilevel Monte Carlo}},
author = {Jason Beh and Pierre Del Moral and Ajay Jasra},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.29546},
eprint = {2610.29546},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.29546},
}
RIS
TY - UNPB
TI - Sequential Entropic Optimal Transport for Bayesian Inverse Problems via Multilevel Monte Carlo
AU - Jason Beh
AU - Pierre Del Moral
AU - Ajay Jasra
PY - 2026
DA - 2026/10/21
PB - arXiv
DO - 10.48550/arxiv.2610.29546
UR - https://arxiv.org/abs/2610.29546
AB - We consider the problem of Bayesian estimation associated to inverse problems governed by partial differential equations (PDEs). In most cases of practical interest, one must use numerical solvers to implement computational methods based on Monte Carlo methods. This inevitably leads to an adaptation of multilevel Monte Carlo (MLMC) methods to reduce computational efforts to achieve a pre-specified mean square error (MSE). MLMC is based on sampling coupled versions of Bayesian posteriors associated to increasingly precise numerical solves of the PDE. In this article we present a novel method to implement MLMC based upon sequential entropic optimal transport couplings learned with light Schrödinger bridges, and correct the transport with Metropolis--Hastings steps that preserve the pairing. We bound the mean square error associated to a version of our new estimation method and show, for an elliptic inverse problem, that to achieve a MSE of 𝒪(δ^2) (δ>0) one can have an optimal cost of 𝒪(δ^−2). The results feature explicit bounds on the effect of the fitted transport and of the Metropolis--Hastings correction. From a numerical perspective, on elliptic, Darcy-flow and Navier-Stokes problems, the method reduces the variance of the most precise solver by a factor of five to ten and is faster than multilevel sequential Monte Carlo [arXiv:1503.07259] at tight accuracies.
ER -