Constrained Bayesian Experimental Design via Online Planning
摘要
Bayesian experimental design (BED) is a principled framework for data-efficient design of sequential experiments. However, existing BED methods are unable to adapt to dynamic constraints inherent in real-world tasks due to budget limitations, varying costs, or physical constraints that restrict how designs evolve over time. In this paper, we introduce a novel approach to BED that enables constrained optimization of experimental designs by combining offline pre-training of an amortized policy and a posterior network with online multi-step lookahead planning using scenario trees. We empirically demonstrate that our method yields substantially more informative design sequences than existing methods across a range of constrained BED tasks, while incurring only a modest additional computational overhead.
引用
@article{arxiv.2605.26990,
title = {Constrained Bayesian Experimental Design via Online Planning},
author = {Yujia Guo and Daolang Huang and Xinyu Zhang and Sammie Katt and Samuel Kaski and Ayush Bharti},
journal= {arXiv preprint arXiv:2605.26990},
year = {2026}
}
备注
24 pages, 9 figures. Accepted at the Forty-Third International Conference on Machine Learning (ICML 2026)