Sciweavers

369 search results - page 1 / 74
» Global Optimization for Value Function Approximation
Sort
View
CORR
2010
Springer
170views Education» more  CORR 2010»
13 years 5 months ago
Global Optimization for Value Function Approximation
Existing value function approximation methods have been successfully used in many applications, but they often lack useful a priori error bounds. We propose a new approximate bili...
Marek Petrik, Shlomo Zilberstein
NIPS
2007
13 years 6 months ago
Random Sampling of States in Dynamic Programming
We combine three threads of research on approximate dynamic programming: sparse random sampling of states, value function and policy approximation using local models, and using lo...
Christopher G. Atkeson, Benjamin Stephens
AAAI
2007
13 years 7 months ago
Compact Spectral Bases for Value Function Approximation Using Kronecker Factorization
A new spectral approach to value function approximation has recently been proposed to automatically construct basis functions from samples. Global basis functions called proto-val...
Jeffrey Johns, Sridhar Mahadevan, Chang Wang
COCOS
2003
Springer
148views Optimization» more  COCOS 2003»
13 years 10 months ago
Convex Programming Methods for Global Optimization
We investigate some approaches to solving nonconvex global optimization problems by convex nonlinear programming methods. We assume that the problem becomes convex when selected va...
John N. Hooker
ADCM
2005
79views more  ADCM 2005»
13 years 4 months ago
Flexible piecewise approximations based on partition of unity
In this paper, we study a flexible piecewise approximation technique based on the use of the idea of the partition of unity. The approximations are piecewisely defined, globally sm...
Weimin Han, Wing Kam Liu