Bayesian Experimental Design via Score Matching

arXiv:2607.08335 · stat.ML, cs.LG · Submitted 2026-07-09 · Read on arXiv

Angus Phillips, Gavin Kerrigan, Tom Rainforth

stat.ML, cs.LG

Submitted: 2026-07-09

Comments: Accepted for the 42nd Conference on Uncertainty in Artificial Intelligence (UAI 2026)

Code: https://github.com/angusphillips/Score_Matching_BED

License: http://creativecommons.org/licenses/by/4.0/

The gist: Policy-based approaches to Bayesian experimental design (BED) allow the learning of deep policy networks that adaptively make intelligent design decisions based on previously collected data.

Terminology

Abstract

Policy-based approaches to Bayesian experimental design (BED) allow the learning of deep policy networks that adaptively make intelligent design decisions based on previously collected data. However, the training of such policies is often held back by a fundamental challenge: the double intractability of the expected information gain (EIG). This necessitates expensive or complex approximations that restrict the effort one can invest in optimising the policy itself. To address this, we show that the double intractability of the EIG can be isolated from the policy learning by first solving a score matching problem that is independent of the policy used, then using the learned score approximation to train the policy in a singly intractable manner. This turns the key multiplicative cost into an additive one and reduces the computational burden on the policy training itself, making it far cheaper to train the policy multiple times when needed, e.g. for architecture search, hyperparameter tuning, or avoiding local optima. In our experiments we train multiple competitive policies without inducing a multiplicative cost in likelihood evaluations, which can increase performance by allowing us to select the best policy even without performing hyperparameter or architecture searches.

Sources

Related papers