Sciweavers

369 search results - page 6 / 74
» Global Optimization for Value Function Approximation
Sort
View
AAMAS
2007
Springer
13 years 8 months ago
Parallel Reinforcement Learning with Linear Function Approximation
In this paper, we investigate the use of parallelization in reinforcement learning (RL), with the goal of learning optimal policies for single-agent RL problems more quickly by us...
Matthew Grounds, Daniel Kudenko
MP
1998
134views more  MP 1998»
13 years 8 months ago
Second-order global optimality conditions for convex composite optimization
In recent years second-order sufficient conditions of an isolated local minimizer for convex composite optimization problems have been established. In this paper, second-order opt...
Xiaoqi Yang
PRICAI
2000
Springer
14 years 3 days ago
A POMDP Approximation Algorithm That Anticipates the Need to Observe
This paper introduces the even-odd POMDP, an approximation to POMDPs in which the world is assumed to be fully observable every other time step. The even-odd POMDP can be converte...
Valentina Bayer Zubek, Thomas G. Dietterich
AAAI
2006
13 years 10 months ago
Sample-Efficient Evolutionary Function Approximation for Reinforcement Learning
Reinforcement learning problems are commonly tackled with temporal difference methods, which attempt to estimate the agent's optimal value function. In most real-world proble...
Shimon Whiteson, Peter Stone
JGO
2010
138views more  JGO 2010»
13 years 7 months ago
Continuous GRASP with a local active-set method for bound-constrained global optimization
Abstract. Global optimization seeks a minimum or maximum of a multimodal function over a discrete or continuous domain. In this paper, we propose a hybrid heuristic – based on th...
Ernesto G. Birgin, Erico M. Gozzi, Mauricio G. C. ...