J. Aubin, Viability Theory, 1991.
DOI : 10.1007/978-0-8176-4910-4
URL : https://hal.archives-ouvertes.fr/inria-00636570

Y. Bengio, Using a Financial Training Criterion Rather than a Prediction Criterion, International Journal of Neural Systems, vol.08, issue.04, pp.433-443, 1997.
DOI : 10.1142/S0129065797000422

L. Bottou and O. Bousquet, The tradeoffs of large scale learning Optimization for Machine Learning, pp.351-368, 2011.

C. G. Broyden, The Convergence of a Class of Double-rank Minimization Algorithms, IMA Journal of Applied Mathematics, vol.6, issue.3, pp.222-231, 1970.
DOI : 10.1093/imamat/6.3.222

M. Cauwet, J. Liu, and O. Teytaud, Algorithm portfolios for noisy optimization, Learning and Intelligent Optimization -8th International Conference, pp.1-15, 2014.
DOI : 10.1007/s10472-015-9486-2
URL : https://hal.archives-ouvertes.fr/hal-01223113

L. Chapel and G. Deffuant, SVM viability controller active learning, Kernel machines and Reinforcement Learning Workshop -ICML 2006. United States. URL https, 2006.
URL : https://hal.archives-ouvertes.fr/hal-00616861

G. Chaslot, M. Winands, I. Szita, and H. Van-den-herik, Parameter tuning by cross entropy method, European Workshop on Reinforcement Learning. URL http, 2008.

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

H. F. Chen, T. E. Duncan, and B. Pasik-duncan, A stochastic approximation algorithm with random differences, Proceedings of the 13th IFAC World Congress, pp.493-496, 1996.

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

R. Coulom, P. Rolet, N. Sokolovska, and O. Teytaud, Handling expensive optimization with large noise, Proceedings of the 11th workshop proceedings on Foundations of genetic algorithms, FOGA '11, pp.61-68, 2011.
DOI : 10.1145/1967654.1967660
URL : https://hal.archives-ouvertes.fr/hal-00517157

J. Decock and O. Teytaud, Noisy optimization complexity under locality assumption, Proceedings of the twelfth workshop on Foundations of genetic algorithms XII, FOGA XII '13, pp.183-190, 2013.
DOI : 10.1145/2460239.2460256
URL : https://hal.archives-ouvertes.fr/hal-00755663

V. Dupa?, O Kiefer-Wolfowitzov? aproxima?ní Method?. ? Casopis pro p?stování matematiky, pp.47-75, 1957.

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

V. Fabian, Stochastic Approximation. SLP. Department of Statistics and Probability, 1971.

R. Fletcher, A new approach to variable metric algorithms, The Computer Journal, vol.13, issue.3, pp.317-322, 1970.
DOI : 10.1093/comjnl/13.3.317

D. Goldfarb, A family of variable-metric methods derived by variational means, Mathematics of Computation, vol.24, issue.109, pp.23-26, 1970.
DOI : 10.1090/S0025-5718-1970-0258249-6

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

M. Jebalia and A. Auger, On multiplicative noise models for stochastic search Conference on Parallel Problem Solving from Nature (PPSN X), pp.52-61, 2008.

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

J. Kiefer and J. Wolfowitz, Stochastic Estimation of the Maximum of a Regression Function, The Annals of Mathematical Statistics, vol.23, issue.3, pp.462-466, 1952.
DOI : 10.1214/aoms/1177729392

J. Liu and O. Teytaud, Meta online learning: Experiments on a unit commitment problem, 22th European Symposium on Artificial Neural Networks, 2014.
URL : https://hal.archives-ouvertes.fr/hal-00973397

M. J. Powell, The NEWUOA software for unconstrained optimization without derivatives, 2004.
DOI : 10.1007/0-387-30065-1_16

M. J. Powell, Developments of NEWUOA for minimization without derivatives, IMA Journal of Numerical Analysis, vol.28, issue.4, 2008.
DOI : 10.1093/imanum/drm047

H. Robbins and S. Monro, A stochastic approximation method. The Annals of, Mathematical Statistics, vol.23, pp.22-400, 1951.

P. Rolet and O. Teytaud, Bandit-Based Estimation of Distribution Algorithms for Noisy Optimization: Rigorous Runtime Analysis, Proceedings of Lion4, pp.97-110, 2009.
DOI : 10.1007/978-3-642-13800-3_8
URL : https://hal.archives-ouvertes.fr/inria-00437140

P. Rolet, O. Teytaud, C. Di-chio, S. Cagnoni, C. Cotta et al., Adaptive Noisy Optimization, of Lecture Notes in Computer Science, pp.592-601, 2010.
DOI : 10.1007/978-3-642-12239-2_61
URL : https://hal.archives-ouvertes.fr/inria-00459017

R. Ros, Benchmarking the NEWUOA on the BBOB-2009 noisy testbed, Proceedings of the 11th annual conference companion on Genetic and evolutionary computation conference, GECCO '09, 2009.
DOI : 10.1145/1570256.1570339
URL : https://hal.archives-ouvertes.fr/inria-00377083

D. Sakrison, A Continuous Kiefer-Wolfowitz Procedure for Random Processes, The Annals of Mathematical Statistics, vol.35, issue.2, pp.590-599, 1964.
DOI : 10.1214/aoms/1177703558

F. Sehnke, C. Osendorfer, T. Rückstiess, A. Graves, J. Peters et al., Parameter-exploring policy gradients, intelligent Autonomous Systems. URL http, pp.551-559, 2010.
DOI : 10.1016/j.neunet.2009.12.004

O. Shamir, On the complexity of bandit and derivative-free stochastic convex optimization, COLT 2013 -The 26th Annual Conference on Learning Theory, pp.3-24, 2013.

D. F. Shanno, Conditioning of quasi-Newton methods for function minimization, Mathematics of Computation, vol.24, issue.111, pp.647-656, 1970.
DOI : 10.1090/S0025-5718-1970-0274029-X

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.

J. C. Spall, Introduction to stochastic search and optimization: Estimation, simulation, and control, 2003.
DOI : 10.1002/0471722138

G. Stoltz, S. Bubeck, and R. Munos, Pure exploration in finitely-armed and continuous-armed bandits, Theoretical Computer Science, vol.412, pp.1832-1852, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00609550

V. N. Vapnik, The Nature of Statistical Learning, 1995.

X. Zhan, Extremal Eigenvalues of Real Symmetric Matrices with Entries in an Interval, SIAM Journal on Matrix Analysis and Applications, vol.27, issue.3, pp.851-860, 2005.
DOI : 10.1137/050627812