569 search results - page 16 / 114 » Online Bounds for Bayesian Algorithms |
144
click to vote
JMLR
2012
13 years 2 months ago
2012
We prove logarithmic regret bounds that depend on the loss L∗ T of the competitor rather than on the number T of time steps. In the general online convex optimization setting, o...
122
click to vote
FAW
2010
Springer
14 years 10 months ago
2010
Springer
The newsvendor problem describes the dilemma of a newspaper salesman—how many papers should he purchase each day to resell, when he doesn’t know the demand? We develop approach...
102
click to vote
COLT
2006
Springer
15 years 3 months ago
2006
Springer
We propose a sequential randomized algorithm, which at each step concentrates on functions having both low risk and low variance with respect to the previous step prediction functi...
JAIR
2008
14 years 12 months ago
2008
Partially Observable Markov Decision Processes (POMDPs) provide a rich framework for sequential decision-making under uncertainty in stochastic domains. However, solving a POMDP i...
NIPS
2003
15 years 1 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...