Sciweavers

25 search results - page 5 / 5
» Improved Algorithms for the Minmax Regret 1-Median Problem
Sort
View
CIMCA
2008
IEEE
14 years 3 months ago
Tree Exploration for Bayesian RL Exploration
Research in reinforcement learning has produced algorithms for optimal decision making under uncertainty that fall within two main types. The first employs a Bayesian framework, ...
Christos Dimitrakakis
CORR
2007
Springer
106views Education» more  CORR 2007»
13 years 8 months ago
Bandit Algorithms for Tree Search
Bandit based methods for tree search have recently gained popularity when applied to huge trees, e.g. in the game of go [6]. Their efficient exploration of the tree enables to ret...
Pierre-Arnaud Coquelin, Rémi Munos
ICML
2009
IEEE
14 years 9 months ago
Proximal regularization for online and batch learning
Many learning algorithms rely on the curvature (in particular, strong convexity) of regularized objective functions to provide good theoretical performance guarantees. In practice...
Chuong B. Do, Quoc V. Le, Chuan-Sheng Foo
JMLR
2010
101views more  JMLR 2010»
13 years 3 months ago
Efficient Reductions for Imitation Learning
Imitation Learning, while applied successfully on many large real-world problems, is typically addressed as a standard supervised learning problem, where it is assumed the trainin...
Stéphane Ross, Drew Bagnell
EDBT
2006
ACM
179views Database» more  EDBT 2006»
14 years 8 months ago
TrajPattern: Mining Sequential Patterns from Imprecise Trajectories of Mobile Objects
Abstract. Mobile objects have become ubiquitous in our everyday lives, ranging from cellular phones to sensors, therefore, analyzing and mining mobile data becomes an interesting p...
Jiong Yang, Meng Hu