107 search results - page 8 / 22 » General Loss Bounds for Universal Sequence Prediction |
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...
ALT
2005
Springer
14 years 4 months ago
2005
Springer
This paper shows how universal learning can be achieved with expert advice. To this aim, we specify an experts algorithm with the following characteristics: (a) it uses only feedba...
COLT
2006
Springer
13 years 11 months ago
2006
Springer
In an online convex optimization problem a decision-maker makes a sequence of decisions, i.e., chooses a sequence of points in Euclidean space, from a fixed feasible set. After ea...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
Competitive on-line prediction (also known as universal prediction of individual sequences) is a strand of learning theory avoiding making any stochastic assumptions about the way...
TIT
2008
13 years 7 months ago
2008
We consider the problem of sequential decision making for random fields corrupted by noise. In this scenario, the decision maker observes a noisy version of the data, yet judged wi...