Sciweavers

1955 search results - page 108 / 391
» Online Multitask Learning
Sort
View
COLT
1999
Springer
15 years 10 months ago
On a Generalized Notion of Mistake Bounds
This paper proposes the use of constructive ordinals as mistake bounds in the on-line learning model. This approach elegantly generalizes the applicability of the on-line mistake ...
Sanjay Jain, Arun Sharma
COLT
2006
Springer
15 years 10 months ago
Online Variance Minimization
We design algorithms for two online variance minimization problems. Specifically, in every trial t our algorithms get a covariance matrix Ct and try to select a parameter vector wt...
Manfred K. Warmuth, Dima Kuzmin
ESANN
2004
15 years 7 months ago
Online policy adaptation for ensemble classifiers
Ensemble algorithms can improve the performance of a given learning algorithm through the combination of multiple base classifiers into an ensemble. In this paper, the idea of usin...
Christos Dimitrakakis, Samy Bengio
ECCV
2008
Springer
16 years 8 months ago
Semi-supervised On-Line Boosting for Robust Tracking
Abstract. Recently, on-line adaptation of binary classifiers for tracking have been investigated. On-line learning allows for simple classifiers since only the current view of the ...
Helmut Grabner, Christian Leistner, Horst Bischof
ICALT
2007
IEEE
16 years 17 days ago
Finding the Right Tool for the Community: Bringing a Wiki-Type Editor to the World of Reusable Learning Objects
In this paper we present a new approach to enabling pedagogically sound reuse and re-purposing of online learning objects in a community of practice. The lack of specific software...
Chu Wang, Hugh C. Davis, Kate Dickens, Gary Wills,...