Sciweavers

63 search results - page 9 / 13
» Adaptive Subgradient Methods for Online Learning and Stochas...
Sort
View
COLT
2008
Springer
13 years 9 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
ICPR
2006
IEEE
14 years 8 months ago
Learning Mixtures of Offline and Online features for Handwritten Stroke Recognition
In this paper we propose a novel scheme to combine offline and online features of handwritten strokes. The stateof-the-art methods in handwritten stroke recognition have used a pr...
C. V. Jawahar, Karteek Alahari, Satya Lahari Putre...
COLT
2008
Springer
13 years 9 months ago
Regret Bounds for Sleeping Experts and Bandits
We study on-line decision problems where the set of actions that are available to the decision algorithm vary over time. With a few notable exceptions, such problems remained larg...
Robert D. Kleinberg, Alexandru Niculescu-Mizil, Yo...
SDM
2010
SIAM
195views Data Mining» more  SDM 2010»
13 years 9 months ago
Adaptive Informative Sampling for Active Learning
Many approaches to active learning involve periodically training one classifier and choosing data points with the lowest confidence. An alternative approach is to periodically cho...
Zhenyu Lu, Xindong Wu, Josh Bongard
JAIR
2002
163views more  JAIR 2002»
13 years 7 months ago
Efficient Reinforcement Learning Using Recursive Least-Squares Methods
The recursive least-squares (RLS) algorithm is one of the most well-known algorithms used in adaptive filtering, system identification and adaptive control. Its popularity is main...
Xin Xu, Hangen He, Dewen Hu