{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,2]],"date-time":"2025-06-02T04:05:47Z","timestamp":1748837147601,"version":"3.41.0"},"publisher-location":"Cham","reference-count":44,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319314709"},{"type":"electronic","value":"9783319314716"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-31471-6_18","type":"book-chapter","created":{"date-parts":[[2016,3,19]],"date-time":"2016-03-19T02:35:28Z","timestamp":1458354928000},"page":"234-247","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the Codimension of the Set of Optima: Large Scale Optimisation with Few Relevant Variables"],"prefix":"10.1007","author":[{"given":"Vincent","family":"Berthier","sequence":"first","affiliation":[]},{"given":"Olivier","family":"Teytaud","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,3,20]]},"reference":[{"key":"18_CR1","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/j.tcs.2004.11.017","volume":"334","author":"A Auger","year":"2005","unstructured":"Auger, A.: Convergence results for (1, $$\\lambda $$ )-SA-ES using the theory of $$\\varphi $$ -irreducible Markov chains. Theor. Comput. Sci. 334, 35\u201369 (2005)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"18_CR2","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1023\/A:1014548204452","volume":"3","author":"W Banzhaf","year":"2002","unstructured":"Banzhaf, W., Langdon, W.B.: Some considerations on the reason for bloat. Genet. Program. Evolvable Mach. 3(1), 81\u201391 (2002)","journal-title":"Genet. Program. Evolvable Mach."},{"key":"18_CR3","series-title":"Natural Computing Series","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04378-3","volume-title":"The Theory of Evolution Strategies","author":"HG Beyer","year":"2001","unstructured":"Beyer, H.G.: The Theory of Evolution Strategies. Natural Computing Series. Springer, Heideberg (2001)"},{"key":"18_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/978-3-540-87700-4_13","volume-title":"Parallel Problem Solving from Nature \u2013 PPSN X","author":"H-G Beyer","year":"2008","unstructured":"Beyer, H.-G., Sendhoff, B.: Covariance matrix adaptation revisited \u2013 the CMSA evolution strategy \u2013. In: Rudolph, G., Jansen, T., Lucas, S., Poloni, C., Beume, N. (eds.) PPSN 2008. LNCS, vol. 5199, pp. 123\u2013132. Springer, Heidelberg (2008)"},{"key":"18_CR5","doi-asserted-by":"crossref","unstructured":"Bleuler, S., Brack, M., Thiele, L., Zitzler, E.: Multiobjective genetic programming: reducing bloat using SPEA2. In: Proceedings of the 2001 Congress on Evolutionary Computation CEC2001, pp. 536\u2013543. IEEE Press, COEX, World Trade Center, 159 Samseong-dong, Gangnam-gu, Seoul, Korea (27\u201330 2001). http:\/\/citeseer.ist.psu.edu\/bleuler01multiobjective.html","DOI":"10.1109\/CEC.2001.934438"},{"key":"18_CR6","unstructured":"Bratton, D., Kennedy, J.: Defining a standard for particle swarm optimization. In: IEEE Swarm Intelligence Symposium, pp. 120\u2013127 (2007). http:\/\/dx.org\/10.1109\/SIS.2007.368035"},{"issue":"6","key":"18_CR7","doi-asserted-by":"publisher","first-page":"646","DOI":"10.1109\/TEVC.2006.872133","volume":"10","author":"J Brest","year":"2006","unstructured":"Brest, J., Greiner, S., Boskovic, B., Mernik, M., Zumer, V.: Self-adapting control parameters in differential evolution: a comparative study on numerical benchmark problems. IEEE Trans. Evol. Comput. 10(6), 646\u2013657 (2006)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"18_CR8","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1093\/imamat\/6.3.222","volume":"6","author":"CG Broyden","year":"1970","unstructured":"Broyden, C.G.: The convergence of a class of double-rank minimization algorithms 2. New Algorithm. J. Inst. Math. Appl. 6, 222\u2013231 (1970)","journal-title":"New Algorithm. J. Inst. Math. Appl."},{"issue":"4","key":"18_CR9","first-page":"46","volume":"1","author":"M Clerc","year":"2010","unstructured":"Clerc, M.: Beyond standard particle swarm optimisation. IJSIR 1(4), 46\u201361 (2010). http:\/\/dblp.uni-trier.de\/db\/journals\/ijsir\/ijsir1.html#Clerc10","journal-title":"IJSIR"},{"issue":"1","key":"18_CR10","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1109\/TEVC.2010.2059031","volume":"15","author":"S Das","year":"2011","unstructured":"Das, S., Suganthan, P.N.: Differential evolution: a survey of the state-of-the-art. IEEE Trans. Evol. Comput. 15(1), 4\u201331 (2011)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"18_CR11","unstructured":"De Jong, E.D., Watson, R.A., Pollack, J.B.: Reducing bloat and promoting diversity using multi-objective methods. In: Proceedings of the Genetic and Evolutionary Computation Conference, GECCO-2001, pp. 11\u201318. Morgan Kaufmann Publishers, San Francisco, CA (2001). http:\/\/citeseer.ist.psu.edu\/dejong01reducing.html"},{"key":"18_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/3-540-45984-7_16","volume-title":"Genetic Programming","author":"A Ek\u00e1rt","year":"2002","unstructured":"Ek\u00e1rt, A., N\u00e9meth, S.Z.: Maintaining the diversity of genetic programs. In: Foster, J.A., Lutton, E., Miller, J., Ryan, C., Tettamanzi, A.G.B. (eds.) EuroGP 2002. LNCS, vol. 2278, pp. 162\u2013171. Springer, Heidelberg (2002)"},{"key":"18_CR13","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1093\/comjnl\/13.3.317","volume":"13","author":"R Fletcher","year":"1970","unstructured":"Fletcher, R.: A new approach to variable-metric algorithms. Comput. J. 13, 317\u2013322 (1970)","journal-title":"Comput. J."},{"issue":"3","key":"18_CR14","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/s00453-010-9391-3","volume":"59","author":"H Fournier","year":"2010","unstructured":"Fournier, H., Teytaud, O.: Lower bounds for comparison based evolution strategies using VC-dimension and sign patterns. Algorithmica 59(3), 387\u2013408 (2010). http:\/\/hal.inria.fr\/inria-00452791","journal-title":"Algorithmica"},{"key":"18_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/978-3-319-13563-2_12","volume-title":"Simulated Evolution and Learning","author":"M Gallagher","year":"2014","unstructured":"Gallagher, M.: Clustering problems for more useful benchmarking of optimization algorithms. In: Dick, G., Browne, W.N., Whigham, P., Zhang, M., Bui, L.T., Ishibuchi, H., Jin, Y., Li, X., Shi, Y., Singh, P., Tan, K.C., Tang, K. (eds.) SEAL 2014. LNCS, vol. 8886, pp. 131\u2013142. Springer, Heidelberg (2014)"},{"key":"18_CR16","doi-asserted-by":"crossref","unstructured":"Girosi, F.: An equivalence between sparse approximation and support vector machines. In: Proceedings of NIpPS 10, pp. 1455\u20131480. Morgan Kaufmann (1998)","DOI":"10.1162\/089976698300017269"},{"key":"18_CR17","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1090\/S0025-5718-1970-0258249-6","volume":"24","author":"D Goldfarb","year":"1970","unstructured":"Goldfarb, D.: A family of variable-metric algorithms derived by variational means. Math. Comput. 24, 23\u201326 (1970)","journal-title":"Math. Comput."},{"issue":"4","key":"18_CR18","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1145\/962437.962439","volume":"29","author":"NIM Gould","year":"2003","unstructured":"Gould, N.I.M., Orban, D., Toint, P.L.: Cuter and sifdec: a constrained and unconstrained testing environment, revisited. ACM Trans. Math. Softw. 29(4), 373\u2013394 (2003)","journal-title":"ACM Trans. Math. Softw."},{"issue":"1","key":"18_CR19","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1162\/106365603321828970","volume":"11","author":"N Hansen","year":"2003","unstructured":"Hansen, N., Ostermeier, A.: Completely derandomized self-adaptation in evolution strategies. Evol. Comput. 11(1), 159\u2013195 (2003)","journal-title":"Evol. Comput."},{"key":"18_CR20","unstructured":"Hansen, N.: Adaptive Encoding for Optimization. Research report RR-6518, INRIA (2008). http:\/\/hal.inria.fr\/inria-00275983\/en\/"},{"key":"18_CR21","unstructured":"Hansen, N., Ros, R., Mauny, N., Schoenauer, M., Auger, A.: PSO Facing Non-Separable and Ill-Conditioned Problems. Research report RR-6447, INRIA (2008). http:\/\/hal.inria.fr\/inria-00250078\/en\/"},{"key":"18_CR22","unstructured":"Jagerskupper, J.: In between progress rate and stochastic convergence. Dagstuhl\u2019s seminar (2006)"},{"key":"18_CR23","doi-asserted-by":"crossref","unstructured":"Jagerskupper, J., Witt, C.: Runtime analysis of a (mu+1)es for the sphere function. Technical report (2005)","DOI":"10.1145\/1068009.1068153"},{"key":"18_CR24","unstructured":"Jamieson, K.G., Nowak, R.D., Recht, B.: Query complexity of derivative-free optimization. In: NIPS, pp. 2681\u20132689 (2012)"},{"key":"18_CR25","unstructured":"Kearns, M., Mansour, Y., Ng, A.: A sparse sampling algorithm for near-optimal planning in large markov decision processes. In: IJCAI, pp. 1324\u20131231 (1999). http:\/\/citeseer.ist.psu.edu\/kearns99sparse.html"},{"key":"18_CR26","doi-asserted-by":"crossref","unstructured":"Kennedy, J., Eberhart, R.C.: Particle swarm optimization. In: Proceedings of the IEEE International Conference on Neural Networks, pp. 1942\u20131948 (1995)","DOI":"10.1109\/ICNN.1995.488968"},{"key":"18_CR27","first-page":"132","volume-title":"Late Breaking Papers at GP 1997","author":"WB Langdon","year":"1997","unstructured":"Langdon, W.B., Poli, R.: Fitness causes bloat: mutation. In: Koza, J. (ed.) Late Breaking Papers at GP 1997, pp. 132\u2013140. Stanford Bookstore, Stanford (1997)"},{"issue":"6","key":"18_CR28","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1007\/s00500-004-0363-x","volume":"9","author":"J Liu","year":"2005","unstructured":"Liu, J., Lampinen, J.: A fuzzy adaptive differential evolution algorithm. Soft Comput. 9(6), 448\u2013462 (2005)","journal-title":"Soft Comput."},{"issue":"3","key":"18_CR29","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1162\/evco.2006.14.3.309","volume":"14","author":"S Luke","year":"2006","unstructured":"Luke, S., Panait, L.: A comparison of bloat control methods for genetic programming. Evol. Comput. 14(3), 309\u2013344 (2006)","journal-title":"Evol. Comput."},{"key":"18_CR30","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1093\/comjnl\/7.4.308","volume":"7","author":"J Nelder","year":"1965","unstructured":"Nelder, J., Mead, R.: A simplex method for function minimization. Comput. J. 7, 308\u2013311 (1965)","journal-title":"Comput. J."},{"key":"18_CR31","doi-asserted-by":"crossref","unstructured":"Po\u0161\u00edk, P., Klem\u0161, V.: JADE, an adaptive differential evolution algorithm, benchmarked on the BBOB noiseless testbed. In: Proceedings of the 14th Annual Conference Companion on Genetic and Evolutionary Computation, pp. 197\u2013204. ACM (2012)","DOI":"10.1145\/2330784.2330814"},{"key":"18_CR32","unstructured":"Powell, M.J.D.: Developments of newuoa for minimization without derivatives. IMA J. Numer. Anal., pp. drm047+. http:\/\/dx.org\/10.1093\/imanum\/drm047"},{"key":"18_CR33","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/978-3-540-30115-8_33","volume-title":"Machine Learning: ECML 2004","author":"B Ratitch","year":"2004","unstructured":"Ratitch, B., Precup, D.: Sparse distributed memories for on-line value-based reinforcement learning. In: Boulicaut, J.-F., Esposito, F., Giannotti, F., Pedreschi, D. (eds.) ECML 2004. LNCS (LNAI), vol. 3201, pp. 347\u2013358. Springer, Heidelberg (2004)"},{"key":"18_CR34","volume-title":"Evolutionstrategie: Optimierung Technischer Systeme nach Prinzipien des Biologischen Evolution","author":"I Rechenberg","year":"1973","unstructured":"Rechenberg, I.: Evolutionstrategie: Optimierung Technischer Systeme nach Prinzipien des Biologischen Evolution. Fromman-Holzboog Verlag, Stuttgart (1973)"},{"key":"18_CR35","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1090\/S0025-5718-1970-0274029-X","volume":"24","author":"DF Shanno","year":"1970","unstructured":"Shanno, D.F.: Conditioning of quasi-newton methods for function minimization. Math. Comput. 24, 647\u2013656 (1970)","journal-title":"Math. Comput."},{"key":"18_CR36","unstructured":"Shi, Y., Eberhart, R.C.: A modified particle swarm optimizer. In: Proceedings of IEEE International Conference on Evolutionary Computation, pp. 69\u201373. IEEE Computer Society, Washington, DC, May 1998"},{"key":"18_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"666","DOI":"10.1007\/978-3-540-24855-2_74","volume-title":"Genetic and Evolutionary Computation \u2013 GECCO 2004","author":"S Silva","year":"2004","unstructured":"Silva, S., Costa, E.: Dynamic limits for bloat control. In: Deb, K., Tari, Z. (eds.) GECCO 2004. LNCS, vol. 3103, pp. 666\u2013677. Springer, Heidelberg (2004)"},{"key":"18_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/3-540-45984-7_14","volume-title":"Genetic Programming","author":"T Soule","year":"2002","unstructured":"Soule, T.: Exons and code growth in genetic programming. In: Foster, J.A., Lutton, E., Miller, J., Ryan, C., Tettamanzi, A.G.B. (eds.) EuroGP 2002. LNCS, vol. 2278, pp. 142\u2013151. Springer, Heidelberg (2002)"},{"key":"18_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/978-3-642-31866-5_25","volume-title":"Advances in Computer Games","author":"DL St-Pierre","year":"2012","unstructured":"St-Pierre, D.L., Louveaux, Q., Teytaud, O.: Online sparse bandit for card games. In: van den Herik, H.J., Plaat, A. (eds.) ACG 2011. LNCS, vol. 7168, pp. 295\u2013305. Springer, Heidelberg (2012)"},{"issue":"4","key":"18_CR40","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1023\/A:1008202821328","volume":"11","author":"R Storn","year":"1997","unstructured":"Storn, R., Price, K.: Differential evolution: a simple and efficient heuristic for global optimization over continuous spaces. J. Global Optim. 11(4), 341\u2013359 (1997). http:\/\/dx.org\/10.1023\/A:1008202821328","journal-title":"J. Global Optim."},{"key":"18_CR41","first-page":"1038","volume-title":"Advancesin Neural Information Processing Systems","author":"R Sutton","year":"1996","unstructured":"Sutton, R.: Generalization in reinforcement learning: successful examples using sparse coarse coding. In: Touretzky, D.S., Mozer, M.C., Hasselmo, M.E. (eds.) Advancesin Neural Information Processing Systems, vol. 8, pp. 1038\u20131044. The MIT Press, Cambridge (1996). http:\/\/citeseer.ist.psu.edu\/sutton96generalization.html"},{"key":"18_CR42","unstructured":"Yu, W.J., Zhang, J.: Multi-population differential evolution with adaptive parameter control for global optimization. In: Proceedings of the 13th Annual Conference on Genetic and Evolutionary Computation. GECCO 2011, NY, USA, pp. 1093\u20131098 (2011). http:\/\/doi.acm.org\/10.1145\/2001576.2001724"},{"key":"18_CR43","unstructured":"Zambrano-Bigiarini, M., Clerc, M., Rojas, R.: Standard particle swarm optimisation 2011 at cec-2013: a baseline for future PSO improvements. In: IEEE Congress on Evolutionary Computation, pp. 2337\u20132344. IEEE (2013). http:\/\/dblp.uni-trier.de\/db\/conf\/cec\/cec2013.html#Zambrano-BigiariniCR13"},{"issue":"2","key":"18_CR44","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1162\/evco.1997.5.2.213","volume":"5","author":"BT Zhang","year":"1997","unstructured":"Zhang, B.T., Ohm, P., M\u00fchlenbein, H.: Evolutionary induction of sparse neural trees. Evol. Comput. 5(2), 213\u2013236 (1997)","journal-title":"Evol. Comput."}],"container-title":["Lecture Notes in Computer Science","Artificial Evolution"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-31471-6_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T21:16:07Z","timestamp":1748812567000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-31471-6_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319314709","9783319314716"],"references-count":44,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-31471-6_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"20 March 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}