T. M. Alkhamis, M. A. Ahmed, T. , and V. K. , Simulated annealing for discrete optimization with estimation, European Journal of Operational Research, vol.116, issue.3, pp.530-544, 1999.
DOI : 10.1016/S0377-2217(98)00112-X

C. Andrieu and J. Thoms, A tutorial on adaptive MCMC, Statistics and Computing, vol.61, issue.3, pp.343-373, 2008.
DOI : 10.1007/s11222-008-9110-y

J. Audibert, R. Munos, and C. Szepesvári, Exploration-exploitation trade-off using variance estimates in multi-armed bandits, Theoretical Computer Science, 2009.

R. Bardenet and O. Maillard, Concentration inequalities for sampling without replacement, Bernoulli, vol.21, issue.3
DOI : 10.3150/14-BEJ605
URL : https://hal.archives-ouvertes.fr/hal-01216652

A. A. Bulgak and J. L. Sanders, Integrating a modified simulated annealing algorithm with the simulation of a manufacturing system to optimize buffer sizes in automatic assembly systems, Proceedings of the 20th Winter Simulation Conference, 1988.

N. Cesa-bianchi and G. Lugosi, Combinatorial bandits, Proceedings of the 22nd Annual Conference on Learning Theory, 2009.
DOI : 10.1016/j.jcss.2012.01.001

R. Collobert, S. Bengio, and Y. Bengio, A Parallel Mixture of SVMs for Very Large Scale Problems, Neural Computation, vol.20, issue.5, pp.1105-1114, 2002.
DOI : 10.1162/neco.1991.3.1.79

C. Domingo and O. Watanabe, MadaBoost: a modification of AdaBoost, Proceedings of the Thirteenth Annual Conference on Computational Learning Theory (COLT), 2000.

D. Ferré, L. Hervé, and J. Ledoux, Regular Perturbation of V-Geometrically Ergodic Markov Chains, Journal of Applied Probability, vol.26, issue.01, pp.184-194, 2013.
DOI : 10.1239/jap/1032192546

A. Gelman, A. Jakulin, M. G. Pittau, and Y. Su, A weakly informative default prior distribution for logistic and other regression models, The Annals of Applied Statistics, vol.2, issue.4, 2008.
DOI : 10.1214/08-AOAS191

H. Haario, E. Saksman, and J. And-tamminen, An Adaptive Metropolis Algorithm, Bernoulli, vol.7, issue.2, pp.223-242, 2001.
DOI : 10.2307/3318737

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

A. Korattikara, Y. Chen, and M. Welling, Austerity in MCMC land: Cutting the Metropolis-Hastings budget, Proceedings of the International Conference on Machine Learning (ICML), 2014.

O. Maron and A. Moore, Hoeffding races: Accelerating model selection search for classification and function approximation, Advances in Neural Information Processing Systems, 1993.

V. Mnih, Efficient stopping rules, 2008.

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

C. P. Robert and G. Casella, Monte Carlo Statistical Methods, 2004.

G. O. Roberts and J. S. Rosenthal, Optimal scaling for various Metropolis-Hastings algorithms, Statistical Science, vol.16, issue.4, pp.351-367, 2001.
DOI : 10.1214/ss/1015346320

R. J. Serfling, Probability inequalities for the sum in sampling without replacement. The Annals of Statistics, pp.39-48, 1974.

S. Singh, M. Wick, and A. Mccallum, Monte carlo mcmc: Efficient inference by approximate sampling, Proceedings of the Joint Conference on Empirical Methods in Natural Language Processing and Computational Natural Language Learning, 2012.

A. W. Van-der-vaart, Asymptotic Statistics, 2000.
DOI : 10.1017/CBO9780511802256

L. Wang and L. Zhang, Stochastic optimization using simulated annealing with hypothesis test, Applied Mathematics and Computation, vol.174, issue.2, pp.1329-1342, 2006.
DOI : 10.1016/j.amc.2005.05.038