arXivDaily arXiv每日学术速递 周一至周五更新
北美退伍军人节(Veterans Day),12 日无更新
arXiv 2407.16611cs.LGcs.AI
收藏

局部与全局持续学习

Local vs Global continual learning

ETH AI Center(ETH AI中心);ETH Zurich(苏黎世联邦理工学院);University of Zurich(苏黎世大学);Institute of Neuroinformatics - University of Zurich and ETH Zurich(苏黎世大学与苏黎世联邦理工学院神经信息学研究所)

Giulia Lanzillotta, Sidak Pal Singh, Benjamin F. Grewe, Thomas Hofmann

AI总结:

本文从多任务损失近似视角比较局部与全局策略,对现有持续学习算法进行分类评估,并研究了局部多项式近似下的最优目标及实现示例。

摘要:

持续学习是在模型中整合新信息同时保留过去知识的问题。尽管近年来取得了切实改进,该问题仍未解决。理解现有算法成败背后的机制有助于开发新策略。本文从多任务损失近似视角看待持续学习,比较局部和全局近似两种策略。基于所用近似对现有算法分类,并评估这种区分在常见设置中的实际影响。此外,研究局部多项式近似情况下的最优持续学习目标,并提供现有算法实现这些最优目标的示例。

英文摘要:

Continual learning is the problem of integrating new information in a model while retaining the knowledge acquired in the past. Despite the tangible improvements achieved in recent years, the problem of continual learning is still an open one. A better understanding of the mechanisms behind the successes and failures of existing continual learning algorithms can unlock the development of new successful strategies. In this work, we view continual learning from the perspective of the multi-task loss approximation, and we compare two alternative strategies, namely local and global approximations. We classify existing continual learning algorithms based on the approximation used, and we assess the practical effects of this distinction in common continual learning settings.Additionally, we study optimal continual learning objectives in the case of local polynomial approximations and we provide examples of existing algorithms implementing the optimal objectives

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

↑