paper-with-me

Papers

Wasserstein Gradient Flows for Batch Bayesian Optimal Experimental Design

2026-03-12 · Louis Sharrock arxiv

Bayesian optimal experimental design (BOED) provides a powerful, decision-theoretic framework for selecting experiments so as to maximise the expected utility of the data to be collected. In practice, however, its applicability can be limited by the difficulty of optimising the chosen utility. The expected information gain (EIG), for example, is often high-dimensional and strongly non-convex. This challenge is particularly acute in the batch setting, where multiple experiments are to be designed simultaneously. In this paper, we introduce a new approach to batch EIG-based BOED via a probabilistic lifting of the original optimisation problem to the space of probability measures. In particular, we propose to optimise an entropic regularisation of the expected utility over the space of design measures. Under mild conditions, we show that this objective admits a unique minimiser, which can be explicitly characterised in the form of a Gibbs distribution. The resulting design law can be used directly as a randomised batch-design policy, or as a computational relaxation from which a deterministic batch is extracted. To obtain scalable approximations when the batch size is large, we then consider two tractable restrictions of the full batch distribution: a mean-field family, and an i.i.d. product family. For the i.i.d. objective, and formally for its mean-field extension, we derive the corresponding Wasserstein gradient flow, characterise its long-time behaviour, and obtain particle-based algorithms via space-time discretisations. We also introduce doubly stochastic variants that combine interacting particle updates with Monte Carlo estimators of the EIG gradient. Finally, we illustrate the performance of the proposed methods in several numerical experiments, demonstrating their ability to explore multimodal optimisation landscapes and obtain high-utility batches in challenging examples.

📄 PDF Abstract BibTeX arXiv:2603.12102

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Accelerated Information Gradient flow

2019-09-04 · Yifei Wang, Wuchen Li

We present a framework for Nesterov's accelerated gradient flows in probability space to design efficient mean-field Markov chain Monte Carlo (MCMC) algorithms for Bayesian inverse problems. Here four examples of informa…

Bayesian Inference

Geometry-Aware Normalizing Wasserstein Flows for Optimal Causal Inference

2023-11-30 · Kaiwen Hou

This paper presents a groundbreaking approach to causal inference by integrating continuous normalizing flows (CNFs) with parametric submodels, enhancing their geometric sensitivity and improving upon traditional Targete…

Causal Inferenceparameter estimation

Learning with minibatch Wasserstein : asymptotic and gradient properties

2019-10-09 · Kilian Fatras, Younes Zine, Rémi Flamary, Rémi Gribonval 외

Optimal transport distances are powerful tools to compare probability distributions and have found many applications in machine learning. Yet their algorithmic complexity prevents their direct use on large scale datasets…

Wasserstein Gradient Flows for Scalable and Regularized Barycenter Computation

2025-10-06 · Eduardo Fernandes Montesuma, Yassir Bendou, Mike Gartrell arxiv

Wasserstein barycenters provide a principled approach for aggregating probability measures, while preserving the geometry of their ambient space. Existing discrete methods are not scalable as they assume access to the co…

Domain Adaptation

$L^2$ over Wasserstein: Statistical Analysis for Optimal Transport

2026-05-20 · Riccardo Passeggeri, Rohan M. Shenoy, Pengcheng Ye arxiv

Optimal transport provides an inherently geometric and highly structured framework for studying spaces of probability measures, supplying a rich theoretical toolkit for contemporary statistics, machine learning, and gene…