H. Robbins, Some aspects of the sequential design of experiments, Bulletin of the American Mathematical Society, vol.55, 1952.

S. Bubeck, R. Munos, and G. Stoltz, Pure Exploration in Multi-armed Bandits Problems, Algorithmic Learning Theory, pp.23-37, 2009.
DOI : 10.1090/S0002-9904-1952-09620-8

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

L. Kocsis and C. Szepesvári, Discounted ucb, 2nd PASCAL Challenges Workshop, 2006.

J. Audibert, R. Munos, and C. Szepesvári, Tuning Bandit Algorithms in Stochastic Environments, Algorithmic Learning Theory, pp.150-165, 2007.
DOI : 10.1093/biomet/25.3-4.285
URL : https://hal.archives-ouvertes.fr/inria-00203487

D. Koulouriotis and A. Xanthopoulos, Reinforcement learning and evolutionary algorithms for non-stationary multi-armed bandit problems, Applied Mathematics and Computation, vol.196, issue.2, pp.913-922, 2008.
DOI : 10.1016/j.amc.2007.07.043

R. Storn and K. Price, Differential evolution?a simple and efficient heuristic for global optimization over continuous spaces, Journal of Global Optimization, vol.11, issue.4, pp.341-359, 1997.
DOI : 10.1023/A:1008202821328

D. Ardia, J. David, O. Arango, and N. D. Gómez, Jump-Diffusion Calibration Using Differential Evolution, Wilmott, vol.2011, issue.55, pp.76-79, 2011.
DOI : 10.1002/wilm.10034

D. Ardia, K. Boudt, P. Carl, K. Mullen, and B. Peterson, Differential evolution with deoptim: An application to non-convex portfolio optimization, The R Journal, vol.3, issue.1, pp.27-34, 2011.

P. Poaík and V. Klema, JADE, an adaptive differential evolution algorithm, benchmarked on the BBOB noiseless testbed, Proceedings of the fourteenth international conference on Genetic and evolutionary computation conference companion, GECCO Companion '12, pp.197-204, 2012.
DOI : 10.1145/2330784.2330814

J. Brest, S. Greiner, B. Boskovic, M. Mernik, and V. Zumer, Self-Adapting Control Parameters in Differential Evolution: A Comparative Study on Numerical Benchmark Problems, IEEE Transactions on Evolutionary Computation, vol.10, issue.6, pp.646-657, 2005.
DOI : 10.1109/TEVC.2006.872133

L. S. Coelho and V. C. Mariani, Combining of chaotic differential evolution and quadratic programming for economic dispatch optimization with valve-point effect, Power Systems IEEE Transactions on, vol.21, issue.2, pp.989-996, 2006.

K. V. Price, R. M. Storn, and J. A. Lampinen, Differential evolution a practical approach to global optimization, 2005.

C. Chou, P. Chou, C. Lee, D. L. Saint-pierre, O. Teytaud et al., Strategic Choices: Small Budgets and Simple Regret, 2012 Conference on Technologies and Applications of Artificial Intelligence, pp.182-187, 2012.
DOI : 10.1109/TAAI.2012.35
URL : https://hal.archives-ouvertes.fr/hal-00753145

A. Garivier and E. Moulines, On upper-confidence bound policies for non-stationary bandit problems, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00281392

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

A. Weinstein and M. L. Littman, Bandit-based planning and learning in continuous-action markov decision processes, ICAPS, 2012.

R. S. Sutton and A. G. Barto, Reinforcement Learning: An Introduction, IEEE Transactions on Neural Networks, vol.9, issue.5, 1998.
DOI : 10.1109/TNN.1998.712192

A. Morales, J. Liu, and O. Teytaud, Noisy optimization convergence rates, " in Proceeding of the Fifteenth Annual Conference Companion on Genetic and Evolutionary Computation Conference Companion, ser. GECCO '13 Companion, pp.223-224, 2013.

V. Fabian, Stochastic Approximation of Minima with Improved Asymptotic Speed, The Annals of Mathematical Statistics, vol.38, issue.1, pp.191-200, 1967.
DOI : 10.1214/aoms/1177699070

H. Chen, Lower Rate of Convergence for Locating a Maximum of a Function, The Annals of Statistics, vol.16, issue.3, pp.1330-1334, 1988.
DOI : 10.1214/aos/1176350965

O. Shamir, On the complexity of bandit and derivative-free stochastic convex optimization, 1209.

S. A. Morales, M. Cauwet, J. Liu, and O. Teytaud, Noisy optimization rates
URL : https://hal.archives-ouvertes.fr/hal-00863584

M. Cauwet, J. Liu, and O. Teytaud, Algorithm Portfolios for Noisy Optimization: Compare Solvers Early, Proceedings of the 8th Conference on Learning and Intelligent Optimization, 2014.
DOI : 10.1007/978-3-319-09584-4_1
URL : https://hal.archives-ouvertes.fr/hal-00926638