Batch-based Bayesian optimal experimental design in linear inverse problems

Abstract Experimental design is central to science and engineering. A ubiquitous challenge is how to maximize the value of information obtained from expensive or constrained experimental settings. Bayesian optimal experimental design (OED) provides a principled framework for addressing such questions. In this paper, we study experimental design problems such as the optimization of sensor locations over a continuous domain in the context of linear Bayesian inverse problems. We focus in particular on batch design, that is, the simultaneous optimization of multiple design variables, which leads to a notoriously difficult non-convex optimization problem. We tackle this challenge using a promising strategy recently proposed in the frequentist setting, which relaxes A-optimal design to the space of finite positive measures. Our main contribution is the rigorous identification of the Bayesian inference problem corresponding to this relaxed A-optimal OED formulation. Moreover, building on recent work, we develop a Wasserstein gradient-flow–based optimization algorithm for the expected utility and introduce novel regularization schemes that empirically accelerate convergence to a discrete measure. These theoretical results are supported by numerical experiments demonstrating both convergence and the effectiveness of the proposed regularization strategy.

Authors

Institutions

Publication Details

Journal
Statistics and Computing
Published
2026-11-11
DOI
https://doi.org/10.1007/s11222-026-11022-4
Citations
1
Primary Topic
Optimal Experimental Design Methods
Type
article
Field-Weighted Citation Impact
3.19

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

Batch-based Bayesian optimal experimental design in linear inverse problems

Tapio Helin, Andrew B. Duncan, Sofia Mäkinen
1 citations
Statistics and Computing
Optimal Experimental Design Methods
3.19
article

Batch-based Bayesian optimal experimental design in linear inverse problems

Tapio Helin, Andrew B. Duncan, Sofia Mäkinen
article en
1 citations

Abstract

Abstract Experimental design is central to science and engineering. A ubiquitous challenge is how to maximize the value of information obtained from expensive or constrained experimental settings. Bayesian optimal experimental design (OED) provides a principled framework for addressing such questions. In this paper, we study experimental design problems such as the optimization of sensor locations over a continuous domain in the context of linear Bayesian inverse problems. We focus in particular on batch design, that is, the simultaneous optimization of multiple design variables, which leads to a notoriously difficult non-convex optimization problem. We tackle this challenge using a promising strategy recently proposed in the frequentist setting, which relaxes A-optimal design to the space of finite positive measures. Our main contribution is the rigorous identification of the Bayesian inference problem corresponding to this relaxed A-optimal OED formulation. Moreover, building on recent work, we develop a Wasserstein gradient-flow–based optimization algorithm for the expected utility and introduce novel regularization schemes that empirically accelerate convergence to a discrete measure. These theoretical results are supported by numerical experiments demonstrating both convergence and the effectiveness of the proposed regularization strategy.

Statistics and ComputingVol. 36(6)
Imperial College London (GB), Lappeenranta-Lahti University of Technology (FI)
Emil Aaltosen Säätiö
Openalex Percentile: Top 14%
Optimal Experimental Design Methods
3.19
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon