Subspace accelerated measure transport methods for fast and scalable sequential experimental design, with application to photoacoustic imaging
Tiangang Cui, Karina Koval, Roland Herzog, Robert Scheichl
TL;DR
This work addresses sequential Bayesian experimental design for expensive, high-dimensional inverse problems by deriving a derivative-based upper bound on the incremental information gain (iEIG) and using likelihood-informed subspaces to reduce parameter dimensionality. It integrates Knothe–Rosenblatt measure transport with tensor-train density representations and a restart strategy to enable scalable, amortized inference via conditional transport maps, allowing real-time posterior updates. The approach is demonstrated on PDE-based problems (diffusivity field and photoacoustic imaging), showing that designs maximizing the iEIG upper bound yield accurate posteriors with substantial computational savings compared to nested Monte Carlo and Gaussian-based methods. The framework provides a principled, scalable path for fast, high-fidelity sOED in large- and infinite-dimensional settings, with practical impact for imaging and sensing applications.
Abstract
We propose a novel approach for sequential optimal experimental design (sOED) for Bayesian inverse problems involving expensive models with large-dimensional unknown parameters. The focus of this work is on designs that maximize the expected information gain (EIG) from prior to posterior, which is a computationally challenging task in the non-Gaussian setting. This challenge is amplified in sOED, as the incremental expected information gain (iEIG) must be approximated multiple times in distinct stages, with both prior and posterior distributions often being intractable. To address this, we derive a derivative-based upper bound for the iEIG, which not only guides design placement but also enables the construction of projectors onto likelihood-informed subspaces, facilitating parameter dimension reduction. By combining this approach with conditional measure transport maps for the sequence of posteriors, we develop a unified framework for sOED, together with amortized inference, scalable to high- and infinite-dimensional problems. Numerical experiments for two inverse problems governed by partial differential equations (PDEs) demonstrate the effectiveness of designs that maximize our proposed upper bound.
