Sciweavers

1822 search results - page 102 / 365
» Risk-Sensitive Online Learning
Sort
View
ICML
2005
IEEE
14 years 10 months ago
Bayesian sparse sampling for on-line reward optimization
We present an efficient "sparse sampling" technique for approximating Bayes optimal decision making in reinforcement learning, addressing the well known exploration vers...
Tao Wang, Daniel J. Lizotte, Michael H. Bowling, D...
ICDAR
2003
IEEE
14 years 3 months ago
A Flexible Recognition Engine for Complex On-line Handwritten Character Recognition
A major feature of new mobiles terminals using penbased interfaces, such as personal assistants or e-book, is their personal character, implying that a good interface should be ea...
Sanparith Marukatat, Rudy Sicard, Thierry Arti&egr...
COLT
1999
Springer
14 years 2 months ago
On a Generalized Notion of Mistake Bounds
This paper proposes the use of constructive ordinals as mistake bounds in the on-line learning model. This approach elegantly generalizes the applicability of the on-line mistake ...
Sanjay Jain, Arun Sharma
COLT
2006
Springer
14 years 1 months ago
Online Variance Minimization
We design algorithms for two online variance minimization problems. Specifically, in every trial t our algorithms get a covariance matrix Ct and try to select a parameter vector wt...
Manfred K. Warmuth, Dima Kuzmin