Sciweavers

34 search results - page 1 / 7
» Optimal Stochastic Search and Adaptive Momentum
Sort
View
NIPS
1993
13 years 9 months ago
Optimal Stochastic Search and Adaptive Momentum
Stochastic optimization algorithms typically use learning rate schedules that behave asymptotically as (t) = 0=t. The ensemble dynamics (Leen and Moody, 1993) for such algorithms ...
Todd K. Leen, Genevieve B. Orr
ISCAS
2005
IEEE
114views Hardware» more  ISCAS 2005»
14 years 1 months ago
Structured stochastic optimization strategies for problems with ill-conditioned error surfaces
—This paper compares the performance of several structured optimization strategies in adaptive signal processing problems that are characterized by ill-conditioned error surfaces...
S. Pal, Dean J. Krusienski, W. Kenneth Jenkins
GECCO
2009
Springer
147views Optimization» more  GECCO 2009»
14 years 6 days ago
Benchmarking the (1+1)-CMA-ES on the BBOB-2009 function testbed
The (1+1)-CMA-ES is an adaptive stochastic algorithm for the optimization of objective functions defined on a continuous search space in a black-box scenario. In this paper, an i...
Anne Auger, Nikolaus Hansen
GECCO
2009
Springer
142views Optimization» more  GECCO 2009»
14 years 6 days ago
Benchmarking the (1+1)-CMA-ES on the BBOB-2009 noisy testbed
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...
Anne Auger, Nikolaus Hansen