conference paper
Online Multitask Learning
Ofer Dekela, Philip M. Longb, Yoram Singera b
- aSchool of Computer Science and Engineering, The Hebrew University, Jerusalem, 91904, Israel
- bGoogle, 1600 Amphitheater Parkway, Mountain View, CA, 94043, USA
Lecture notes in computer scienceSpringer Science+Business Media2006-01-01 80 citations21 references
Looking for the full paper…
Papers open inside SciRah from the original publisher or repository; SciRah never hosts them.
Abstract
No abstract is available from our sources. Use “Read paper” to view it.
TL;DRSeveral families of online algorithms are presented which can use any absolute norm as a global loss function and are proved to prove worst-case relative loss bounds for all of the algorithms. (Semantic Scholar)