256 search results - page 1 / 52 » On a Generalized Notion of Mistake Bounds |
COLT
1999
Springer
13 years 8 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 ...
COLT
2006
Springer
13 years 8 months ago
2006
Springer
We describe a novel framework for the design and analysis of online learning algorithms based on the notion of duality in constrained optimization. We cast a sub-family of universa...
NIPS
2004
13 years 5 months ago
2004
We establish a mistake bound for an ensemble method for classification based on maximizing the entropy of voting weights subject to margin constraints. The bound is the same as a ...
ALT
2010
Springer
13 years 6 months ago
2010
Springer
Online learning and kernel learning are two active research topics in machine learning. Although each of them has been studied extensively, there is a limited effort in addressing ...
COLT
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. We present a generalization of the Perceptron algorithm. The new algorithm performs a Perceptron-style update whenever the margin of an example is smaller than a predefi...