403 search results - page 51 / 81 » Sampling Bounds for Stochastic Optimization |
GECCO
2010
Springer
14 years 2 months ago
2010
Springer
Derandomization by means of mirrored samples has been recently introduced to enhance the performances of (1, λ)and (1 + 2)-Evolution-Strategies (ESs) with the aim of designing fa...
UAI
1998
13 years 11 months ago
1998
This paper presents two new approaches to decomposing and solving large Markov decision problems (MDPs), a partial decoupling method and a complete decoupling method. In these app...
NIPS
1996
13 years 11 months ago
1996
In this paper we apply the method of complexity regularization to derive estimation bounds for nonlinear function estimation using a single hidden layer radial basis function netwo...
ICML
2002
IEEE
14 years 10 months ago
2002
IEEE
Searching the space of policies directly for the optimal policy has been one popular method for solving partially observable reinforcement learning problems. Typically, with each ...
AUTOMATICA
2006
13 years 10 months ago
2006
This paper is concerned with the optimal control of linear discrete-time systems, which are subject to unknown but bounded state disturbances and mixed constraints on the state an...