Sciweavers

1800 search results - page 250 / 360
» Learning Restart Strategies
Sort
View
ICML
2009
IEEE
16 years 6 months ago
Near-Bayesian exploration in polynomial time
We consider the exploration/exploitation problem in reinforcement learning (RL). The Bayesian approach to model-based RL offers an elegant solution to this problem, by considering...
J. Zico Kolter, Andrew Y. Ng
ICML
2008
IEEE
16 years 6 months ago
Training SVM with indefinite kernels
Similarity matrices generated from many applications may not be positive semidefinite, and hence can't fit into the kernel machine framework. In this paper, we study the prob...
Jianhui Chen, Jieping Ye

Publication
222views
16 years 2 months ago
Algorithms and Bounds for Rollout Sampling Approximate Policy Iteration
Abstract: Several approximate policy iteration schemes without value functions, which focus on policy representation using classifiers and address policy learning as a supervis...
Christos Dimitrakakis, Michail G. Lagoudakis
CVPR
2010
IEEE
16 years 1 months ago
Online Multiclass LPBoost
Online boosting is one of the most successful online learning algorithms in computer vision. While many challenging online learning problems are inherently multi-class, online boo...
Amir Saffari, Martin Godec, Thomas Pock, Christian...
ECTEL
2009
Springer
15 years 11 months ago
LAG 2.0: Refining a Reusable Adaptation Language and Improving on Its Authoring
Reusable adaptation specifications for adaptive behaviour has come to the forefront of adaptive research recently, with EU projects such as GRAPPLE1, and PhD research efforts on de...
Alexandra I. Cristea, David Smits, Jon Bevan, Maur...