144
click to vote
COLT
15 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...
137
click to vote
COLT
15 years 10 months ago
2005 Springer 
Abstract. We present several results related to ranking. We give a general margin-based bound for ranking based on the L∞ covering number of the hypothesis space. Our bound sugge...
154
click to vote
COLT
15 years 6 months ago
2005 Springer 
External regret compares the performance of an online algorithm, selecting among N actions, to the performance of the best of those actions in hindsight. Internal regret compares ...
139
click to vote
COLT
15 years 10 months ago
2005 Springer 
We start by showing that in an active learning setting, the Perceptron algorithm needs Ω( 1 ε2 ) labels to learn linear separators within generalization error ε. We then prese...
|
Machine Learning