340 search results - page 52 / 68 » Kernelized value function approximation for reinforcement le... |
ICA
2004
Springer
15 years 7 months ago
2004
Springer
We propose a relative optimization framework for quasi maximum likelihood blind deconvolution and the relative Newton method as its particular instance. Special Hessian structure a...
147
click to vote
IJCNN
2007
IEEE
15 years 8 months ago
2007
IEEE
Abstract— The generalised linear model (GLM) is the standard approach in classical statistics for regression tasks where it is appropriate to measure the data misfit using a lik...
136
click to vote
ICML
2008
IEEE
16 years 3 months ago
2008
IEEE
Most existing sparse Gaussian process (g.p.) models seek computational advantages by basing their computations on a set of m basis functions that are the covariance function of th...
109
click to vote
PKDD
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. Polytope Faces Pursuit (PFP) is a greedy algorithm that approximates the sparse solutions recovered by 1 regularised least-squares (Lasso) [4,10] in a similar vein to (Or...
107
click to vote
NIPS
1997
15 years 3 months ago
1997
Prioritized sweeping is a model-based reinforcement learning method that attempts to focus an agent’s limited computational resources to achieve a good estimate of the value of ...