-
1
-
-
84892188881
-
Why natural gradient?
-
S. Amari and S. C. Douglas. Why natural gradient? In Proceedings of the 1998 IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP '98), volume 2, pages 1213-1216, 1998.
-
(1998)
Proceedings of the 1998 IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP '98)
, vol.2
, pp. 1213-1216
-
-
Amari, S.1
Douglas, C.S.2
-
2
-
-
0037592480
-
Evolution strategies: A comprehensive introduction
-
H.-G. Beyer and H.-P. Schwefel. Evolution strategies: A comprehensive introduction. Natural Computing, 1:3-52, 2002.
-
(2002)
Natural Computing
, vol.1
, pp. 3-52
-
-
Beyer, H.-G.1
Schwefel, H.-P.2
-
4
-
-
77955901414
-
Exponential natural evolution strategies
-
Portland, OR
-
T. Glasmachers, T. Schaul, Y. Sun, D. Wierstra, and J. Schmidhuber. Exponential Natural Evolution Strategies. In Genetic and Evolutionary Computation Conference (GECCO), Portland, OR, 2010.
-
(2010)
Genetic and Evolutionary Computation Conference (GECCO)
-
-
Glasmachers, T.1
Schaul, T.2
Sun, Y.3
Wierstra, D.4
Schmidhuber, J.5
-
6
-
-
33845271655
-
The CMA evolution strategy: A comparing review
-
DOI 10.1007/11007937-4, Towards a New Evolutionary Computation: Advances in the Estimation of Distribution Algorithms
-
N. Hansen. The CMA evolution strategy: a comparing review. In J. Lozano, P. Larranaga, I. Inza, and E. Bengoetxea, editors, Towards a new evolutionary computation. Advances on estimation of distribution algorithms, pages 75-102. Springer, 2006. (Pubitemid 44856937)
-
(2006)
Studies in Fuzziness and Soft Computing
, vol.192
, pp. 75-102
-
-
Hansen, N.1
-
9
-
-
0035377566
-
Completely derandomized self-adaptation in evolution strategies
-
N. Hansen and A. Ostermeier. Completely derandomized self-adaptation in evolution strategies. Evolutionary Computation, 9(2):159-195, 2001.
-
(2001)
Evolutionary Computation
, vol.9
, Issue.2
, pp. 159-195
-
-
Hansen, N.1
Ostermeier, A.2
-
10
-
-
56449130100
-
A simple modification in CMA-ES achieving linear time and space complexity
-
R. et al., editor PPSN X Springer
-
R. Ros and N. Hansen. A Simple Modification in CMA-ES Achieving Linear Time and Space Complexity. In R. et al., editor, Parallel Problem Solving from Nature, PPSN X, pages 296-305. Springer, 2008.
-
(2008)
Parallel Problem Solving from Nature
, pp. 296-305
-
-
Ros, R.1
Hansen, N.2
-
11
-
-
77949523247
-
PyBrain
-
T. Schaul, J. Bayer, D. Wierstra, Y. Sun, M. Felder, F. Sehnke, T. Rückstieß, and J. Schmidhuber. PyBrain. Journal of Machine Learning Research, 11:743-746, 2010.
-
(2010)
Journal of Machine Learning Research
, vol.11
, pp. 743-746
-
-
Schaul, T.1
Bayer, J.2
Wierstra, D.3
Sun, Y.4
Felder, M.5
Sehnke, F.6
Rückstieß, T.7
Schmidhuber, J.8
-
14
-
-
0000560869
-
Global optimization by basin-hopping and the lowest energy structures of lennard-jones clusters containing up to 110 atoms
-
D. Wales and J. Doye. Global Optimization by Basin-Hopping and the Lowest Energy Structures of Lennard-Jones Clusters Containing up to 110 Atoms. The Journal of Physical Chemistry A, 101(28):8, 1998.
-
(1998)
The Journal of Physical Chemistry A
, vol.101
, Issue.28
, pp. 8
-
-
Wales, D.1
Doye, J.2
|