569 search results - page 28 / 114 » Online Bounds for Bayesian Algorithms |
NIPS
2004
14 years 11 months ago
2004
In the multi-armed bandit problem, an online algorithm must choose from a set of strategies in a sequence of n trials so as to minimize the total cost of the chosen strategies. Wh...
INFOCOM
2011
IEEE
14 years 1 months ago
2011
IEEE
—In this paper, we propose a Bayesian-inference based recommendation system for online social networks. In our system, users share their content ratings with friends. The rating ...
105
click to vote
IJCGA
2010
14 years 8 months ago
2010
This paper is concerned with on-line problems where a mobile robot of size D has to achieve a task in an unknown planar environment whose geometry is acquired by the robot during ...
COLT
2001
Springer
15 years 2 months ago
2001
Springer
In this paper we study a paradigm to generalize online classification algorithms for binary classification problems to multiclass problems. The particular hypotheses we investig...
COLT
2006
Springer
15 years 1 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...