569 search results - page 15 / 114 » Online Bounds for Bayesian Algorithms |
122
click to vote
SIGECOM
2011
ACM
14 years 19 days ago
2011
ACM
We present algorithms for a class of resource allocation problems both in the online setting with stochastic input and in the offline setting. This class of problems contains man...
ECCC
2010
14 years 10 months ago
2010
Suppose a decision maker has to purchase a commodity over time with varying prices and demands. In particular, the price per unit might depend on the amount purchased and this pri...
ALT
2005
Springer
15 years 6 months ago
2005
Springer
We bound the future loss when predicting any (computably) stochastic sequence online. Solomonoff finitely bounded the total deviation of his universal predictor M from the true ...
ICML
2010
IEEE
14 years 7 months ago
2010
IEEE
Online learning algorithms have recently risen to prominence due to their strong theoretical guarantees and an increasing number of practical applications for large-scale data ana...
ICML
2009
IEEE
15 years 10 months ago
2009
IEEE
We consider the exploration/exploitation problem in reinforcement learning (RL). The Bayesian approach to model-based RL offers an elegant solution to this problem, by considering...