Group online adaptive learning

被引:3
作者
Zweig, Alon [1 ]
Chechik, Gal [2 ,3 ]
机构
[1] Qylur Intelligent Syst Inc, 1015 East Meadow Circle, Palo Alto, CA 94303 USA
[2] Bar Ilan Univ, Gonda Brain Res Ctr, IL-52900 Ramat Gan, Israel
[3] Google Res, 1600 Amphitheatre Pkwy, Mountain View, CA 94043 USA
关键词
Multi-task learning; Knowledge transfer; Adaptive learning; Online learning; Domain adaptation;
D O I
10.1007/s10994-017-5661-5
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Sharing information among multiple learning agents can accelerate learning. It could be particularly useful if learners operate in continuously changing environments, because a learner could benefit from previous experience of another learner to adapt to their new environment. Such group-adaptive learning has numerous applications, from predicting financial time-series, through content recommendation systems, to visual understanding for adaptive autonomous agents. Here we address the problem in the context of online adaptive learning. We formally define the learning settings of Group Online Adaptive Learning and derive an algorithm named Shared Online Adaptive Learning (SOAL) to address it. SOAL avoids explicitly modeling changes or their dynamics, and instead shares information continuously. The key idea is that learners share a common small pool of experts, which they can use in a weighted adaptive way. We define group adaptive regret and prove that SOAL maintains known bounds on the adaptive regret obtained for single adaptive learners. Furthermore, it quickly adapts when learning tasks are related to each other. We demonstrate the benefits of the approach for two domains: vision and text. First, in the visual domain, we study a visual navigation task where a robot learns to navigate based on outdoor video scenes. We show how navigation can improve when knowledge from other robots in related scenes is available. Second, in the text domain, we create a new dataset for the task of assigning submitted papers to relevant editors. This is, inherently, an adaptive learning task due to the dynamic nature of research fields evolving in time. We show how learning to assign editors improves when knowledge from other editors is available. Together, these results demonstrate the benefits for sharing information across learners in concurrently changing environments.
引用
收藏
页码:1747 / 1770
页数:24
相关论文
共 35 条
[1]  
Abernethy J., 2008, Optimal strategies and minimax lower bounds for online convex games
[2]   Predictive Handling of Asynchronous Concept Drifts in Distributed Environments [J].
Ang, Hock Hee ;
Gopalkrishnan, Vivekanand ;
Zliobaite, Indre ;
Pechenizkiy, Mykola ;
Hoi, Steven C. H. .
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2013, 25 (10) :2343-2355
[3]  
[Anonymous], 2007, 2007 IEEE 11 INT C C
[4]  
[Anonymous], 2011, P 14 INT C ART INT S
[5]  
[Anonymous], 2009, P 26 ANN INT C MACH, DOI [DOI 10.1145/1553374.1553425, 10.1145/1553374.1553425]
[6]  
[Anonymous], FDN TRENDS OPTIM
[7]  
[Anonymous], 2009, ARXIV09023526
[8]  
[Anonymous], 1997, P 29 ANN ACM S THEOR
[9]  
[Anonymous], 2007, ELECT C COMPUTATIONA
[10]   Convex multi-task feature learning [J].
Argyriou, Andreas ;
Evgeniou, Theodoros ;
Pontil, Massimiliano .
MACHINE LEARNING, 2008, 73 (03) :243-272