DCMA: Yet another derandomization in covariance-matrix-adaptation

Proceedings of GECCO 2007: Genetic and Evolutionary Computation Conference

Volumn , Issue , 2007, Pages 955-963

  Teytaud, Olivier ^a   Gelly, Sylvain ^a  

^a INRIA   (France)

Author keywords

Derandomization; Evolution strategies; Quasi random

Indexed keywords

COMPUTATIONAL EFFICIENCY; COVARIANCE MATRIX; ITERATIVE METHODS; RANDOM PROCESSES;

DERANDOMIZATION; EVOLUTION STRATEGIES; GAUSSIAN MUTATIONS; QUASI-RANDOM SAMPLES;

EVOLUTIONARY ALGORITHMS;

EID: 34548058403     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1276958.1277150     Document Type: Conference Paper

References (24)

1. A. Auger, M. Jebalia, and O. Teytaud. Xse: quasi-random mutations for evolution strategies. In Proceedings of Evolutionary Algorithms, 12 pages, 2005.
2. A. Auger, M. Schoenauer, and O. Teytaud. Local and global order 3/2 convergence of a surrogate evolutionary algorithm. In GECCO, pages 857-864, 2005.
3. H.-G. Beyer. The Theory of Evolutions Strategies. Springer, Heidelberg, 2001.
4. P. Bratley and B. Fox. Algorithm 659: Implementing sobol's quasirandom sequence generator. ACM Transactions on Mathematical Software Volume 14, Number 1, pages 88-100, 1988.
5. C. Cervellera and M. Muselli. A deterministic learning approach based on discrepancy. In Proceedings of WIRN'03, pp53-60, 2003.
6. A. Conn, K. Scheinberg, and L. Toint. Recent progress in unconstrained nonlinear optimization without derivatives, 1997.
7. R. Cranley and T. N. L. Patterson. Randomization of number theoretic methods for multiple integration. SIAM J. Numer. Anal, 13(6):904-914, Dec. 1976.
8. A. Eiben and J. Smith. Introduction to Evolutionary Computing, springer, 2003.
9. th International Conference on Parallel Problem Solving from Nature (PPSN 2006), 2006.
10. N. I. M. Gould, D. Orban, and P. L. Toint. Cuter and sifdec: A constrained and unconstrained testing environment, revisited. ACM Trans. Math. Softw., 29(4):373-394, 2003.
11. J. Halton. On the efficiency of certain quasi-random sequences of points in evaluating multi-dimensional integrals. Numerische Mathematik, 2:84-90, 1960.
12. N. Hansen and A. Ostermeier. Completely derandomized self-adaptation in evolution strategies. Evolutionary Computation, 11(1), 2003.
13. F. Hickernell. A generalized discrepancy and quadrature error bound. Math. Comp. 67, 299-322, 1998.
14. S. Kimura and K. Matsumura. Genetic algorithms using low-discrepancy sequences. In GECCO, pages 1341-1346, 2005.
15. P. L'Ecuyer and C. Lemieux. Recent advances in randomized quasi-monte carlo methods, 2002.
16. H. Niederreiter. Random Number Generation and Quasi-Monte Carlo Methods. SIAM, 1992.
17. A. B. Owen. Quasi-Monte Carlo sampling. In H. W. Jensen, editor, Monte Carlo Ray Tracing: Siggraph 2003 Course 44, pages 69-88. SIGGRAPH, 2003.
18. I. Rechenberg. Evolutionstrategie: Optimierung Technisher Systeme nach Prinzipien des Biologischen Evolution. Fromman-Hozlboog Verlag, Stuttgart, 1973.
19. P. Sarkar and M. Prasad. A comparative study of pseudo and quasi random sequences for the solution of integral equations. J. Computational Physics, 68, pages 66-88, 1978.
20. I. Sloan and H. Woźniakowski. When are quasi-Monte Carlo algorithms efficient for high dimensional integrals? Journal of Complexity, 14(1): 1-33, 1998.
21. I. M. Sobol. On the systematic search in a hypercube. j-SIAM-J-NUMER-ANAL, 16(5):790-793, Oct. 1979.
22. P. N. Suganthan, N. Hansen, J. J. Liang, K. Deb, Y.-P. Chen, A. Auger, and S. Tiwari. Problem definitions and evaluation criteria for the cec 2005 special session on real-parameter optimization. Technical Report AND KanGAL Report #2005005, IIT Kanpur, India, Nanyang Technological University, Singapore, 2005.
23. T.Back, F.Hoffmeister, and H.Schewefel. A survey of evolution strategies. Technical report, Dpt. of Computer Science XI, University of Dortmund, D-4600, Dortmund 50, Germany, 1991.
24. B. Tuffin. On the use of low discrepancy sequences in monte carlo methods. In Technical Report 1060, I.R.I.S.A., 1996.