D. V. Arnold and H. Beyer, Efficiency and mutation strength adaptation of the (mu/mui,lambda)-es in a noisy environment, Parallel Problem Solving from Nature, pp.39-48, 1917.

D. V. Arnold and H. Beyer, Evolution strategies with cumulative step length adaptation on the noisy parabolic ridge, Natural Computing, vol.2, issue.2, 2006.
DOI : 10.1007/s11047-006-9025-5

D. V. Arnold and D. C. Wart, Cumulative Step Length Adaptation for Evolution Strategies Using Negative Recombination Weights, EvoWorkshops, pp.545-554, 2008.
DOI : 10.1007/978-3-540-78761-7_60

P. Auer, N. Cesa-bianchi, and P. Fischer, Finite time analysis of the multiarmed bandit problem, Machine Learning, vol.47, issue.2/3, pp.235-256, 2002.
DOI : 10.1023/A:1013689704352

A. Auger, Convergence results for the <mml:math altimg="si1.gif" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:cals="http://www.elsevier.com/xml/common/cals/dtd"><mml:mo stretchy="false">(</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mi>??</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math>-SA-ES using the theory of <mml:math altimg="si2.gif" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:cals="http://www.elsevier.com/xml/common/cals/dtd"><mml:mi>??</mml:mi></mml:math>-irreducible Markov chains, Theoretical Computer Science, vol.334, issue.1-3, pp.35-69, 2005.
DOI : 10.1016/j.tcs.2004.11.017

S. Bernstein, On a modification of chebyshev's inequality and of the error formula of laplace. Original publication, Ann. Sci. Inst. Sav. Ukraine, Sect. Math, vol.1, issue.31, pp.38-49, 1924.

S. Bernstein, The Theory of Probabilities, 1946.

H. Beyer, The Theory of Evolutions Strategies, 2001.
DOI : 10.1007/978-3-662-04378-3

A. Bienvenue and O. Francois, Global convergence for evolution strategies in spherical problems: some simple proofs and difficulties, Theoretical Computer Science, vol.306, issue.1-3, pp.269-289, 2003.
DOI : 10.1016/S0304-3975(03)00284-6

H. Chernoff, A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations, The Annals of Mathematical Statistics, vol.23, issue.4, pp.493-509, 1952.
DOI : 10.1214/aoms/1177729330

L. Devroye, L. Györfi, and G. Lugosi, A probabilistic Theory of Pattern Recognition, 1997.
DOI : 10.1007/978-1-4612-0711-5

J. M. Fitzpatrick and J. J. Grefenstette, Genetic algorithms in noisy environments, Machine Learning, pp.101-120, 1988.
DOI : 10.1007/BF00113893

S. Gelly, S. Ruette, and O. Teytaud, Comparison-Based Algorithms Are Robust and Randomized Algorithms Are Anytime, Evolutionary Computation, vol.26, issue.3, pp.411-434, 2007.
DOI : 10.1137/0801010
URL : https://hal.archives-ouvertes.fr/inria-00173221

U. Hammel and T. Bäck, Evolution strategies on noisy functions how to improve convergence properties, Parallel Problem Solving From Nature, pp.159-168, 1994.
DOI : 10.1007/3-540-58484-6_260

N. Hansen and A. Ostermeier, Completely Derandomized Self-Adaptation in Evolution Strategies, Evolutionary Computation, vol.9, issue.2, 2003.
DOI : 10.1016/0004-3702(95)00124-7

V. Heidrich-meisner and C. Igel, Hoeffding and Bernstein races for selecting policies in evolutionary direct policy search, Proceedings of the 26th Annual International Conference on Machine Learning, ICML '09, pp.401-408, 2009.
DOI : 10.1145/1553374.1553426

W. Hoeffding, Probability Inequalities for Sums of Bounded Random Variables, Journal of the American Statistical Association, vol.1, issue.301, pp.13-30, 1963.
DOI : 10.1214/aoms/1177730491

M. Jebalia and A. Auger, On Multiplicative Noise Models for Stochastic Search, Parallel Problem Solving From Nature, dortmund Allemagne, 2008.
DOI : 10.1007/978-3-540-87700-4_6
URL : https://hal.archives-ouvertes.fr/inria-00287725

T. Lai and H. Robbins, Asymptotically efficient adaptive allocation rules, Advances in Applied Mathematics, vol.6, issue.1, pp.4-22, 1985.
DOI : 10.1016/0196-8858(85)90002-8

O. Maron and A. W. Moore, Hoeffding races: Accelerating model selection search for classification and function approximation, Advances in neural information processing systems 6, pp.59-66, 1994.

O. Maron and A. W. Moore, The Racing Algorithm: Model Selection for Lazy Learners, Artificial Intelligence Review, vol.11, pp.193-225, 1997.
DOI : 10.1007/978-94-017-2053-3_8

V. Mnih, C. Szepesvári, and J. Audibert, Empirical Bernstein stopping, Proceedings of the 25th international conference on Machine learning, ICML '08, pp.672-679, 2008.
DOI : 10.1145/1390156.1390241
URL : https://hal.archives-ouvertes.fr/hal-00834983

I. Rechenberg, Evolutionstrategie: Optimierung Technischer Systeme nach Prinzipien des Biologischen Evolution, 1973.

H. Schwefel, Numerical Optimization of Computer Models, 1981.

O. Teytaud and A. Auger, On the adaptation of noise level for stochastic optimization, 2007 IEEE Congress on Evolutionary Computation, 2007.
DOI : 10.1109/CEC.2007.4424857
URL : https://hal.archives-ouvertes.fr/inria-00173224