Sciweavers

2223 search results - page 124 / 445
» Implicit Online Learning
Sort
View
159
Voted
KDD
2010
ACM
257views Data Mining» more  KDD 2010»
15 years 8 months ago
Multi-task learning for boosting with application to web search ranking
In this paper we propose a novel algorithm for multi-task learning with boosted decision trees. We learn several different learning tasks with a joint model, explicitly addressing...
Olivier Chapelle, Pannagadatta K. Shivaswamy, Srin...
ICML
2009
IEEE
16 years 5 months ago
Efficient learning algorithms for changing environments
We study online learning in an oblivious changing environment. The standard measure of regret bounds the difference between the cost of the online learner and the best decision in...
Elad Hazan, C. Seshadhri
COLT
2010
Springer
15 years 3 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
149
Voted
ETS
2002
IEEE
153views Hardware» more  ETS 2002»
15 years 4 months ago
Overcoming Social and Psychological Barriers to Effective On-line Collaboration
Research suggests that collaboration in an on-line course can enhance learning, reduce feelings of isolation, increase satisfaction with the course, and increase motivation. Unfor...
Sandra C. Hughes, Leah Wickersham, David L. Ryan-J...
CVPR
2007
IEEE
16 years 7 months ago
Learning Features for Tracking
We treat tracking as a matching problem of detected keypoints between successive frames. The novelty of this paper is to learn classifier-based keypoint descriptions allowing to i...
Michael Grabner, Helmut Grabner, Horst Bischof