AdaTask: Adaptive Multitask Online Learning

05/31/2022
by   Pierre Laforgue, et al.
0

We introduce and analyze AdaTask, a multitask online learning algorithm that adapts to the unknown structure of the tasks. When the N tasks are stochastically activated, we show that the regret of AdaTask is better, by a factor that can be as large as √(N), than the regret achieved by running N independent algorithms, one for each task. AdaTask can be seen as a comparator-adaptive version of Follow-the-Regularized-Leader with a Mahalanobis norm potential. Through a variational formulation of this potential, our analysis reveals how AdaTask jointly learns the tasks and their structure. Experiments supporting our findings are presented.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset