Sciweavers

15 search results - page 3 / 3
» Online Algorithms for the Multi-Armed Bandit Problem with Ma...
Sort
View
SAC
2005
ACM
13 years 9 months ago
Stochastic scheduling of active support vector learning algorithms
Active learning is a generic approach to accelerate training of classifiers in order to achieve a higher accuracy with a small number of training examples. In the past, simple ac...
Gaurav Pandey, Himanshu Gupta, Pabitra Mitra
ICML
2006
IEEE
14 years 5 months ago
Learning algorithms for online principal-agent problems (and selling goods online)
In a principal-agent problem, a principal seeks to motivate an agent to take a certain action beneficial to the principal, while spending as little as possible on the reward. This...
Vincent Conitzer, Nikesh Garera
CORR
2011
Springer
210views Education» more  CORR 2011»
12 years 11 months ago
Online Learning of Rested and Restless Bandits
In this paper we study the online learning problem involving rested and restless multiarmed bandits with multiple plays. The system consists of a single player/user and a set of K...
Cem Tekin, Mingyan Liu
COLT
2008
Springer
13 years 6 months ago
Adapting to a Changing Environment: the Brownian Restless Bandits
In the multi-armed bandit (MAB) problem there are k distributions associated with the rewards of playing each of k strategies (slot machine arms). The reward distributions are ini...
Aleksandrs Slivkins, Eli Upfal
ICML
2001
IEEE
14 years 5 months ago
Expectation Maximization for Weakly Labeled Data
We call data weakly labeled if it has no exact label but rather a numerical indication of correctness of the label "guessed" by the learning algorithm - a situation comm...
Yuri A. Ivanov, Bruce Blumberg, Alex Pentland