Sciweavers

16 search results - page 1 / 4
» Active Learning in Multi-armed Bandits
Sort
View
122
Voted
CORR
2010
Springer
143views Education» more  CORR 2010»
14 years 9 months ago
The Non-Bayesian Restless Multi-Armed Bandit: a Case of Near-Logarithmic Regret
In the classic Bayesian restless multi-armed bandit (RMAB) problem, there are N arms, with rewards on all arms evolving at each time as Markov chains with known parameters. A play...
Wenhan Dai, Yi Gai, Bhaskar Krishnamachari, Qing Z...
113
Voted
CORR
2008
Springer
136views Education» more  CORR 2008»
15 years 1 months ago
Multi-Armed Bandits in Metric Spaces
In a multi-armed bandit problem, an online algorithm chooses from a set of strategies in a sequence of n trials so as to maximize the total payoff of the chosen strategies. While ...
Robert Kleinberg, Aleksandrs Slivkins, Eli Upfal
120
Voted
SAC
2005
ACM
15 years 6 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
126
Voted
CORR
2010
Springer
187views Education» more  CORR 2010»
15 years 1 months ago
Learning in A Changing World: Non-Bayesian Restless Multi-Armed Bandit
We consider the restless multi-armed bandit (RMAB) problem with unknown dynamics. In this problem, at each time, a player chooses K out of N (N > K) arms to play. The state of ...
Haoyang Liu, Keqin Liu, Qing Zhao