D. W. Aha, Generalizing from Case Studies: A Case Study, Proceedings of the 9th International Workshop on Machine Learning, pp.1-10, 1992.
DOI : 10.1016/B978-1-55860-247-2.50006-1

W. Armstrong, P. Christen, E. Mccreath, and A. P. Rendell, Dynamic Algorithm Selection Using Reinforcement Learning, 2006 International Workshop on Integrating AI and Data Mining, pp.18-25, 2006.
DOI : 10.1109/AIDM.2006.4
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.62.8228

D. V. Arnold and H. G. Beyer, A general noise model and its effects on evolution strategy performance, IEEE Transactions on Evolutionary Computation, vol.10, issue.4, pp.380-391, 2006.
DOI : 10.1109/TEVC.2005.859467

S. Astete-morales, J. Liu, and O. Teytaud, Log-log Convergence for Noisy Optimization, Proceedings of EA 2013, pp.16-28, 2013.
DOI : 10.1007/978-3-319-11683-9_2
URL : https://hal.archives-ouvertes.fr/hal-01107772

S. Astete-morales, M. L. Cauwet, J. Liu, and O. Teytaud, Simple and cumulative regret for continuous noisy optimization, Theoretical Computer Science, vol.617, 2015.
DOI : 10.1016/j.tcs.2015.09.032
URL : https://hal.archives-ouvertes.fr/hal-01194564

P. Auer, Using confidence bounds for exploitation-exploration trade-offs, The Journal of Machine Learning Research, vol.3, pp.397-422, 2003.

P. Auer, N. Cesa-bianchi, Y. Freund, and R. E. Schapire, Gambling in a rigged casino: The adversarial multi-armed bandit problem, Proceedings of IEEE 36th Annual Foundations of Computer Science, pp.322-331, 1995.
DOI : 10.1109/SFCS.1995.492488

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

H. G. Beyer, Actuator Noise in Recombinant Evolution Strategies on General Quadratic Fitness Models, Genetic and Evolutionary Computation, pp.654-665, 2004.
DOI : 10.1007/978-3-540-24854-5_68

J. Borrett and E. P. Tsang, Towards a formal framework for comparing constraint satisfaction problem formulations, 1996.

S. Bubeck, R. Munos, and G. Stoltz, Pure Exploration in Multi-armed Bandits Problems, In: ALT. pp, vol.58, issue.1, pp.23-37, 2009.
DOI : 10.1090/S0002-9904-1952-09620-8

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

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

A. Conn, K. Scheinberg, and P. Toint, Recent progress in unconstrained nonlinear optimization without derivatives, Mathematical Programming, vol.12, issue.1, pp.397-414, 1997.
DOI : 10.1007/BF02614326

A. Couetoux, Monte Carlo Tree Search for Continuous and Stochastic Sequential Decision Making Problems. Theses, 2013.
URL : https://hal.archives-ouvertes.fr/tel-00927252

R. Coulom, CLOP: Confident Local Optimization for Noisy??Black-Box Parameter Tuning, Advances in Computer Games, pp.146-157, 2012.
DOI : 10.1007/978-3-642-31866-5_13
URL : https://hal.archives-ouvertes.fr/hal-00750326

V. Fabian, Stochastic approximation Optimization methods in Statistics ; proceedings Symposium, pp.439-470, 1971.

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

M. Gagliolo and J. Schmidhuber, A neural network model for inter-problem adaptive online time allocation, 15th International Conference on Artificial Neural Networks: Formal Models and Their Applications, pp.7-12, 2005.

M. Gagliolo and J. Schmidhuber, Learning dynamic algorithm portfolios, Annals of Mathematics and Artificial Intelligence, vol.18, issue.2, pp.295-328, 2006.
DOI : 10.1007/s10472-006-9036-z
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.225.1145

M. D. Grigoriadis and L. G. Khachiyan, A sublinear-time randomized approximation algorithm for matrix games, Operations Research Letters, vol.18, issue.2, pp.53-58, 1995.
DOI : 10.1016/0167-6377(95)00032-0

Y. Hamadi, Combinatorial Search: From Algorithms to Systems, 2013.
DOI : 10.1007/978-3-642-41482-4

M. Jebalia, A. Auger, and N. Hansen, Log linear convergence and divergence of the scaleinvariant (1+1)-ES in noisy environments, Algorithmica, 2010.
URL : https://hal.archives-ouvertes.fr/inria-00433347

