Sciweavers

3204 search results - page 106 / 641
» Online Learning with Constraints
Sort
View
COLT
1999
Springer
14 years 2 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
IJCAI
2007
13 years 11 months ago
A Theoretical Framework for Learning Bayesian Networks with Parameter Inequality Constraints
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...
Radu Stefan Niculescu, Tom M. Mitchell, R. Bharat ...
COLT
2006
Springer
14 years 1 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
13 years 11 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
14 years 12 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