用蒙特卡洛方法高效估算贝叶斯实验设计中的信息增益。
Approximation of differential entropy in Bayesian optimal experimental design
- 用随机采样近似证据密度,避免重复计算似然。
- 理论证明收敛速度优于或相当主流方法。
- 适合大规模反问题等计算开销大的场景。
贝叶斯最优实验设计为选择能最大化信息量的实验设置提供了严谨框架。本文聚焦于当似然的微分熵与实验设计无关或可显式计算的情形,将问题简化为最大熵估计,从而缓解了期望信息增益计算中的多重挑战。研究动机来自大规模推断问题(如反问题),其计算成本主要由昂贵的似然评估主导。我们提出一种计算方法:用蒙特卡洛或准蒙特卡洛代理模型近似证据密度,同时利用标准方法评估微分熵,无需额外似然计算。理论上证明该策略在熵评估成本可忽略时,收敛速度与现有最优方法相当甚至更优。该方法仅需前向映射的较弱光滑性假设,避免了早期工作所需的强技术条件。数值实验验证了理论结果。
原文摘要 · Abstract (English)
Bayesian optimal experimental design provides a principled framework for selecting experimental settings that maximize obtained information. In this work, we focus on estimating the expected information gain in the setting where the differential entropy of the likelihood is either independent of the design or can be evaluated explicitly. This reduces the problem to maximum entropy estimation, alleviating several challenges inherent in expected information gain computation. Our study is motivated by large-scale inference problems, such as inverse problems, where the computational cost is dominated by expensive likelihood evaluations. We propose a computational approach in which the evidence density is approximated by a Monte Carlo or quasi-Monte Carlo surrogate, while the differential entropy is evaluated using standard methods without additional likelihood evaluations. We prove that this strategy achieves convergence rates that are comparable to, or better than, state-of-the-art methods for full expected information gain estimation, particularly when the cost of entropy evaluation is negligible. Moreover, our approach relies only on mild smoothness of the forward map and avoids stronger technical assumptions required in earlier work. We also present numerical experiments, which confirm our theoretical findings.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。