On the huge benefit of quasi-random mutations for multimodal optimization with application to grid-based tuning of neurocontrollers

ESANN 2009 Proceedings, 17th European Symposium on Artificial Neural Networks - Advances in Computational Intelligence and Learning

Volumn , Issue , 2009, Pages 189-194

  Chaslot, G ^a   Hoock, J B ^b   Teytaud, F ^b   Teytaud, O ^b  

^a MAASTRICHT UNIVERSITY   (Netherlands)

^b INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

BENCHMARK FUNCTIONS; EVOLUTION STRATEGIES; MONTE-CARLO TREE SEARCHES; MULTI MODAL FUNCTION; MULTI-MODAL OPTIMIZATION; MULTIMODAL BENCHMARK; NEURO CONTROLLERS; PROOF OF CONCEPT;

FORESTRY; NEURAL NETWORKS; OPTIMIZATION; TREES (MATHEMATICS);

BENCHMARKING;

EID: 84886995576     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (24)

1. Monte Lunacek, Darrell Whitley, and Andrew Sutton. The impact of global structure on search. In Günter Rudolph, Thomas Jansen, Simon M. Lucas, Carlo Poloni, and Nicola Beume, editors, PPSN, volume 5199 of Lecture Notes in Computer Science, pages 498-507. Springer, 2008.
2. K. Fukumizu and S. Amari. Local minima and plateaus in hierarchical structures of multilayer perceptrons. Neural Networks, 13(3):317-327, 2000.
3. Christopher M. Bishop. Neural Networks for Pattern Recognition. Oxford University Press, November 1995.
4. I. Rechenberg. Evolutionstrategie: Optimierung Technischer Systeme nach Prinzipien des Biologischen Evolution. Fromman-Holzboog Verlag, Stuttgart, 1973.
5. H.-G. Beyer. The Theory of Evolutions Strategies. Springer, Heidelberg, 2001.
6. F. van den Bergh and A. Engelbrecht. Cooperative learning in neural networks using particle swarm optimizers, 2000.
7. N. Hansen and S. Kern. Evaluating the CMA evolution strategy on multimodal test functions. In X. Yao et al., editors, Parallel Problem Solving from Nature PPSN VIII, volume 3242 of LNCS, pages 282-291. Springer, 2004.
8. A. Auger and N. Hansen. A restart CMA evolution strategy with increasing population size. In Proceedings of the IEEE Congress on Evolutionary Computation, CEC 2005, pages 1769-1776, 2005.
9. Hans-Georg Beyer and Bernhard Sendhoff. Covariance matrix adaptation revisited - the CMSA evolution strategy. In Günter Rudolph, Thomas Jansen, Simon M. Lucas, Carlo Poloni, and Nicola Beume, editors, Proceedings of PPSN, pages 123-132, 2008.
10. Kenneth A. De Jong. Genetic algorithms are not function optimizers. In L. Darrell Whitley, editor, FOGA, pages 5-17. Morgan Kaufmann, 1992.
11. 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.
12. Shuhei Kimura and Koki Matsumura. Genetic algorithms using low-discrepancy sequences. In GECCO, pages 1341-1346, 2005.
13. A. Auger, M. Jebalia, and O. Teytaud. Xse: quasi-random mutations for evolution strategies. In Proceedings of Evolutionary Algorithms, 12 pages, 2005.
14. Olivier Teytaud and Sylvain Gelly. Dcma: yet another derandomization in covariance-matrix-adaptation. In GECCO'07: Proceedings of the 9th annual conference on Genetic and evolutionary computation, pages 955-963, New York, NY, USA, 2007. ACM.
15. P. L'Ecuyer and C. Lemieux. Recent Advances in Randomized Quasi-Monte Carlo Methods, pages 419-474. Kluwer Academic, 2002.
16. Olivier Teytaud. When does quasi-random work?. In Günter Rudolph, Thomas Jansen, Simon M. Lucas, Carlo Poloni, and Nicola Beume, editors, PPSN, volume 5199 of Lecture Notes in Computer Science, pages 325-336. Springer, 2008.
17. I. M. Sobol. On the systematic search in a hypercube. SIAM journal on Numerical Analysis, 16(5):790-793, October 1979.
18. Réemi Coulom. Efficient selectivity and backup operators in monte-carlo tree search. In P. Ciancarini and H. J. van den Herik, editors, Proceedings of the 5th International Conference on Computers and Games, Turin, Italy, 2006.
19. G. Chaslot, M.H.M. Winands, J.W.H.M. Uiterwijk, H. van den Herik, and B. Bouzy. Progressive strategies for monte-carlo tree search. In P. Wang et al., editors, Proceedings of the 10th Joint Conference on Information Sciences (JCIS 2007), pages 655-661. World Scientific Publishing Co. Pte. Ltd., 2007.
20. Yizao Wang and Sylvain Gelly. Modifications of UCT and sequence-like simulations for Monte-Carlo Go. In IEEE Symposium on Computational Intelligence and Games, Honolulu, Hawaii, pages 175-182, 2007.
21. Sylvain Gelly and David Silver. Combining online and offline knowledge in uct. In ICML'07: Proceedings of the 24th international conference on Machine learning, pages 273-280, New York, NY, USA, 2007. ACM Press.
22. L. Kocsis and C. Szepesvari. Bandit-based monte-carlo planning. In ECML'06, pages 282-293, 2006.
23. Ofer M. Shir and Thomas Bäck. Performance analysis of niching algorithms based on derandomized-es variants. In GECCO'07: Proceedings of the 9th annual conference on Genetic and evolutionary computation, pages 705-712, New York, NY, USA, 2007. ACM.
24. Stefan Bird and Xiaodong Li. Adaptively choosing niching parameters in a pso. In GECCO'06: Proceedings of the 8th annual conference on Genetic and evolutionary computation, pages 3-10, New York, NY, USA, 2006. ACM.