Sciweavers

590 search results - page 71 / 118
» Can We Learn to Beat the Best Stock
Sort
View
AAAI
2012
13 years 5 days ago
Online Kernel Selection: Algorithms and Evaluations
Kernel methods have been successfully applied to many machine learning problems. Nevertheless, since the performance of kernel methods depends heavily on the type of kernels being...
Tianbao Yang, Mehrdad Mahdavi, Rong Jin, Jinfeng Y...
CORR
2000
Springer
84views Education» more  CORR 2000»
14 years 9 months ago
Robust Classification for Imprecise Environments
In real-world environments it usually is difficult to specify target operating conditions precisely, for example, target misclassification costs. This uncertainty makes building ro...
Foster J. Provost, Tom Fawcett
ICML
1997
IEEE
15 years 10 months ago
Characterizing the generalization performance of model selection strategies
Abstract: We investigate the structure of model selection problems via the bias/variance decomposition. In particular, we characterize the essential structure of a model selection ...
Dale Schuurmans, Lyle H. Ungar, Dean P. Foster
COLT
2010
Springer
14 years 7 months ago
Open Loop Optimistic Planning
We consider the problem of planning in a stochastic and discounted environment with a limited numerical budget. More precisely, we investigate strategies exploring the set of poss...
Sébastien Bubeck, Rémi Munos
CORR
2010
Springer
127views Education» more  CORR 2010»
14 years 10 months ago
Online Algorithms for the Multi-Armed Bandit Problem with Markovian Rewards
We consider the classical multi-armed bandit problem with Markovian rewards. When played an arm changes its state in a Markovian fashion while it remains frozen when not played. Th...
Cem Tekin, Mingyan Liu