569 search results - page 69 / 114 » Online Bounds for Bayesian Algorithms |
ICML
2008
IEEE
15 years 10 months ago
2008
IEEE
Sampling is a popular way of scaling up machine learning algorithms to large datasets. The question often is how many samples are needed. Adaptive stopping algorithms monitor the ...
120
click to vote
SIGECOM
2011
ACM
14 years 21 days ago
2011
ACM
The Generalized Second Price (GSP) auction is the primary method by which sponsered search advertisements are sold. We study the performance of this auction in the Bayesian settin...
INFOCOM
2009
IEEE
15 years 4 months ago
2009
IEEE
—In this paper, we study an online bipartite matching problem, motivated by applications in wireless communication, content delivery, and job scheduling. In our problem, we have ...
ALT
2010
Springer
14 years 11 months ago
2010
Springer
We address the problem of constructing randomized online algorithms for the Metrical Task Systems (MTS) problem on a metric against an oblivious adversary. Restricting our attenti...
COLT
2005
Springer
14 years 12 months ago
2005
Springer
External regret compares the performance of an online algorithm, selecting among N actions, to the performance of the best of those actions in hindsight. Internal regret compares ...