论文标题

批次多保真学习和预算限制

Batch Multi-Fidelity Active Learning with Budget Constraints

论文作者

Li, Shibo, Phillips, Jeff M., Yu, Xin, Kirby, Robert M., Zhe, Shandian

论文摘要

在许多应用中,例如物理模拟和工程设计,具有高维输出的学习功能至关重要。但是,为这些应用收集培训示例通常是昂贵的,例如通过运行数值求解器。最近的工作(Li等人,2022年)提出了第一种高维产出的多保真活跃学习方法,该方法可以以不同的保真度获得示例,以降低成本,同时提高学习绩效。但是,该方法一次只能以一对忠诚度和输入查询,因此有可能引入强相关示例以降低学习效率的风险。在本文中,我们建议使用预算限制(BMFAL-BC)进行批处理多保真学习,该学习可以促进培训示例的多样性以提高福利成本比率,同时尊重给定的预​​算限制对批次查询。因此,我们的方法实际上可能更有用。具体而言,我们提出了一种新颖的批次采集函数,该功能可以衡量一批多保真查询与目标函数之间的相互信息,以惩罚高度相关的查询并鼓励多样性。批处理采集功能的优化是具有挑战性的,因为它涉及对许多保真度的组合搜索,同时受到预算限制。为了应对这一挑战,我们开发了一种加权贪婪算法,该算法可以依次识别每个(保真,输入)对,同时达到接近$(1-1/e)$ - 最佳的近似值。我们在几种计算物理和工程应用中展示了我们的方法的优势。

Learning functions with high-dimensional outputs is critical in many applications, such as physical simulation and engineering design. However, collecting training examples for these applications is often costly, e.g. by running numerical solvers. The recent work (Li et al., 2022) proposes the first multi-fidelity active learning approach for high-dimensional outputs, which can acquire examples at different fidelities to reduce the cost while improving the learning performance. However, this method only queries at one pair of fidelity and input at a time, and hence has a risk to bring in strongly correlated examples to reduce the learning efficiency. In this paper, we propose Batch Multi-Fidelity Active Learning with Budget Constraints (BMFAL-BC), which can promote the diversity of training examples to improve the benefit-cost ratio, while respecting a given budget constraint for batch queries. Hence, our method can be more practically useful. Specifically, we propose a novel batch acquisition function that measures the mutual information between a batch of multi-fidelity queries and the target function, so as to penalize highly correlated queries and encourages diversity. The optimization of the batch acquisition function is challenging in that it involves a combinatorial search over many fidelities while subject to the budget constraint. To address this challenge, we develop a weighted greedy algorithm that can sequentially identify each (fidelity, input) pair, while achieving a near $(1 - 1/e)$-approximation of the optimum. We show the advantage of our method in several computational physics and engineering applications.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源