P. Ernesto, U. Adorio, and . Diliman, Mvf-multivariate test functions library in c for unconstrained global optimization, 2005.

A. Auger and N. Hansen, A Restart CMA Evolution Strategy With Increasing Population Size, 2005 IEEE Congress on Evolutionary Computation, pp.1769-1776, 2005.
DOI : 10.1109/CEC.2005.1554902

A. Auger, N. Hansen, and M. Schoenauer, Benchmarking of Continuous Black Box Optimization Algorithms, Evolutionary Computation, vol.20, issue.4, 2012.
DOI : 10.1162/EVCO_e_00091

URL : http://www.mitpressjournals.org/userimages/ContentEditor/1164817256746/lib_rec_form.pdf

[. and M. Laguna, Fine-tuning of algorithms using fractional experimental designs and local search, Operations Research, vol.541, pp.99-114, 2006.

A. Altenberg, The evolution of evolvability in genetic programming, Advances in genetic programming 3, pp.47-74, 1994.

[. Abell, Y. Malitsky, and K. Tierney, Fitness landscape based features for exploiting black-box optimization problem structure, pp.75-143, 2012.
DOI : 10.1007/978-3-642-44973-4_4

M. Andersson, Parameter tuned CMA-ES on the CEC'15 expensive problems, 2015 IEEE Congress on Evolutionary Computation (CEC), pp.1950-1957
DOI : 10.1109/CEC.2015.7257124

URL : http://his.diva-portal.org/smash/get/diva2:860215/FULLTEXT01

C. Audet and D. Orban, Finding optimal algorithmic parameters using a mesh adaptive direct search, 2004.
DOI : 10.1137/040620886

[. Ansótegui, M. Sellmann, and K. Tierney, A genderbased genetic algorithm for the automatic configuration of algorithms, International Conference on Principles and Practice of Constraint Programming, pp.142-157, 2009.

A. Auger and O. Teytaud, Continuous Lunches Are Free Plus the Design of??Optimal Optimization Algorithms, Algorithmica, vol.1, issue.1, pp.121-146, 2010.
DOI : 10.1109/CEC.2006.1688620

URL : https://hal.archives-ouvertes.fr/inria-00369788

A. Auger, Experimental Comparisons of Derivative Free Optimization Algorithms, 8th International Symposium on Experimental Algorithms Vahrenhold, 2009.
DOI : 10.1109/CEC.2005.1554903

URL : https://hal.archives-ouvertes.fr/inria-00397334

[. Amari and S. Wu, Improving support vector machine classifiers by modifying kernel functions, Neural Networks, vol.12, issue.6, pp.783-789, 1999.
DOI : 10.1016/S0893-6080(99)00032-5

URL : http://www.islab.brain.riken.go.jp/~phwusi/GKSVM.ps

[. Bartz-beielstein, Sequential Parameter Optimization, 2005 IEEE Congress on Evolutionary Computation, 2009.
DOI : 10.1109/CEC.2005.1554761

L. Barnett, TANGLED WEBS ? Evolutionary Dynamics on Fitness Landscapes with Neutrality. MSc dissertation, School of Cognitive Sciences, 1997.

L. Barnett, Ruggedness and neutrality: The NKP family of fitness landscapes, Artificial Life VI: Proceedings of the sixth international conference on Artificial life, pp.18-27, 1998.

F. Markus, W. Brameier, and . Banzhaf, Linear genetic programming, 2007.

[. Balaprakash, M. Birattari, and T. Stützle, Improvement Strategies for the F-Race Algorithm: Sampling Design and Iterative Refinement, International Workshop on Hybrid Metaheuristics, pp.108-122, 2007.
DOI : 10.1007/978-3-540-75514-2_9

M. Birattari and M. Dorigo, The problem of tuning metaheuristics as seen from a machine learning perspective, 2004.

E. George, N. R. Box, and . Draper, Evolutionary operation: a method for increasing industrial productivity, 1969.

[. Beauchamp, Walsh functions and their applications Academic press, 1975.

J. Bensadon, Black-Box Optimization Using Geodesics in Statistical Manifolds, Entropy, vol.15, issue.1, pp.304-345, 2015.
DOI : 10.1023/B:NACO.0000023416.59689.4e

URL : http://www.mdpi.com/1099-4300/17/1/304/pdf

E. Bernhard, . Boser, M. Isabelle, . Guyon, N. Vladimir et al., A training algorithm for optimal margin classifiers, Proceedings of the fifth annual workshop on Computational learning theory, pp.144-152, 1992.

E. George, J. Box, and . Hunter, The 2 k?p fractional factorial designs, pp.311-351, 1961.

[. Birattari, A Racing Algorithm for Configuring Metaheuristics, In: GECCO, vol.2, pp.11-18, 2002.

[. Birattari, F-Race and iterated F-Race: An overview " . In: Experimental methods for the analysis of optimization algorithms, pp.311-336, 2010.
DOI : 10.1007/978-3-642-02538-9_13

URL : http://iridia.ulb.ac.be/IridiaTrSeries/IridiaTr2009-018r001.pdf

M. Birattari, The Problem of Tuning Metaheuristics, Dissertations in Artificial Intelligence {IOS Press}, vol.292, 2005.

[. Bischl, Algorithm selection based on exploratory landscape analysis and cost-sensitive learning, Proceedings of the fourteenth international conference on Genetic and evolutionary computation conference, GECCO '12
DOI : 10.1145/2330163.2330209

[. Blot, MO-ParamILS: A Multi-objective Automatic Algorithm Configuration Framework, International Conference on Learning and Intelligent Optimization, pp.32-47, 2016.
DOI : 10.1145/2739480.2754791

URL : https://hal.archives-ouvertes.fr/hal-01370392

[. Bartz-beielstein, W. Christian, M. Lasarczyk, and . Preuß, Sequential Parameter Optimization, 2005 IEEE Congress on Evolutionary Computation, pp.773-780, 2005.
DOI : 10.1109/CEC.2005.1554761

[. Bartz-beielstein and S. Markon, Tuning search algorithms for real-world applications: a regression tree based approach, Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753), pp.1111-1118, 2004.
DOI : 10.1109/CEC.2004.1330986

URL : http://sfbci.uni-dortmund.de/home/English/Publications/Reference/Downloads/BBM04.pdf

[. , R. Bonyadi, and Z. Michalewicz, A locally convergent rotationally invariant particle swarm optimization algorithm, In: Swarm Intelligence, vol.83, pp.159-198, 2014.
DOI : 10.1007/s11721-014-0095-1

[. , R. Bonyadi, and Z. Michalewicz, Particle swarm optimization for single objective continuous space problems: a review, In: Evolutionary computation, 2016.

J. Bossek, Learning Feature-Parameter Mappings for Parameter Tuning via the Profile Expected Improvement, Proceedings of the 2015 on Genetic and Evolutionary Computation Conference, GECCO '15, pp.1319-1326
DOI : 10.1162/EVCO_a_00061

E. George and . Box, Evolutionary operation: A method for increasing industrial productivity, In: Applied Statistics, pp.81-101, 1957.

[. Bajer, Z. Pitra, and M. Hole?a, Benchmarking Gaussian Processes and Random Forests Surrogate Models on the BBOB Noiseless Testbed, Proceedings of the Companion Publication of the 2015 on Genetic and Evolutionary Computation Conference, GECCO Companion '15, pp.1143-1150
DOI : 10.2514/2.1999

J. Brest, Self-Adapting Control Parameters in Differential Evolution: A Comparative Study on Numerical Benchmark Problems, IEEE transactions on evolutionary computation 10, pp.646-657, 2006.
DOI : 10.1109/TEVC.2006.872133

J. Brest, Dynamic optimization using Self-Adaptive Differential Evolution, 2009 IEEE Congress on Evolutionary Computation, pp.415-422, 2009.
DOI : 10.1109/CEC.2009.4982976

L. Breiman, Random forests, Machine learning 45, pp.5-32, 2001.

J. Hans and . Bremermann, Optimization through evolution and recombination, Self-organizing systems 93, p.106, 1962.

[. Brockhoff, Mirrored Sampling and Sequential Selection for Evolution Strategies, In: Parallel Problem Solving from Nature, PPSN XI, pp.11-21, 2010.
DOI : 10.1007/978-3-642-15844-5_2

URL : https://hal.archives-ouvertes.fr/inria-00530202

[. Bremermann, S. Rogson, and . Salaff, Search by evolution, Biophysics and Cybernetic Systems, pp.157-167, 1965.

[. Beyer and H. Schwefel, Evolution strategies? A comprehensive introduction, Natural Computing, vol.1, issue.1, pp.3-52, 2002.
DOI : 10.1023/A:1015059928466

[. Burges, Learning to rank using gradient descent, Proceedings of the 22nd international conference on Machine learning , ICML '05, pp.89-96, 2005.
DOI : 10.1145/1102351.1102363

URL : http://imls.engr.oregonstate.edu/www/htdocs/proceedings/icml2005/papers/012_LearningToRank_BurgesEtAl.pdf

[. Brest, V. Zumer, and M. Maucec, Self-Adaptive Differential Evolution Algorithm in Constrained Real-Parameter Optimization, 2006 IEEE International Conference on Evolutionary Computation, pp.215-222, 2006.
DOI : 10.1109/CEC.2006.1688311

[. Cagnoni, Real-World Applications of Evolutionary Computing: EvoWorkshops, Proceedings. Springer Science & Business Media, vol.1803, 2000.
DOI : 10.1007/3-540-45561-2

Z. Cao, Learning to rank, Proceedings of the 24th international conference on Machine learning, ICML '07, pp.129-136, 2007.
DOI : 10.1145/1273496.1273513

[. Cheng, X. Chen, and . Wu, Continuous ant colony optimization system based on normal distribution model of pheromone, Systems Engineering and Electronics, vol.283, pp.458-462, 2006.

W. Chu and Z. Ghahramani, Gaussian processes for ordinal regression, Journal of Machine Learning Research, vol.6, pp.1019-1041, 2005.

W. Chu and Z. Ghahramani, Preference learning with Gaussian processes, Proceedings of the 22nd international conference on Machine learning , ICML '05, pp.137-144, 2005.
DOI : 10.1145/1102351.1102369

S. William, . Cooper, C. Fredric, . Gey, P. Daniel et al., Probabilistic retrieval based on staged logistic regression, Proceedings of the 15th annual international ACM SIGIR conference on Research and development in information retrieval. ACM. 1992, pp.198-210

L. Chen, A Method for Solving Optimization Problem in Continuous Space Using Improved Ant Colony Algorithm, pp.61-70, 2005.
DOI : 10.1007/978-3-540-30537-8_7

W. Chu and S. Keerthi, New approaches to support vector ordinal regression, Proceedings of the 22nd international conference on Machine learning , ICML '05, pp.145-152, 2005.
DOI : 10.1145/1102351.1102370

URL : http://www.gatsby.ucl.ac.uk/~chuwei/paper/icmlsvor.pdf

[. Chen and J. Montgomery, A simple strategy to maintain diversity and reduce crowding in particle swarm optimization, Australasian Joint Conference on Artificial Intelligence, pp.281-290, 2011.

. Cor02, J. Heather, and . Cordell, Epistasis: what it means, what it doesn't mean, and statistical methods to detect it in humans, In: Human molecular genetics, vol.1120, pp.2463-2468, 2002.

P. Steven and . Coy, Using experimental design to find effective parameter settings for heuristics, Journal of Heuristics, vol.7, issue.46, pp.77-97, 2001.

L. Cramer, A representation for the adaptive generation of simple sequential programs, Proceedings of the First International Conference on Genetic Algorithms, pp.183-187, 1985.

[. Cristianini and J. Shawe-taylor, An introduction to support vector machines and other kernel-based learning methods, 2000.
DOI : 10.1017/CBO9780511801389

[. Chakraborty, R. K. Sharma, and P. Tewari, APPLICATION OF SOFT COMPUTING TECHNIQUES OVER HARD COMPUTING TECHNIQUES: A SURVEY, International Journal of Indestructible Mathematics & Computing, vol.1, issue.1, pp.8-17, 2017.

[. Collard, S. Verel, and M. Clergue, Local search heuristics: Fitness cloud versus fitness landscape, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00164910

D. Cossock and T. Zhang, Subset Ranking Using Regression, International Conference on Computational Learning Theory, pp.605-619, 2006.
DOI : 10.1007/11776420_44

. Cze08, J. Zbigniew, and . Czech, Statistical measures of a fitness landscape for the vehicle routing problem, IEEE International Symposium on Parallel and Distributed Processing, 2008.

Y. Davidor, Epistasis variance: Suitability of a representation to genetic algorithms, Complex Systems, vol.44, pp.369-383, 1990.

. Davidor, Epistasis Variance: A Viewpoint on GA-Hardness
DOI : 10.1016/B978-0-08-050684-5.50005-7

[. Dawkins, The evolution of evolvability, pp.239-255, 2003.
DOI : 10.1016/B978-012428765-5/50046-3

[. Deb and H. Beyer, Self-Adaptive Genetic Algorithms with Simulated Binary Crossover, Evolutionary Computation, vol.3, issue.2, pp.197-221, 2001.
DOI : 10.1016/0303-2647(95)01534-R

URL : http://www.mitpressjournals.org/userimages/ContentEditor/1164817256746/lib_rec_form.pdf

[. Deb and H. Beyer, Self-Adaptation in Real- Parameter Genetic Algorithms with Simulated Binary Crossover, Proc. Genetic and Evolutionary Computation Conference, pp.172-179, 1999.
DOI : 10.1162/106365601750190406

URL : http://www.mitpressjournals.org/userimages/ContentEditor/1164817256746/lib_rec_form.pdf

D. Kenneth and . Jong, Evolutionary computation: a unified approach, 2006.

D. Kenneth and . Jong, Parameter setting in EAs: a 30 year perspective " . In: Parameter setting in evolutionary algorithms, pp.1-18, 2007.

M. Dorigo and L. M. Gambardella, Ant colonies for the travelling salesman problem, Biosystems, vol.43, issue.2, pp.73-81, 1997.
DOI : 10.1016/S0303-2647(97)01708-5

URL : http://code.ulb.ac.be/dbfiles/DorGam1997bio.pdf

M. Dorigo, Optimization, learning and natural algorithms, Italy, 1992.

J. Dréo, Metaheuristics for hard optimization: methods and case studies, 2006.

J. Dréo, Using performance fronts for parameter setting of stochastic metaheuristics, Proceedings of the 11th annual conference companion on Genetic and evolutionary computation conference, GECCO '09, pp.2197-2200, 2009.
DOI : 10.1145/1570256.1570301

J. Dréo and P. Siarry, A New Ant Colony Algorithm Using the Heterarchical Concept Aimed at Optimization of Multiminima Continuous Functions, pp.216-221, 2002.
DOI : 10.1007/3-540-45724-0_18

M. Dorigo and T. Stützle, The Ant Colony Optimization Metaheuristic: Algorithms, Applications, and Advances, pp.250-285, 2003.
DOI : 10.1007/0-306-48056-5_9

J. Dréo and P. Siarry, Continuous interacting ant colony algorithm based on dense heterarchy, Future Generation Computer Systems, vol.20, issue.5, pp.841-856, 2004.
DOI : 10.1016/j.future.2003.07.015

M. Dorigo and T. Stützle, Ant Colony Optimization: Overview and Recent Advances, 2009.
DOI : 10.1007/978-1-4419-1665-5_8

URL : http://iridia.ulb.ac.be/IridiaTrSeries/IridiaTr2009-013r001.pdf

[. Das and P. Suganthan, Differential Evolution: A Survey of the State-of-the-Art, IEEE transactions on evolutionary computation, pp.4-31, 2011.
DOI : 10.1109/TEVC.2010.2059031

H. Duan, Improved ant colony algorithm for solving continuous space optimization problems, In: Journal of System Simulation, vol.195, pp.974-977, 2007.

]. A. Eib+07 and . Eiben, Parameter Control in Evolutionary Algorithms In: Parameter Setting in Evolutionary Algorithms, pp.19-46, 2007.

[. Fialho, Comparison-Based Adaptive Strategy Selection with Bandits in Differential Evolution, International Conference on Parallel Problem Solving from Nature, pp.194-203, 2010.
DOI : 10.1007/978-3-642-15844-5_20

URL : https://hal.archives-ouvertes.fr/inria-00493005

J. Lawrence and . Fogel, Autonomous automata, Industrial Research, vol.42, pp.14-19, 1962.

]. D. Fog95, Evolutionary Computation Toward a New Philosophy of Machine Intelligence, 1995.

[. Fialho and R. Ros, Adaptive Strategy Selection within Differential Evolution on the BBOB-2010 Noiseless Benchmark Research Report RR-7259, 2010.

M. Richard and . Friedberg, A learning machine: Part I, In: IBM Journal of Research and Development, vol.2, issue.1, pp.2-13, 1958.

[. Dunham and B. , JH North: A learning machine.(Part II), In: IBM-J. Res & Dev, vol.3, 1959.

[. Fonlupt, P. Robilliard, and . Preux, Fitness landscape and the behavior of heuristics, Evolution Artificielle. Citeseer, vol.97, 1997.

[. Fuhr, Optimum polynomial retrieval functions based on the probability ranking principle, ACM Transactions on Information Systems, vol.7, issue.3, pp.183-204, 1989.
DOI : 10.1145/65943.65944

[. Gratch and S. Chien, Adaptive problem-solving for large-scale scheduling problems: A case study, Journal of Artificial Intelligence Research, vol.4, pp.365-396, 1996.

J. Gratch and G. Dejong, COMPOSER: A Probabilistic Solution to the Utility Problem in Speed-up Learning, 1992.

E. David, K. Goldberg, J. Deb, and . Horn, Massive multimodality, deception, and genetic algorithms, Urbana, vol.51, p.61801, 1992.

[. Gebruers, Using CBR to Select Solution Strategies in Constraint Programming, International Conference on Case- Based Reasoning, pp.222-236, 2005.
DOI : 10.1007/11536406_19

URL : http://www.cs.ucc.ie/%7Edgb/papers/Gebruers-Et-Al-2005.pdf

C. Fredric and . Gey, Inferring probability of relevance using the method of logistic regression, SIGIR'94, pp.222-231, 1994.

[. Ginsbourger, Bayesian Adaptive Reconstruction of Profile Optima and Optimizers, SIAM/ASA Journal on Uncertainty Quantification, vol.2, issue.1, pp.490-510, 2014.
DOI : 10.1137/130949555

URL : https://hal.archives-ouvertes.fr/hal-00920154

[. Gämperle, D. Sibylle, P. Müller, and . Koumoutsakos, A parameter study for differential evolution Advances in intelligent systems, fuzzy systems, evolutionary computation, vol.10, pp.293-298, 2002.

I. Nicholas, D. Gould, P. L. Orban, and . Toint, CUTEr and SifDec: A constrained and unconstrained testing environment, revisited, In: ACM Transactions on Mathematical Software (TOMS), vol.294, issue.46, pp.373-394, 2003.

J. John and . Grefenstette, Deception Considered Harmful sk, Foundations of Genetic Algorithms, p.75, 1993.

]. J. Gre86 and . Grefenstette, Optimization of Control Parameters for Genetic Algorithms, IEEE Trans. on Systems, Man and Cybernetics SMC, vol.16, 1986.

R. Steve and . Gunn, Support vector machines for classification and regression, ISIS technical report, vol.14, 1998.

[. Hansen and A. Ostermeier, Adapting arbitrary normal mutation distributions in evolution strategies: the covariance matrix adaptation, Proceedings of IEEE International Conference on Evolutionary Computation, pp.312-317, 1996.
DOI : 10.1109/ICEC.1996.542381

[. Hansen, PSO facing non-separable and ill-conditioned problems, 2008.
URL : https://hal.archives-ouvertes.fr/inria-00250078

H. Hansen, Real-Parameter Black-Box Optimization Benchmarking 2009: Noiseless Functions Definitions, 2009.
URL : https://hal.archives-ouvertes.fr/inria-00362633

]. N. Han+09b and . Hansen, A Method for Handling Uncertainty in Evolutionary Optimization with an Application to Feedback Control of Combustion, IEEE Transactions on Evolutionary Computation, vol.131, pp.180-197, 2009.

[. Hansen, Real-Parameter Black-Box Optimization Benchmarking 2010: Experimental Setup, pp.34-36
URL : https://hal.archives-ouvertes.fr/inria-00462481

H. Hansen, Impacts of invariance in search: When CMA-ES and PSO face ill-conditioned and non-separable problems, Applied Soft Computing, vol.11, issue.8, pp.5755-5769, 2011.
DOI : 10.1016/j.asoc.2011.03.001

URL : https://hal.archives-ouvertes.fr/inria-00583669

[. Hansen, Impacts of invariance in search: When CMA-ES and PSO face ill-conditioned and non-separable problems, Applied Soft Computing, vol.11, issue.8, pp.5755-5769, 2011.
DOI : 10.1016/j.asoc.2011.03.001

URL : https://hal.archives-ouvertes.fr/inria-00583669

[. Hansen, Adaptive Encoding: How to Render Search Coordinate System Invariant, International Conference on Parallel Problem Solving from Nature, pp.205-214, 2008.
DOI : 10.1007/978-3-540-87700-4_21

URL : https://hal.archives-ouvertes.fr/inria-00287351

[. Hansen, References to CMA-ES applications, 2009.

[. Hansen, Benchmarking a BI-population CMA-ES on the BBOB-2009 function testbed, Proceedings of the 11th annual conference companion on Genetic and evolutionary computation conference, GECCO '09, pp.2389-2396, 2009.
DOI : 10.1145/1570256.1570333

URL : https://hal.archives-ouvertes.fr/inria-00382093

[. Hansen, Benchmarking the nelder-mead downhill simplex algorithm with many local restarts, Proceedings of the 11th annual conference companion on Genetic and evolutionary computation conference, GECCO '09, pp.2403-2408, 2009.
DOI : 10.1145/1570256.1570335

URL : https://hal.archives-ouvertes.fr/inria-00382104

H. Hastings, Monte Carlo sampling methods using Markov chains and their applications, Biometrika, vol.57, issue.1, pp.97-109, 1970.
DOI : 10.1093/biomet/57.1.97

M. Douglas and . Hawkins, The Problem of Overfitting, PMID: 14741005, pp.1-12, 2004.

[. Herbrich, T. Graepel, and K. Obermayer, Large margin rank boundaries for ordinal regression Advances in neural information processing systems, pp.115-132, 1999.

[. Hutter and Y. Hamadi, Parameter adjustment based on performance prediction: Towards an instance-aware problem solver, 2005.

H. Hutter, H. Holger, K. Hoos, and . Leyton-brown, Sequential Model-Based Optimization for General Algorithm Configuration Learning and Intelligent Optimization, LNCS, vol.6683, pp.507-523, 2011.

[. Hutter, H. Holger, K. Hoos, and . Leyton-brown, Sequential Model-Based Optimization for General Algorithm Configuration, Proc. LION 5, pp.507-523, 2011.
DOI : 10.1007/978-3-642-25566-3_47

URL : http://www.cs.ubc.ca/spider/hutter/papers/10-TR-SMAC.pdf

[. Hutter, H. Hoos, and K. Leyton-brown, An evaluation of sequential model-based optimization for expensive blackbox functions, Proceeding of the fifteenth annual conference companion on Genetic and evolutionary computation conference companion, GECCO '13 Companion, pp.1209-1216
DOI : 10.1145/2464576.2501592

S. [. Hansen, P. Müller, and . Koumoutsakos, Reducing the Time Complexity of the Derandomized Evolution Strategy with Covariance Matrix Adaptation (CMA-ES), Evolutionary Computation, vol.11, issue.1, pp.1-18, 2003.
DOI : 10.1162/106365601750190398

N. Ho01a, A. Hansen, and . Ostermeier, Completely Derandomized Self-Adaptation in Evolution Strategies, In: Evolutionary Computation, vol.9, issue.21, pp.159-195, 2001.

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

URL : http://www.mitpressjournals.org/userimages/ContentEditor/1164817256746/lib_rec_form.pdf

J. Henry and H. , Nonlinear environments permitting efficient adaptation, 1967.

H. John and . Holland, Adaptation in natural and artificial systems: an introductory analysis with applications to biology, control, and artificial intelligence, 1975.

H. Holger and . Hoos, Automated algorithm configuration and parameter tuning " . In: Autonomous search, pp.37-71, 2011.

H. Holger and . Hoos, Programming by optimization, Comm. of the ACM, vol.552, pp.70-80, 2012.

E. Michael and . Houle, Can shared-neighbor distances defeat the curse of dimensionality, International Conference on Scientific and Statistical Database Management, pp.482-500, 2010.

H. Holger, T. Hoos, and . Stützle, Stochastic local search: Foundations and applications, 2004.

W. Hock and K. Schittkowski, Test examples for nonlinear programming codes, Journal of Optimization Theory and Applications, vol.301, issue.104, pp.127-129, 1980.
DOI : 10.1007/bf00934594

[. Hsu, Cell-to-Cell Mapping, A Method of Global Analysis for Nonlinear Systems, Journal of Applied Mechanics, vol.55, issue.3, p.2013
DOI : 10.1115/1.3125869

H. Huang, Global optimization of stochastic black-box systems via sequential kriging meta-models, Journal of global optimization, vol.343, pp.441-466, 2006.
DOI : 10.1007/s10898-005-2454-3

[. Huang, Sequential kriging optimization using multiplefidelity evaluations Structural and Multidisciplinary Optimization 32, pp.369-382, 2006.
DOI : 10.1007/s00158-005-0587-0

[. Hutter, Performance Prediction and Automated Tuning of Randomized and Parametric Algorithms, International Conference on Principles and Practice of Constraint Programming, pp.213-228, 2006.
DOI : 10.1007/11889205_17

[. Hutter, Boosting Verification by Automatic Tuning of Decision Procedures, Formal Methods in Computer Aided Design (FMCAD'07), pp.27-34, 2007.
DOI : 10.1109/FAMCAD.2007.9

F. Hut+09a and . Hutter, An experimental investigation of model-based parameter optimisation: SPO and beyond " . In: GECCO'09, pp.271-278, 2009.

[. Hutter, ParamILS: An Automatic Algorithm Configuration Framework, pp.267-306, 2009.

[. Hutter, ParamILS: an Automatic Algorithm Configuration Framework, pp.267-306, 2009.

[. Hutter, ParamILS: an automatic algorithm configuration framework, Journal of Artificial Intelligence Research, vol.36, issue.1, pp.267-306, 2009.

[. Hutter, Algorithm runtime prediction: Methods & evaluation, Artificial Intelligence, vol.206, issue.103, pp.79-111, 2014.
DOI : 10.1016/j.artint.2013.10.003

[. Hutter, Automated configuration of algorithms for solving hard computational problems, 2009.

A. Martijn and . Huynen, Exploring phenotype space through neutral evolution, Journal of molecular evolution, vol.433, pp.165-169, 1996.

[. Jones and S. Forrest, Fitness Distance Correlation as a Measure of Problem Difficulty for Genetic Algorithms, In: ICGA, vol.95, issue.65, pp.184-192, 1995.

[. Jin, W. Chen, and T. W. Simpson, Comparative studies of metamodeling techniques under multiple modeling criteria, 8th Symposium on Multidisciplinary Analysis and Optimization, pp.1-13, 2000.
DOI : 10.2307/1269548

Y. Jin, A comprehensive survey of fitness approximation in evolutionary computation, Soft Computing, vol.9, issue.1, pp.3-12, 2005.
DOI : 10.1007/s00500-003-0328-5

Y. Jin, Surrogate-assisted evolutionary computation: Recent advances and future challenges, Swarm and Evolutionary Computation, vol.1, issue.2, pp.61-70, 2011.
DOI : 10.1016/j.swevo.2011.05.001

Z. Cezary, Z. Janikow, and . Michalewicz, An experimental comparison of binary and floating point representations in genetic algorithms, pp.31-36, 1991.

[. Jeong, M. Murayama, and K. Yamamoto, Efficient optimization design method using kriging model, Journal of aircraft, vol.422, issue.175, pp.413-420, 2005.
DOI : 10.2514/1.17383

[. Joachims, Optimizing search engines using clickthrough data, Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining , KDD '02, pp.133-142, 2002.
DOI : 10.1145/775047.775067

URL : http://www.cse.unsw.edu.au/~qzhang/papers/459.pdf

T. Jones, Evolutionary algorithms, fitness landscapes and search, p.65, 1995.

R. Donald, M. Jones, . Schonlau, J. William, and . Welch, Efficient global optimization of expensive black-box functions, Journal of Global optimization, vol.134, issue.163, pp.455-492, 1998.

[. Kadioglu, ISAC -Instance-Specific Algorithm Configuration, In: ECAI, vol.215, issue.100, pp.751-756, 2010.

R. [. Kennedy and . Eberhart, Particle swarm optimization, Proceedings of ICNN'95, International Conference on Neural Networks, 1942.
DOI : 10.1109/ICNN.1995.488968

[. Kerschke, Cell Mapping Techniques for Exploratory Landscape Analysis, pp.115-131, 2014.
DOI : 10.1007/978-3-319-07494-8_9

[. Kerschke, Detecting Funnel Structures by Means of Exploratory Landscape Analysis, Proceedings of the 2015 on Genetic and Evolutionary Computation Conference, GECCO '15, pp.265-272, 2015.
DOI : 10.1109/CEC.2013.6557559

[. Kerschke, Low-Budget Exploratory Landscape Analysis on Multiple Peaks Models, Proceedings of the 2016 on Genetic and Evolutionary Computation Conference, GECCO '16, pp.229-236
DOI : 10.1109/CEC.2013.6557559

[. Kern, N. Hansen, and P. Koumoutsakos, Local Meta-models for Optimization Using Evolution Strategies, pp.939-948, 2006.
DOI : 10.1007/11844297_95

URL : http://www.bionik.tu-berlin.de/user/niko/ppsn06model.pdf

P. Kilby, Estimating search tree size, Proc. of the 21st National Conf. of Artificial Intelligence, AAAI, Menlo Park, 2006.

M. Kimura, Evolutionary Rate at the Molecular Level, Nature, vol.16, issue.5129, pp.624-626, 1968.
DOI : 10.1016/0926-6593(66)90068-3

. Kle05, P. Jack, and . Kleijnen, An overview of the design and analysis of simulation experiments for sensitivity analysis, In: European Journal of Operational Research, vol.1642, pp.287-300, 2005.

. Kle09, P. Jack, and . Kleijnen, Kriging metamodeling in simulation: a review, European Journal of Operational Research, vol.1923, issue.175, pp.707-716, 2009.

[. Kallel, B. Naudts, and C. R. Reeves, Properties of Fitness Functions and Search Landscapes, pp.175-206, 2001.
DOI : 10.1007/978-3-662-04448-3_8

E. Donald and . Knuth, Estimating the efficiency of backtrack programs

[. Katada and K. Ohkura, Estimating the degree of neutrality in fitness landscapes by the nei's standard genetic distance-an application to evolutionary robotics, IEEE International Conference on Evolutionary Computation. IEEE, pp.483-490, 2006.

J. Kolodner, Case-based reasoning, 2014.

[. Katada, K. Ohkura, and K. Ueda, The Nei's standard genetic distance in artificial evolution, Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753), pp.1233-1239, 2004.
DOI : 10.1109/CEC.2004.1331038

R. John and . Koza, Genetic Programming 1996: proceedings of the first annual conference, 1996.

R. John and . Koza, Concept formation and decision tree induction using the genetic programming paradigm, International Conference on Parallel Problem Solving from Nature, pp.124-128, 1990.

R. John and . Koza, Genetic programming: on the programming of computers by means of natural selection, 1992.

S. Kramer, Prediction of Ordinal Classes Using Regression Trees, International Symposium on Methodologies for Intelligent Systems, pp.426-434, 2000.
DOI : 10.1007/3-540-39963-1_45

G. John, J. L. Kemeny, and . Snell, Finite Markov Chains, Undergraduate Texts in Mathematics, 1976.

L. Kallel and M. Schoenauer, Fitness distance correlation for variable length representations, p.66, 1996.

J. Lampinen and I. Zelinka, On stagnation of the differential evolution algorithm, Proceedings of MENDEL. 2000, pp.76-83

M. Lobjois and . Lema??-tre, Branch and bound algorithm selection by performance prediction, pp.353-358, 1998.

. Ley+03-]-kevin-leyton-brown, A portfolio approach to algorithm selection, In: IJCAI, vol.1543, p.2003, 2003.

. Lia+06a, J. Jing, and . Liang, Comprehensive learning particle swarm optimizer for global optimization of multimodal functions, IEEE transactions on evolutionary computation, pp.281-295, 2006.

[. Liang, Problem definitions and evaluation criteria for the CEC 2006 special session on constrained real-parameter optimization, Journal of Applied Mechanics, vol.418, issue.100, 2006.

Y. Liu, Scaling up fast evolutionary programming with cooperative coevolution, Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546), pp.1101-1108, 2001.
DOI : 10.1109/CEC.2001.934314

URL : ftp://www.cs.adfa.edu.au/pub/xin/coevolve_opt.pdf

J. Liu, Adaptive parameter control of differential evolution, Proc. of Mendel, pp.19-26, 2002.

[. Liu, Learning to rank for information retrieval, Foundations and Trends in Information Retrieval, vol.33, issue.160, pp.225-331, 2009.
DOI : 10.1145/1835449.1835676

[. Liu, Learning to rank for information retrieval, p.178, 2011.
DOI : 10.1145/1835449.1835676

P. Larranaga, A. Jose, and . Lozano, Estimation of distribution algorithms: A new tool for evolutionary computation, 2002.
DOI : 10.1007/978-1-4615-1539-5

J. Liu and J. Lampinen, A Fuzzy Adaptive Differential Evolution Algorithm, Soft Computing, vol.9, issue.6, pp.448-462, 2005.
DOI : 10.1007/s00500-004-0363-x

[. López-ibáñez, T. Liao, and T. Stützle, On the anytime behavior of IPOP-CMA-ES, International Conference on Parallel Problem Solving from Nature, pp.357-366, 2012.

R. Helena, . Lourenço, C. Olivier, T. Martin, and . Stützle, Iterated local search: Framework and applications, pp.363-397, 2010.

C. Dong, J. Liu, and . Nocedal, On the limited memory BFGS method for large scale optimization, Mathematical programming 45, pp.503-528, 1989.

E. Lns02-]-kevin-leyton-brown, Y. Nudelman, and . Shoham, Learning the empirical hardness of optimization problems: The case of combinatorial auctions " . In: Principles and Practice of Constraint Programming-CP 2002, pp.556-572, 2002.

E. Lns09-]-kevin-leyton-brown, Y. Nudelman, and . Shoham, Empirical hardness models: Methodology and a case study on combinatorial auctions, Journal of the ACM (JACM), vol.564, p.22, 2009.

M. Locatelli, On the Multilevel Structure of Global Optimization Problems, Computational Optimization and Applications, vol.30, issue.1, pp.5-22, 2005.
DOI : 10.1007/s10589-005-4561-y

W. James and . Longley, Modified gram-schmidt process vs. classical gramschmidt: Modified gram-schmidt process vs. classical gram-schmidt, In: Communications in Statistics-Simulation and Computation, vol.105, pp.517-527, 1981.

M. López-ibánez, The irace package, iterated race for automatic algorithm configuration, pp.45-46, 2011.

[. Loshchilov, Maximum Likelihood-Based Online Adaptation of Hyper-Parameters in CMA-ES, LNCS, vol.8672, issue.133, pp.70-79, 2014.
DOI : 10.1007/978-3-319-10762-2_7

URL : https://hal.archives-ouvertes.fr/hal-01003504

[. Lovász, Random walks on graphs, Combinatorics, Paul erdos is eighty 2, pp.1-46, 1993.

R. George, . Lindfield, E. John, and . Penny, Microcomputers in numerical analysis, 1989.

[. Liao and T. Stützle, Bounding the population size of IPOP-CMA-ES on the noiseless BBOB testbed, Proceeding of the fifteenth annual conference companion on Genetic and evolutionary computation conference companion, GECCO '13 Companion, p.13
DOI : 10.1145/2464576.2482694

[. Liao and T. Stützle, Testing the impact of parameter tuning on a variant of IPOP-CMA-ES with a bounded maximum population size on the noiseless BBOB testbed, Proceeding of the fifteenth annual conference companion on Genetic and evolutionary computation conference companion, GECCO '13 Companion, pp.1169-1176
DOI : 10.1145/2464576.2482695

[. Loshchilov, M. Schoenauer, and M. Sebag, Alternative Restart Strategies for CMA-ES, PPSN XII, pp.296-305, 2012.
DOI : 10.1007/978-3-642-32937-1_30

URL : https://hal.archives-ouvertes.fr/hal-00713415

[. Loshchilov, M. Schoenauer, and M. Sebag, Self-adaptive surrogate-assisted covariance matrix adaptation evolution strategy, Proceedings of the fourteenth international conference on Genetic and evolutionary computation conference, GECCO '12, pp.321-328
DOI : 10.1145/2330163.2330210

URL : https://hal.archives-ouvertes.fr/hal-00686570

[. Loshchilov, M. Schoenauer, and M. Sebag, Intensive surrogate model exploitation in self-adaptive surrogate-assisted cma-es (saacm-es), Proceeding of the fifteenth annual conference on Genetic and evolutionary computation conference, GECCO '13, pp.439-446, 2013.
DOI : 10.1145/2463372.2463427

URL : https://hal.archives-ouvertes.fr/hal-00818595

R. Duncan and . Luce, Individual Choice Behavior, 1959.

M. Lunacek and D. Whitley, The dispersion metric and the CMA evolution strategy, Proceedings of the 8th annual conference on Genetic and evolutionary computation , GECCO '06, pp.477-484, 2006.
DOI : 10.1145/1143997.1144085

[. Li, Q. Wu, J. Christopher, and . Burges, Mcrank: Learning to rank using multiple classification and gradient boosting Advances in neural information processing systems, pp.897-904, 2007.

M. Muñoz, M. Kirley, K. Saman, and . Halgamuge, Exploratory Landscape Analysis of Continuous Space Optimization Problems Using Information Content, IEEE Transactions on Evolutionary Computation, vol.19, issue.1, pp.74-87, 2015.
DOI : 10.1109/TEVC.2014.2302006

L. Colin and . Mallows, Non-null ranking models. I " . In: Biometrika 44, pp.114-130, 1957.

[. Mascia, An analysis of parameter adaptation in reactive tabu search, International Transactions in Operational Research, vol.2, issue.7, pp.127-152, 2014.
DOI : 10.1371/journal.pcbi.0020089

URL : https://hal.archives-ouvertes.fr/hal-00947956

[. Matheron, Principles of geostatistics, Economic Geology, vol.58, issue.8, pp.1246-1266, 1963.
DOI : 10.2113/gsecongeo.58.8.1246

[. Mccullagh, Regression models for ordinal data, Journal of the royal statistical society. Series B (Methodological), vol.160, pp.109-142, 1980.

[. Mersmann, Exploratory landscape analysis, Proceedings of the 13th annual conference on Genetic and evolutionary computation, GECCO '11, pp.829-836, 2011.
DOI : 10.1145/2001576.2001690

P. Merz and B. Freisleben, Fitness landscape analysis and memetic algorithms for the quadratic assignment problem, IEEE transactions on evolutionary computation, pp.337-352, 2000.

P. Merz and B. Freisleben, Memetic algorithms and the fitness landscape of the graph bi-partitioning problem, International Conference on Parallel Problem Solving from Nature, pp.765-774, 1998.
DOI : 10.1007/BFb0056918

M. Morgan and . Gallagher, Length Scale for Characterising Continuous Optimization Problems, International Conference on Parallel Problem Solving from Nature, pp.407-416, 2012.
DOI : 10.1007/978-3-642-32937-1_41

G. Laurens-van-der-maaten and . Hinton, Visualizing data using t-SNE, In: Journal of Machine Learning Research, vol.9, pp.2579-2605, 2008.

[. Marrow, M. Heath, and I. Ip-re, Evolvability: Evolution, computation, biology, Proceedings of the 1999 Genetic and Evolutionary Computation Conference Workshop Program (GECCO-99 Workshop on Evolvability, pp.30-33, 1999.

S. Minton, An analytic learning system for specializing heuristics, In: IJCAI, vol.93, pp.922-929, 1993.

S. Minton, Automatically configuring constraint satisfaction programs: A case study, Constraints, vol.58, issue.1, pp.7-43, 1996.
DOI : 10.1007/978-1-4613-1703-6

URL : http://ai.uwaterloo.ca/~vanbeek/Constraints/Papers/Minton96.pdf

[. Michalewicz, Z. Cezary, and . Janikow, Genetic algorithms for numerical optimization, Statistics and Computing, vol.220, issue.4598, pp.75-91, 1991.
DOI : 10.1007/978-94-015-7744-1

A. Mario, M. Muñoz, . Kirley, K. Saman, and . Halgamuge, A metalearning prediction model of algorithm performance for continuous optimization problems, pp.226-235, 2012.

[. Maron, W. Andrew, and . Moore, Hoeffding races: Accelerating model selection search for classification and function approximation, p.263, 1993.

[. Maron, W. Andrew, and . Moore, The Racing Algorithm: Model Selection for Lazy Learners, Lazy learning, pp.193-225, 1997.
DOI : 10.1007/978-94-017-2053-3_8

L. Malagò and G. Pistone, Optimization via Information Geometry, pp.343-351, 2014.
DOI : 10.1007/978-1-4939-2104-1_33

D. Jay, T. W. Martin, and . Simpson, Use of kriging models to approximate deterministic computer models, AIAA journal 43, pp.853-863, 2005.

L. Christian, . Müller, F. Ivo, and . Sbalzarini, Global characterization of the CEC 2005 fitness landscapes using fitness-distance analysis, European Conference on the Applications of Evolutionary Computation, pp.294-303, 2011.

[. M?s?r and M. Sebag, Algorithm Selection as a Collaborative Filtering Problem

[. Mcallester, B. Selman, and H. Kautz, Evidence for invariants in local search, AAAI/IAAI, pp.321-326, 1997.

F. Julian, P. Miller, and . Thomson, Cartesian genetic programming, European Conference on Genetic Programming, pp.121-132, 2000.

[. Mockus, A. Tiesis, and . Zilinskas, Toward Global Optimization, Methods for Seeking the Extremum, 1978.

H. Mühlenbein, The Equation for Response to Selection and Its Use for Prediction, Evolutionary Computation, vol.3, issue.3, pp.303-346, 1997.
DOI : 10.1162/evco.1994.2.4.347

[. Manderick, P. Mark-de-weger, and . Spiessens, The genetic algorithm and the structure of the fitness landscape, Proceedings of the fourth international conference on genetic algorithms, pp.143-150, 1991.

[. Naudts and A. Verschoren, Epistasis and deceptivity, Simon Stevin-Bulletin of the Belgian Mathematical Society, vol.6, pp.147-154, 1999.

. Volker-nannen, E. Agoston, and . Eiben, Relevance Estimation and Value Calibration of Evolutionary Algorithm Parameters, In: IJ- CAI, vol.7, pp.6-12, 2007.

M. Nei, Genetic Distance between Populations, The American Naturalist, vol.106, issue.949, pp.283-292, 1972.
DOI : 10.1086/282771

A. John, R. Nelder, and . Mead, A simplex method for function minimization, The computer journal 7, pp.308-313, 1965.

E. Nudelman, Understanding Random SAT: Beyond the Clauses-to-Variables Ratio, International Conference on Principles and Practice of Constraint Programming, pp.438-452, 2004.
DOI : 10.1007/978-3-540-30201-8_33

[. Ostermeier, A. Gawelczyk, and N. Hansen, A Derandomized Approach to Self-Adaptation of Evolution Strategies, Evolutionary Computation, vol.2, issue.4, pp.369-380, 1994.
DOI : 10.1162/evco.1994.2.4.369

[. Ollivier, Information-geometric optimization algorithms: A unifying picture via invariance principles " . In: arXiv preprint arXiv:1106, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00601503

[. Omidvar, Cooperative Co-Evolution With Differential Grouping for Large Scale Optimization, IEEE Transactions on Evolutionary Computation, vol.18, issue.3, pp.378-393, 2014.
DOI : 10.1109/TEVC.2013.2281543

URL : http://goanna.cs.rmit.edu.au/~xiaodong/publications/differntialGrouping-tevc.pdf

E. Pitzer and M. Affenzeller, A Comprehensive Survey on Fitness Landscape Analysis, pp.161-191, 2012.
DOI : 10.1007/978-3-642-23229-9_8

. Padhye, Evolutionary approaches for real world applications in 21st century, Proceedings of the fourteenth international conference on Genetic and evolutionary computation conference companion, GECCO Companion '12, pp.43-48, 2012.
DOI : 10.1145/2330784.2330792

]. F. Ped+11 and . Pedregosa, Scikit-learn: Machine Learning in Python, In: Journal of Machine Learning Research, vol.12, issue.112, pp.2825-2830, 2011.

[. Pedregosa, Learning to Rank from Medical Imaging Data, pp.234-241, 2012.
DOI : 10.1007/978-3-642-35428-1_29

URL : https://hal.archives-ouvertes.fr/hal-00717990

J. Donald, H. Patterson, and . Kautz, Auto-walksat: a self-tuning implementation of walksat, In: Electronic Notes in Discrete Mathematics, vol.9, pp.360-368, 2001.

L. Pla75-]-robin and . Plackett, The analysis of permutations, In: Applied Statistics, pp.193-202, 1975.

V. Kenneth and . Price, Differential Evolution vs. the Functions of the 2nd ICEO, Evolutionary Computation, vol.6, issue.29, pp.153-157, 1997.

[. Price, M. Rainer, . Storn, A. Jouni, and . Lampinen, Differential Evolution, 2006.
DOI : 10.1007/978-3-642-30504-7_8

[. Qin, V. L. Huang, N. Ponnuthurai, and . Suganthan, Differential Evolution Algorithm With Strategy Adaptation for Global Numerical Optimization, IEEE Transactions on Evolutionary Computation, vol.13, issue.2, pp.398-417, 2009.
DOI : 10.1109/TEVC.2008.927706

URL : http://sci2s.ugr.es/eamhco/pdf/SaDE.pdf

[. Qin, Learning to search web pages with query-level loss functions, 2006.

[. Qin, Query-level loss functions for information retrieval Information Processing & Management 44, pp.838-855, 2008.
DOI : 10.1016/j.ipm.2007.07.016

URL : http://research.microsoft.com/en-us/people/taoqin/qin-ipm08.pdf

[. Quoc and V. Le, Learning to rank with nonsmooth cost functions, Proceedings of the Advances in Neural Information Processing Systems, pp.193-200, 2007.

H. Rosé, W. Ebeling, and T. Asselmeyer, The density of states ??? A measure of the difficulty of optimisation problems, International Conference on Parallel Problem Solving from Nature, pp.208-217, 1996.
DOI : 10.1007/3-540-61723-X_985

[. Rechenberg, Cybernetic solution path of an experimental problem, 1965.

F. Lewis, J. A. Richardson, and . Gaunt, The Deferred Approach to the Limit. Part I. Single Lattice. Part II. Interpenetrating Lattices In: Philosophical Transactions of the Royal Society of London A: Mathematical, Physical and Engineering Sciences 226, pp.636-646, 1927.

[. Richard, Dynamic programming, p.92, 1957.
URL : https://hal.archives-ouvertes.fr/hal-01433498

E. Ridge and D. Kudenko, Tuning the Performance of the MMAS Heuristic, pp.46-60, 2007.
DOI : 10.1007/978-3-540-74446-7_4

S. Rochet, Epistasis in genetic algorithms revisited, Information Sciences, vol.102, issue.1-4, pp.133-155, 1997.
DOI : 10.1016/S0020-0255(97)00017-0

R. Colin, J. E. Reeves, and . Rowe, Genetic Algorithms: Principles and Perspectives, 2003.

[. Reeves and J. Rowe, Genetic algorithms: principles and perspectives? a guide to GA theory. Operaations Research, Computer Science Interfaces Series, p.61, 2003.

M. Christian, . Reidys, F. Peter, and . Stadler, Neutrality in fitness landscapes, Applied Mathematics and Computation, vol.1172, issue.64, pp.321-350, 2001.

R. Colin, C. C. Reeves, and . Wright, Epistasis in Genetic Algorithms: An Experimental Design Perspective, pp.217-224, 1995.

J. Sacks, Design and Analysis of Computer Experiments, Statistical Science, vol.4, issue.4, pp.409-423, 1989.
DOI : 10.1214/ss/1177012413

R. Salomon, Re-evaluating genetic algorithm performance under coordinate rotation of benchmark functions. A survey of some theoretical and practical aspects of genetic algorithms, Biosystems, vol.39, issue.3, pp.263-278, 1996.
DOI : 10.1016/0303-2647(96)01621-8

[. Satterthwaite, Random Balance Experimentation, Technometrics, vol.1, issue.2, pp.111-137, 1959.
DOI : 10.1080/00401706.1959.10489853

[. Satterthwaite, REVOP or random evolutionary operation, In: Statistical Engineering Institute Boston Univ. Rept, vol.1010, p.59, 1959.

[. Socha and M. Dorigo, Ant colony optimization for continuous domains, European Journal of Operational Research, vol.185, issue.3, pp.1155-1173, 2008.
DOI : 10.1016/j.ejor.2006.06.046

M. Sebag and A. Ducoulombier, Extending population-based incremental learning to continuous search spaces, Proc. Parallel Problem Solving from Nature -PPSN V, pp.418-427, 1998.
DOI : 10.1007/BFb0056884

URL : https://hal.archives-ouvertes.fr/hal-00116542

K. Selmar, A. Smit, and . Eiben, Parameter tuning of evolutionary algorithms: Generalist vs. specialist, European Conference on the Applications of Evolutionary Computation, pp.542-551, 2010.

]. S. Se10b, A. E. Smit, and . Eiben, Beating the " World champion " Evolutionary Algorithm via REVAC Tuning, Proc. IEEE Congress on Evolutionary Computation, pp.31-37, 2010.

[. Smit and A. Eiben, Multi-problem parameter tuning using bonesa, In: Artificial Evolution, vol.46, pp.222-233, 2011.

K. Selmar, . Smit, Z. Endre-eiben, and . Szlávik, An MOEAbased Method to Tune EA Parameters on Multiple Objective Functions In: IJCCI (ICEC), pp.261-268, 2010.

F. Peter, R. Stadler, and . Happel, Random field models for fitness landscapes, Journal of Mathematical Biology, vol.385, issue.59, pp.435-478, 1999.

J. Shawe-taylor, Structural risk minimization over datadependent hierarchies, IEEE transactions on Information Theory, vol.445, pp.1926-1940, 1998.
DOI : 10.1109/18.705570

[. Spendley, R. George, . Hext, R. Francis, and . Himsworth, Sequential Application of Simplex Designs in Optimisation and Evolutionary Operation, Technometrics, vol.39, issue.4, pp.441-461, 1962.
DOI : 10.1214/aoms/1177707047

[. Shittowski, More test examples for nonlinear programming codes, More test examples for nonlinear programming codes, 1987.

[. Smith, M. Husbands, and . Shea, Fitness Landscapes and Evolvability, Evolutionary Computation, vol.10, issue.1, pp.1-34, 2002.
DOI : 10.1038/35085569

URL : http://www.mitpressjournals.org/userimages/ContentEditor/1164817256746/lib_rec_form.pdf

W. Timothy and . Simpson, Kriging models for global approximation in simulation-based multidisciplinary design optimization, AIAA journal 39, pp.2233-2241, 2001.

A. Singhal, Modern information retrieval: A brief overview, IEEE Data Eng. Bull, vol.24, issue.4, pp.35-43, 2001.

A. Shashua and A. Levin, Ranking with large margin principle: Two approaches Advances in neural information processing systems, pp.937-944, 2002.

[. Srivastava and A. Mediratta, Domain-dependent parameter selection of search-based algorithms compatible with user performance criteria, PROCEEDINGS OF THE NATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE, vol.20, p.1386, 1999.

[. Seo and B. Moon, An Information-Theoretic Analysis on the Interactions of Variables in Combinatorial Optimization Problems, Evolutionary Computation, vol.3, issue.4, pp.169-198, 2007.
DOI : 10.1002/j.1538-7305.1948.tb01338.x

G. Salton, J. Michael, and . Mcgill, Introduction to modern information retrieval, 1986.

J. Alex and . Smola, Regression estimation with support vector learning machines, 1996.

[. Sörensen, Metaheuristics-the metaphor exposed, International Transactions in Operational Research, vol.1, issue.2, pp.3-18, 2013.
DOI : 10.4018/jamc.2010040104

R. Storn and K. Price, Differential evolution?a simple and efficient heuristic for global optimization over continuous spaces, Journal of global optimization, vol.114, issue.109, pp.341-359, 1997.

D. Patrick, . Surry, J. Nicholas, and . Radcliffe, Real Representations, pp.343-363, 1996.

J. Alex, B. Smola, and . Schölkopf, A tutorial on support vector regression, Statistics and computing, vol.143, pp.199-222, 2004.

W. William, E. Cohen-robert, Y. Schapire, and . Singer, Learning to order things, Advances in Neural Information Processing Systems, p.451, 1998.

F. Peter and . Stadler, Fitness landscapes In: Biological evolution and statistical physics, pp.183-204, 2002.

[. Stadler, Biological Evolution and Statistical Physics, p.62, 2002.

N. Ponnuthurai and . Suganthan, Problem definitions and evaluation criteria for the CEC 2005 special session on real-parameter optimization, KanGAL report 2005005, p.2005, 2005.

[. Shlesinger, J. West, and . Klafter, L??vy dynamics of enhanced diffusion: Application to turbulence, Physical Review Letters, vol.51, issue.11, p.1100, 1987.
DOI : 10.1103/PhysRevLett.51.617

[. Santner, W. Williams, and . Notz, The Design and Analysis of Computer Experiments Springer-Verlag, p.283, 2003.

[. Talbi, Metaheuristics: from design to implementation, 2009.
DOI : 10.1002/9780470496916

URL : https://hal.archives-ouvertes.fr/hal-00750681

[. Taylor, SoftRank, Proceedings of the international conference on Web search and web data mining , WSDM '08, pp.77-86, 2008.
DOI : 10.1145/1341531.1341544

[. Teytaud, A New Selection Ratio for Large Population Sizes, LNCS, vol.5024, pp.452-460, 2010.
DOI : 10.1007/978-3-642-12239-2_47

URL : https://hal.archives-ouvertes.fr/inria-00456335

R. Tanabe and A. Fukunaga, Tuning differential evolution for cheap, medium, and expensive computational budgets, 2015 IEEE Congress on Evolutionary Computation (CEC), pp.2015-2018
DOI : 10.1109/CEC.2015.7257133

[. Thornton, Auto-WEKA, Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining, KDD '13, pp.847-855
DOI : 10.1145/2487575.2487629

K. Tierney, GGA: A Gender-Based Genetic Algorithm for the Automatic Configuration of Algorithms

J. Tavares, B. Francisco, E. Pereira, and . Costa, Multidimensional Knapsack Problem: A Fitness Landscape Analysis, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics), vol.38, issue.3, pp.604-616, 2008.
DOI : 10.1109/TSMCB.2008.915539

[. Tiwari and R. Roy, Challenges in real world optimisation using evolutionary computing, 2004.

[. Terashima-mar??nmar??n, P. Ross, and M. Valenzuela-rendón, Evolution of constraint satisfaction strategies in examination timetabling, Proceedings of the 1st Annual Conference on Genetic and Evolutionary Computation, pp.635-642, 1999.

A. Bryan, C. A. Tolson, and . Shoemaker, Dynamically dimensioned search algorithm for computationally efficient watershed model calibration, Water Resources Research, vol.431, 2007.

D. Peter and . Turney, Increasing evolvability considered as a large-scale trend in evolution, 2002.

[. Vapnik, E. Steven, A. Golowich, and . Smola, Support vector method for function approximation, regression estimation, and signal processing Advances in neural information processing systems, pp.281-287, 1997.

[. Vanneschi, Fitness Clouds and Problem Hardness in Genetic Programming, Genetic and Evolutionary Computation Conference, pp.690-701, 2004.
DOI : 10.1007/978-3-540-24855-2_76

URL : https://hal.archives-ouvertes.fr/hal-00160055

[. Verel, P. Collard, and M. Clergue, Where are bottlenecks in NK fitness landscapes?, The 2003 Congress on Evolutionary Computation, 2003. CEC '03., pp.273-280, 2003.
DOI : 10.1109/CEC.2003.1299585

URL : https://hal.archives-ouvertes.fr/hal-00159994

K. Vesselin, . Vassilev, C. Terence, . Fogarty, F. Julian et al., Information characteristics and the structure of landscapes, Evolutionary computation, vol.81, pp.31-60, 2000.

N. Vapnik, V. Vladimir, and . Vapnik, The nature of statistical learning theory, 1995.

[. Vapnik and V. Vapnik, Statistical learning theory, 1998.

P. Gunter, L. Wagner, and . Altenberg, Perspective: complex adaptations and the evolution of evolvability, Evolution, pp.967-976, 1996.

[. Watson, Generalized Linear Models (P. Mccullagh and JA Nelder), In: SIAM Review, vol.281, issue.160, pp.128-130, 1986.

[. Weise, R. Chiong, and K. Tang, Evolutionary Optimization: Pitfalls and Booby Traps, Journal of Computer Science and Technology, vol.57, issue.1, pp.907-936, 2012.
DOI : 10.1007/BF01531276

[. Wang, Z. Cai, and Q. Zhang, Differential Evolution With Composite Trial Vector Generation Strategies and Control Parameters, IEEE Transactions on Evolutionary Computation, vol.15, issue.1, pp.55-66, 2011.
DOI : 10.1109/TEVC.2010.2087271

URL : http://ist.csu.edu.cn/paper and matlab code/Differential evolution with composite trial vector generation strategies and control parameters/Differential Evolution with Composite Trial Vector Generation Strategies and Control Parameters.pdf

D. Edward and . Weinberger, Local properties of Kauffman's N-k model: A tunably rugged energy landscape, Physical Review A, vol.4410, p.6399, 1991.

L. Whitley, Fundamental Principles of Deception in Genetic Search, Foundations of Genetic Algorithms, pp.221-241, 1991.
DOI : 10.1016/B978-0-08-050684-5.50017-3

N. Daniel, S. Wilke, A. A. Kok, and . Groenwold, Comparison of linear and classical velocity update rules in particle swarm optimization: notes on diversity, International Journal for Numerical Methods in Engineering, vol.708, pp.962-984, 2007.

W. [. Wolpert and . 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

URL : http://www.cs.ubc.ca/~hutter/earg/papers07/00585893.pdf

H. Alden and . Wright, Genetic algorithms for real parameter optimization, Foundations of genetic algorithms, pp.205-218, 1991.

. Wright, The roles of mutation, inbreeding, crossbreeding, and selection in evolution, 1932.

J. Brian, . Williams, J. Thomas, . Santner, I. William et al., Sequential design of computer experiments to minimize integrated response functions, Statistica Sinica, vol.46, pp.1133-1152, 2000.

L. Wang and Q. Wu, Ant system algorithm for optimization in continuous space, Proceedings of the 2001 IEEE International Conference on Control Applications (CCA'01) (Cat. No.01CH37204), pp.45-48, 2003.
DOI : 10.1109/CCA.2001.973897

[. Xu, H. Holger, K. Hoos, and . Leyton-brown, Hierarchical Hardness Models for SAT, International Conference on Principles and Practice of Constraint Programming, pp.696-711, 2007.
DOI : 10.1007/978-3-540-74970-7_49

URL : http://www.cs.ubc.ca/~hoos/Publ/XuEtAl07.pdf

[. Xu, H. Hoos, and K. Leyton-brown, Hydra, Proceedings of the 2005 ACM workshop on Storage security and survivability , StorageSS '05, pp.210-216, 2010.
DOI : 10.1145/1103780.1103797

[. Xia, Listwise approach to learning to rank, Proceedings of the 25th international conference on Machine learning, ICML '08, pp.1192-1199, 2008.
DOI : 10.1145/1390156.1390306

L. Xu, SATzilla-07: The Design and Analysis of an Algorithm Portfolio for SAT, International Conference on Principles and Practice of Constraint Programming, pp.712-727, 2007.
DOI : 10.1007/978-3-540-74970-7_50

L. Xu, SATzilla: portfolio-based algorithm selection for SAT, Journal of Artificial Intelligence Research, pp.565-606, 2008.

[. Xu, Hydra-MIP: Automated algorithm configuration and selection for mixed integer programming " In: RCRA workshop on experimental evaluation of algorithms for solving problems with combinatorial explosion at, the international joint conference on artificial intelligence (IJCAI). 2011, pp.16-30

Y. Yang, An improved ant colony algorithm for continuous space optimization, 2010 International Conference on Machine Learning and Cybernetics, pp.573-576, 2003.
DOI : 10.1109/ICMLC.2010.5580957

[. Zaharie, Critical values for the control parameters of differential evolution algorithms, Proceedings of MENDEL, p.6267, 2002.

[. Zaharie, Control of population diversity and adaptation in differential evolution algorithms, Proc. of MENDEL, pp.41-46, 2003.

[. Zaharie, A comparative analysis of crossover variants in differential evolution, Proceedings of IMCSIT 2007, pp.171-181, 2007.

M. Zlochin and M. Dorigo, Model-Based Search for Combinatorial Optimization: A Comparative Study, International Conference on Parallel Problem Solving from Nature, pp.651-661, 2002.
DOI : 10.1007/3-540-45712-7_63

URL : http://code.ulb.ac.be/dbfiles/ZloDor2002ppsn.pdf

Z. Zhan, Adaptive Particle Swarm Optimization, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics ), vol.396, issue.150, pp.1362-1381, 2009.
DOI : 10.1007/978-3-540-87527-7_21

[. Zhang, C. Arthur, and . Sanderson, JADE: adaptive differential evolution with optional external archive, IEEE transactions on evolutionary computation, vol.135, issue.29, pp.945-958, 2009.

. Espace-'technologique, Immeuble'Discovery' Route'de'l'Orme'aux'Merisiers'RD'128/91190

*. Titre, Paramétrage'automatisé'd'algorithme'par'instance'pour'l'optimisation'boîte'noire' Mot'clés':'intelligence'artificielle,'optimisation,'apprentissage'statistique

*. Résumé, Cette' thèse' porte' sur' la' configuration' automatisée'des'algorithmes'qui'vise'à'trouver'le'meilleur' paramétrage' à' un' problème' donné' ou' une' catégorie' de' problèmes

. Le-'problème-'de, configuration'de'l'algorithme'revient'donc' à' un' problème' de' métaFoptimisation' dans' l'espace' des' paramètres,' dont' le' métaFobjectif' est' la' mesure' de' performance'de'l'algorithme'donné'avec'une'configuration' de'paramètres'donnée

. Cette, CAPI' (Configuration' d'Algorithme' Par' Instance)' pour' résoudre' des' problèmes' d'optimisation'de'boîte'noire'continus,'où'seul'un'budget' limité'd'évaluations'de'fonctions'est'disponible.' Nous' étudions' d'abord' les' algorithmes' évolutionnaires' pour'l'optimisation'continue,'en'mettant'l'accent'sur'deux' algorithmes' que' nous' avons' utilisés' comme' algorithme' cible'pour'CAPI,'DE'et'CMAFES

. Ensuite, générale' pour'étudier'empiriquement'le'CAPI'pour'le'domaine' continu,'de'sorte'que'toutes'les'composantes'du'CAPI' puissent'être'explorées'dans'des'conditions'réelles.' À'cette'fin,'nous'introduisons'également'un'nouveau' banc' d'essai' de' boîte' noire' continue,' distinct' du' célèbre' benchmark' BBOB,' qui' est' composé' de' plusieurs'fonctions'de'test'multidimensionnelles'avec' différentes' propriétés' problématiques,' issues' de' la' littérature.' La'méthodologie'proposée'est'finalement'appliquée'à' deux' AEs.' LA' méthodologie' est' ainsi,' validé' empiriquement' sur' le' nouveau' banc' d'essai' d'optimisation'boîte'noire'pour'des'dimensions'allant' jusqu'à'100 Title:'Per'Instance'Algorithm'Configuration'for'Continuous'Black'Box'Optimization' Keywords:'Artificial'intelligence,'Optimization,'Machine'Learning' ' Abstract:' This' PhD' thesis' focuses' on' the' automated' algorithm' configuration' that' aims' at' finding' the' 'best'' parameter' setting' for' a' given' problem' or' a' class' of' problem.' The' Algorithm' Configuration' problem' thus' amounts' to' a' metaFoptimization' problem' in' the' space' of' parameters,' whose'metaFobjective'is'the'performance'measure'of'the' given' algorithm' at' hand' with' a' given' parameter' configuration.' However,' in' the' continuous' domain,' such' method' can' only' be' empirically' assessed' at' the' cost' of' running''the'algorithm'on'some'problem'instances.' More'recent'approaches''rely'on'a'description'of'problems' in' some' features' space,' and' try' to' learn' a' mapping' from' this' feature' space' onto' the' space' of' parameter' configurations'of'the'algorithm'at'hand.'Along'these'lines,' this' PhD' thesis' focuses' on' the' Per' Instance' Algorithm' Configuration' (PIAC)' for' solving' continuous' black' box' optimization' problems,' where' ' only' a' limited' budget' of' function'evaluations''is'available.' 'We' first' survey' Evolutionary' Algorithms' for' continuous' optimization,'with'a'focus'on'two'algorithms'that'we'have' used'as'target'algorithm'for'PIAC,'DE'and'CMAFES.' Next,' we' review' the' state' of' the' art' of' Algorithm' Configuration' approaches,' and' the' different' features' that'have'been'proposed'in'the'literature'to'describe' continuous'black'box'optimization'problems.' We' then' introduce' a' general' methodology' to' empirically'study'PIAC'for'the'continuous'domain,'so' that' all' the' components' of' PIAC' can' be' explored' in' realFworld'conditions.'' To'this'end,''we'also'introduce'a'new'continuous'black' box' test' bench,' distinct' from' the' famous' BBOB' benchmark,' that' is' composed' of' a' several' multiF dimensional' test' functions' with' different' problem' properties,'gathered'from'the'literature.'' The'methodology'is'finally'applied'to'two'EAs.' First'we'use'Differential'Evolution'as'target'algorithm,' and'explore'all'the'components'of'PIAC,'such'that'we' empirically' assess' the' best.' Second,' based' on' the' results' on' DE,' we' empirically' investigate' PIAC' with' Covariance' Matrix' Adaptation' Evolution' Strategy' (CMAFES)' as' target' algorithm.' Both' use' cases' empirically'validate'the'proposed'methodology'on'the' new'black'box'testbench'for'dimensions'up'to'100