Sciweavers

176 search results - page 15 / 36
» Optimal Sample Selection for Batch-mode Reinforcement Learni...
Sort
View
ICASSP
2011
IEEE
12 years 11 months ago
A kernelized maximal-figure-of-merit learning approach based on subspace distance minimization
We propose a kernelized maximal-figure-of-merit (MFoM) learning approach to efficiently training a nonlinear model using subspace distance minimization. In particular, a fixed,...
Byungki Byun, Chin-Hui Lee
NIPS
1998
13 years 9 months ago
Finite-Sample Convergence Rates for Q-Learning and Indirect Algorithms
In this paper, we address two issues of long-standing interest in the reinforcement learning literature. First, what kinds of performance guarantees can be made for Q-learning aft...
Michael J. Kearns, Satinder P. Singh
SMC
2007
IEEE
102views Control Systems» more  SMC 2007»
14 years 1 months ago
An improved immune Q-learning algorithm
—Reinforcement learning is a framework in which an agent can learn behavior without knowledge on a task or an environment by exploration and exploitation. Striking a balance betw...
Zhengqiao Ji, Q. M. Jonathan Wu, Maher A. Sid-Ahme...
SDM
2008
SIAM
144views Data Mining» more  SDM 2008»
13 years 9 months ago
Active Learning with Model Selection in Linear Regression
Optimally designing the location of training input points (active learning) and choosing the best model (model selection) are two important components of supervised learning and h...
Masashi Sugiyama, Neil Rubens
CORR
2010
Springer
125views Education» more  CORR 2010»
13 years 7 months ago
Near-Optimal Bayesian Active Learning with Noisy Observations
We tackle the fundamental problem of Bayesian active learning with noise, where we need to adaptively select from a number of expensive tests in order to identify an unknown hypot...
Daniel Golovin, Andreas Krause, Debajyoti Ray