Y. Jin and J. Branke, Evolutionary Optimization in Uncertain Environments???A Survey, IEEE Transactions on Evolutionary Computation, vol.9, issue.3, pp.303-317, 2005.
DOI : 10.1109/TEVC.2005.846356

S. Kadioglu, Y. Malitsky, A. Sabharwal, H. Samulowitz, and M. Sellmann, Algorithm Selection and Scheduling, 17th International Conference on Principles and Practice of Constraint Programming, pp.454-469, 2011.
DOI : 10.1007/978-3-642-23786-7_35

L. Kotthoff, Algorithm Selection for Combinatorial Search Problems: A Survey, p.7959, 1210.
DOI : 10.1007/978-3-642-31612-8_18

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
URL : http://doi.org/10.1016/0196-8858(85)90002-8

J. Liu and O. Teytaud, Meta online learning: experiments on a unit commitment problem, European Symposium on Artificial Neural Networks, Computational Intelligence and Machine Learning, 2014.
URL : https://hal.archives-ouvertes.fr/hal-00973397

A. Prügel-bennett, Benefits of a Population: Five Mechanisms That Advantage Population-Based Algorithms, IEEE Transactions on Evolutionary Computation, vol.14, issue.4, pp.500-517, 2009.
DOI : 10.1109/TEVC.2009.2039139

L. Pulina and A. Tacchella, A self-adaptive multi-engine solver for quantified Boolean formulas, Constraints, vol.2, issue.1, pp.80-116, 2009.
DOI : 10.1007/s10601-008-9051-2

P. Rolet and O. Teytaud, Adaptive Noisy Optimization, pp.592-601, 2010.
DOI : 10.1007/978-3-642-12239-2_61
URL : https://hal.archives-ouvertes.fr/inria-00459017

H. Samulowitz and R. Memisevic, Learning to solve qbf, Proceedings of the 22nd National Conference on Artificial Intelligence, pp.255-260, 2007.

B. Sendhoff, H. G. Beyer, and M. Olhofer, The influence of stochastic quality functions on evolutionary search. Recent Advances in Simulated Evolution and Learning, ser Advances in Natural Computation pp, pp.152-172, 2004.

O. Shamir, On the complexity of bandit linear optimization, Proceedings of The 28th Conference on Learning Theory, COLT 2015, pp.1523-1551, 2015.

J. Spall, Adaptive stochastic approximation by the simultaneous perturbation method. Automatic Control, IEEE Transactions on, vol.45, issue.10, pp.1839-1853, 2000.

J. Spall, Feedback and weighting mechanisms for improving jacobian estimates in the adaptive simultaneous perturbation algorithm. Automatic Control, IEEE Transactions on, vol.54, issue.6, pp.1216-1229, 2009.

D. L. St-pierre and J. Liu, Differential Evolution algorithm applied to non-stationary bandit problem, 2014 IEEE Congress on Evolutionary Computation (CEC), 2014.
DOI : 10.1109/CEC.2014.6900505
URL : https://hal.archives-ouvertes.fr/hal-00979456

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-3591008202821328, 1997.
DOI : 10.1023/A:1008202821328

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

P. E. Utgoff, Perceptron Trees: A Case Study in Hybrid Concept Representations, National Conference on Artificial Intelligence, pp.601-606, 1988.
DOI : 10.1023/A:1022699900025

V. Vassilevska, R. Williams, and S. L. Woo, Confronting hardness using a hybrid approach, Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm , SODA '06, pp.1-10, 2006.
DOI : 10.1145/1109557.1109558

A. Weinstein and M. L. Littman, Bandit-based planning and learning in continuous-action markov decision processes, Proceedings of the Twenty-Second International Conference on Automated Planning and Scheduling, ICAPS 2012, p.4697, 2012.

D. H. Wolpert and W. G. Macready, No free lunch theorems for optimization, IEEE Transactions on Evolutionary Computation, vol.1, issue.1, pp.67-82, 1997.
DOI : 10.1109/4235.585893

L. Xu, F. Hutter, H. H. Hoos, and K. Leyton-brown, Hydra-mip: automated algorithm configuration and selection for mixed integer programming, RCRA Workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion at the International Joint Conference on Artificial Intelligence (IJCAI), 2011.

L. Xu, F. Hutter, H. H. Hoos, and K. Leyton-brown, SATzilla: Portfolio-based algorithm selection for SAT, J. Artif. Intell. Res. (JAIR), vol.32, pp.565-606, 2008.