Sciweavers

369 search results - page 11 / 74
» Global Optimization for Value Function Approximation
Sort
View
IWANN
1999
Springer
14 years 25 days ago
Using Temporal Neighborhoods to Adapt Function Approximators in Reinforcement Learning
To avoid the curse of dimensionality, function approximators are used in reinforcement learning to learn value functions for individual states. In order to make better use of comp...
R. Matthew Kretchmar, Charles W. Anderson
CVPR
2008
IEEE
14 years 10 months ago
Globally optimal bilinear programming for computer vision applications
We present a practical algorithm that provably achieves the global optimum for a class of bilinear programs commonly arising in computer vision applications. Our approach relies o...
Manmohan Krishna Chandraker, David J. Kriegman
AAAI
2008
13 years 11 months ago
Generalized Point Based Value Iteration for Interactive POMDPs
We develop a point based method for solving finitely nested interactive POMDPs approximately. Analogously to point based value iteration (PBVI) in POMDPs, we maintain a set of bel...
Prashant Doshi, Dennis Perez
NA
2007
120views more  NA 2007»
13 years 8 months ago
On choosing "optimal" shape parameters for RBF approximation
Many radial basis function (RBF) methods contain a free shape parameter that plays an important role for the accuracy of the method. In most papers the authors end up choosing this...
Gregory E. Fasshauer, Jack G. Zhang
DEDS
2010
97views more  DEDS 2010»
13 years 8 months ago
On Regression-Based Stopping Times
We study approaches that fit a linear combination of basis functions to the continuation value function of an optimal stopping problem and then employ a greedy policy based on the...
Benjamin Van Roy