3204 search results - page 106 / 641 » Online Learning with Constraints |
COLT
1999
Springer
15 years 3 months ago
1999
Springer
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 ...
105
click to vote
IJCAI
2007
15 years 21 days ago
2007
The task of learning models for many real-world problems requires incorporating domain knowledge into learning algorithms, to enable accurate learning from a realistic volume of t...
COLT
2006
Springer
15 years 3 months ago
2006
Springer
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...
122
click to vote
ESANN
2004
15 years 20 days ago
2004
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...
ECCV
2008
Springer
16 years 1 months ago
2008
Springer
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 ...