arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2402.14402cs.LGstat.ML
收藏

全局安全顺序学习通过高效知识迁移

Global Safe Sequential Learning via Efficient Knowledge Transfer

Technical University of Berlin(柏林工业大学);Bosch Center for Artificial Intelligence(博世人工智能中心);Robert Bosch GmbH(罗伯特·博世有限公司)

Cen-You Li, Olaf Duennbier, Marc Toussaint, Barbara Rakitsch, Christoph Zimmer

AI总结:

本文提出安全迁移顺序学习,利用源任务离线数据加速目标任务探索,扩大安全区域,并通过理论分析与高效近似实现低数据消耗下的全局安全探索。

摘要:

顺序学习方法(如主动学习和贝叶斯优化)旨在为任务学习选择最具信息量的数据。然而,在许多应用中,数据选择受到未知安全条件的约束,这推动了安全学习方法的发展。一类有前景的安全学习方法使用高斯过程对安全条件进行建模,将数据选择限制在安全置信度较高的区域。然而,这些方法仅限于围绕初始种子数据集的局部探索,因为安全置信度集中在已观测的数据点周围。因此,任务探索速度减慢,且与初始种子数据集不连通的的安全区域仍未被探索。在本文中,我们提出了安全迁移顺序学习,以加速任务学习并扩大可探索的安全区域。通过利用来自相关源任务的大量离线数据,我们的方法更有效地引导目标任务中的探索。我们还提供了理论分析,解释为何单任务方法无法应对不连通的区域。最后,我们引入了该方法的一种计算高效的近似,通过预计算减少运行时间。我们的实验表明,与最先进的方法相比,该方法以更低的数据消耗学习任务,并在多个不连通的安全区域中增强全局探索,同时保持相当的计算效率。

英文摘要:

Sequential learning methods, such as active learning and Bayesian optimization, aim to select the most informative data for task learning. In many applications, however, data selection is constrained by unknown safety conditions, motivating the development of safe learning approaches. A promising line of safe learning methods uses Gaussian processes to model safety conditions, restricting data selection to areas with high safety confidence. However, these methods are limited to local exploration around an initial seed dataset, as safety confidence centers around observed data points. As a consequence, task exploration is slowed down and safe regions disconnected from the initial seed dataset remain unexplored. In this paper, we propose safe transfer sequential learning to accelerate task learning and to expand the explorable safe region. By leveraging abundant offline data from a related source task, our approach guides exploration in the target task more effectively. We also provide a theoretical analysis to explain why single-task method cannot cope with disconnected regions. Finally, we introduce a computationally efficient approximation of our method that reduces runtime through pre-computations. Our experiments demonstrate that this approach, compared to state-of-the-art methods, learns tasks with lower data consumption and enhances global exploration across multiple disjoint safe regions, while maintaining comparable computational efficiency.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