16 search results - page 2 / 4 » Relative Loss Bounds and Polynomial-Time Predictions for the... |
EUROCOLT
1999
Springer
13 years 11 months ago
1999
Springer
We consider algorithms for combining advice from a set of experts. In each trial, the algorithm receives the predictions of the experts and produces its own prediction. A loss func...
COLT
2006
Springer
13 years 11 months ago
2006
Springer
We study the problem of online learning of multiple tasks in parallel. On each online round, the algorithm receives an instance and makes a prediction for each one of the parallel ...
AI
1998
Springer
13 years 7 months ago
1998
Springer
The absolute loss is the absolute difference between the desired and predicted outcome. This paper demonstrates worst-case upper bounds on the absolute loss for the Perceptron le...
NIPS
2003
13 years 8 months ago
2003
We present a family of margin based online learning algorithms for various prediction tasks. In particular we derive and analyze algorithms for binary and multiclass categorizatio...
NIPS
2003
13 years 8 months ago
2003
We consider an online learning scenario in which the learner can make predictions on the basis of a fixed set of experts. We derive upper and lower relative loss bounds for a cla...