866 search results - page 4 / 174 » Extension of the direct optimization algorithm for noisy fun... |
GECCO
2009
Springer
13 years 11 months ago
2009
Springer
We benchmark an independent-restart-(1+1)-CMA-ES on the BBOB-2009 noisy testbed. The (1+1)-CMA-ES is an adaptive stochastic algorithm for the optimization of objective functions d...
GECCO
2009
Springer
13 years 11 months ago
2009
Springer
The BFGS quasi-Newton method is benchmarked on the noisy BBOB-2009 testbed. A multistart strategy is applied with a maximum number of function evaluations of about 104 times the s...
ICML
2000
IEEE
14 years 7 months ago
2000
IEEE
This paper describes Pairwise Bisection: a nonparametric approach to optimizing a noisy function with few function evaluations. The algorithm uses nonparametric reasoning about si...
TSMC
2011
13 years 1 months ago
2011
—This paper introduces an algorithm for direct search of control policies in continuous-state discrete-action Markov decision processes. The algorithm looks for the best closed-l...
GECCO
2009
Springer
13 years 11 months ago
2009
Springer
The (1+1)-ES with one-fifth success rule is one of the first and simplest stochastic algorithm proposed for optimization on a continuous search space in a black-box scenario. In...