Sciweavers

46 search results - page 5 / 10
» colt 2008
Sort
View
COLT
2008
Springer
13 years 8 months ago
Combining Expert Advice Efficiently
We show how models for prediction with expert advice can be defined concisely and clearly using hidden Markov models (HMMs); standard HMM algorithms can then be used to efficientl...
Wouter M. Koolen, Steven de Rooij
COLT
2008
Springer
13 years 8 months ago
Linear Algorithms for Online Multitask Classification
We design and analyze interacting online algorithms for multitask classification that perform better than independent learners whenever the tasks are related in a certain sense. W...
Giovanni Cavallanti, Nicolò Cesa-Bianchi, C...
COLT
2008
Springer
13 years 8 months ago
High-Probability Regret Bounds for Bandit Online Linear Optimization
We present a modification of the algorithm of Dani et al. [8] for the online linear optimization problem in the bandit setting, which with high probability has regret at most O ( ...
Peter L. Bartlett, Varsha Dani, Thomas P. Hayes, S...
COLT
2010
Springer
13 years 4 months ago
Learning Rotations with Little Regret
We describe online algorithms for learning a rotation from pairs of unit vectors in Rn . We show that the expected regret of our online algorithm compared to the best fixed rotati...
Elad Hazan, Satyen Kale, Manfred K. Warmuth
COLT
2001
Springer
13 years 11 months ago
Agnostic Boosting
We prove strong noise-tolerance properties of a potential-based boosting algorithm, similar to MadaBoost (Domingo and Watanabe, 2000) and SmoothBoost (Servedio, 2003). Our analysi...
Shai Ben-David, Philip M. Long, Yishay Mansour