arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1902.08438cs.LGcs.AIstat.ML
收藏

在线元学习

Online Meta-Learning

University of California, Berkeley(加州大学伯克利分校);University of Washington(华盛顿大学)

Chelsea Finn, Aravind Rajeswaran, Sham Kakade, Sergey Levine

摘要:

智能系统的一个核心能力是能够不断地建立在以前的经验,以加快和加强对新任务的学习。两种不同的研究范式研究了这个问题。元学习将此问题视为学习模型参数的先验,该模型参数适合于对新任务的快速适应,但通常假设任务集作为一批一起可用。相比之下,在线(基于后悔)学习考虑了一个连续的设置,其中问题一个接一个地被揭示,但传统上训练只有一个单一的模型,没有任何特定于任务的适应。这项工作介绍了一个在线元学习设置,它合并了上述两种范式的想法,以更好地捕捉持续终身学习的精神和实践。我们提出了跟随Meta领导者算法,它扩展了MAML算法到这种设置。从理论上讲,这项工作提供了一个$\mathcal{O}(\log T)$遗憾的保证,只有一个额外的高阶平滑假设相比,标准的在线设置。我们对三个不同的大规模任务的实验评估表明,该算法显着优于传统的在线学习方法的基础上的替代品。

英文摘要:

A central capability of intelligent systems is the ability to continuously build upon previous experiences to speed up and enhance learning of new tasks. Two distinct research paradigms have studied this question. Meta-learning views this problem as learning a prior over model parameters that is amenable for fast adaptation on a new task, but typically assumes the set of tasks are available together as a batch. In contrast, online (regret based) learning considers a sequential setting in which problems are revealed one after the other, but conventionally train only a single model without any task-specific adaptation. This work introduces an online meta-learning setting, which merges ideas from both the aforementioned paradigms to better capture the spirit and practice of continual lifelong learning. We propose the follow the meta leader algorithm which extends the MAML algorithm to this setting. Theoretically, this work provides an $\mathcal{O}(\log T)$ regret guarantee with only one additional higher order smoothness assumption in comparison to the standard online setting. Our experimental evaluation on three different large-scale tasks suggest that the proposed algorithm significantly outperforms alternatives based on traditional online learning approaches.

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

↑