77 search results - page 1 / 16 » Efficient bandit algorithms for online multiclass prediction |
73
Voted
ICML
2008
IEEE
16 years 1 months ago
2008
IEEE
103
Voted
COLT
2008
Springer
15 years 2 months ago
2008
Springer
We introduce an efficient algorithm for the problem of online linear optimization in the bandit setting which achieves the optimal O ( T) regret. The setting is a natural general...
125
Voted
ALT
2006
Springer
15 years 4 months ago
2006
Springer
In this paper the sequential prediction problem with expert advice is considered when the loss is unbounded under partial monitoring scenarios. We deal with a wide class of the par...
114
Voted
CORR
2008
Springer
15 years 1 months ago
2008
Springer
In a multi-armed bandit problem, an online algorithm chooses from a set of strategies in a sequence of n trials so as to maximize the total payoff of the chosen strategies. While ...
112
click to vote
STOC
2007
ACM
16 years 1 months ago
2007
ACM
In an online linear optimization problem, on each period t, an online algorithm chooses st S from a fixed (possibly infinite) set S of feasible decisions. Nature (who may be adve...