{"id":"https://openalex.org/W3023258821","doi":"https://doi.org/10.1162/evco_a_00283","title":"Lower Bounds for Non-Elitist Evolutionary Algorithms via Negative Multiplicative Drift","display_name":"Lower Bounds for Non-Elitist Evolutionary Algorithms via Negative Multiplicative Drift","publication_year":2020,"publication_date":"2020-11-16","ids":{"openalex":"https://openalex.org/W3023258821","doi":"https://doi.org/10.1162/evco_a_00283","mag":"3023258821","pmid":"https://pubmed.ncbi.nlm.nih.gov/33197211"},"language":"en","primary_location":{"id":"doi:10.1162/evco_a_00283","is_oa":true,"landing_page_url":"https://doi.org/10.1162/evco_a_00283","pdf_url":"https://direct.mit.edu/evco/article-pdf/29/2/305/1921051/evco_a_00283.pdf","source":{"id":"https://openalex.org/S38677346","display_name":"Evolutionary Computation","issn_l":"1063-6560","issn":["1063-6560","1530-9304"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315718","host_organization_name":"The MIT Press","host_organization_lineage":["https://openalex.org/P4310315718"],"host_organization_lineage_names":["The MIT Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Evolutionary Computation","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref","pubmed"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://direct.mit.edu/evco/article-pdf/29/2/305/1921051/evco_a_00283.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Benjamin Doerr","orcid":null},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I4210139461","display_name":"Laboratoire d'Informatique de l'\u00c9cole Polytechnique","ror":"https://ror.org/04afed728","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I142476485","https://openalex.org/I4210139461","https://openalex.org/I4210145102","https://openalex.org/I4210159245"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Benjamin Doerr","raw_affiliation_strings":["Laboratoire d'Informatique (LIX), CNRS, \u00c9cole Polytechnique, Institut Polytechnique de Paris, Palaiseau, 92128, France doerr@lix.polytechnique.fr"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Laboratoire d'Informatique (LIX), CNRS, \u00c9cole Polytechnique, Institut Polytechnique de Paris, Palaiseau, 92128, France doerr@lix.polytechnique.fr","institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I4210139461"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I4210139461"],"apc_list":null,"apc_paid":null,"fwci":0.9383,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.80729123,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"29","issue":"2","first_page":"305","last_page":"329"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.38350000977516174,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.38350000977516174,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.12439999729394913,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10249","display_name":"Distributed Control Multi-Agent Systems","score":0.048500001430511475,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/multiplicative-function","display_name":"Multiplicative function","score":0.8560000061988831},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.628000020980835},{"id":"https://openalex.org/keywords/operator","display_name":"Operator (biology)","score":0.5539000034332275},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.5285000205039978},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.4997999966144562},{"id":"https://openalex.org/keywords/mutation","display_name":"Mutation","score":0.4959000051021576},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4797999858856201}],"concepts":[{"id":"https://openalex.org/C42747912","wikidata":"https://www.wikidata.org/wiki/Q1048447","display_name":"Multiplicative function","level":2,"score":0.8560000061988831},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.628000020980835},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5752000212669373},{"id":"https://openalex.org/C17020691","wikidata":"https://www.wikidata.org/wiki/Q139677","display_name":"Operator (biology)","level":5,"score":0.5539000034332275},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.5285000205039978},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.4997999966144562},{"id":"https://openalex.org/C501734568","wikidata":"https://www.wikidata.org/wiki/Q42918","display_name":"Mutation","level":3,"score":0.4959000051021576},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4797999858856201},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4683000147342682},{"id":"https://openalex.org/C98638677","wikidata":"https://www.wikidata.org/wiki/Q2067051","display_name":"Mutation rate","level":3,"score":0.4611999988555908},{"id":"https://openalex.org/C138777275","wikidata":"https://www.wikidata.org/wiki/Q6884054","display_name":"Mixing (physics)","level":2,"score":0.4462999999523163},{"id":"https://openalex.org/C75235859","wikidata":"https://www.wikidata.org/wiki/Q582659","display_name":"Exponential growth","level":2,"score":0.4293000102043152},{"id":"https://openalex.org/C98184364","wikidata":"https://www.wikidata.org/wiki/Q1780131","display_name":"Argument (complex analysis)","level":2,"score":0.3659999966621399},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.33820000290870667},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.3375999927520752},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3278000056743622},{"id":"https://openalex.org/C181789720","wikidata":"https://www.wikidata.org/wiki/Q4812191","display_name":"Asymptotically optimal algorithm","level":2,"score":0.31189998984336853},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.30399999022483826},{"id":"https://openalex.org/C35129592","wikidata":"https://www.wikidata.org/wiki/Q324793","display_name":"Memetic algorithm","level":3,"score":0.2922999858856201},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.28780001401901245},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.27320000529289246},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2572000026702881}],"mesh":[{"descriptor_ui":"D000465","descriptor_name":"Algorithms","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D000465","descriptor_name":"Algorithms","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D000465","descriptor_name":"Algorithms","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D003198","descriptor_name":"Computer Simulation","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D003198","descriptor_name":"Computer Simulation","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D003198","descriptor_name":"Computer Simulation","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D005075","descriptor_name":"Biological Evolution","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D005075","descriptor_name":"Biological Evolution","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D005075","descriptor_name":"Biological Evolution","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D009154","descriptor_name":"Mutation","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D009154","descriptor_name":"Mutation","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D009154","descriptor_name":"Mutation","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D059645","descriptor_name":"Mutation Rate","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D059645","descriptor_name":"Mutation Rate","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D059645","descriptor_name":"Mutation Rate","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false}],"locations_count":3,"locations":[{"id":"doi:10.1162/evco_a_00283","is_oa":true,"landing_page_url":"https://doi.org/10.1162/evco_a_00283","pdf_url":"https://direct.mit.edu/evco/article-pdf/29/2/305/1921051/evco_a_00283.pdf","source":{"id":"https://openalex.org/S38677346","display_name":"Evolutionary Computation","issn_l":"1063-6560","issn":["1063-6560","1530-9304"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315718","host_organization_name":"The MIT Press","host_organization_lineage":["https://openalex.org/P4310315718"],"host_organization_lineage_names":["The MIT Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Evolutionary Computation","raw_type":"journal-article"},{"id":"pmid:33197211","is_oa":false,"landing_page_url":"https://pubmed.ncbi.nlm.nih.gov/33197211","pdf_url":null,"source":{"id":"https://openalex.org/S4306525036","display_name":"PubMed","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1299303238","host_organization_name":"National Institutes of Health","host_organization_lineage":["https://openalex.org/I1299303238"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Evolutionary computation","raw_type":null},{"id":"pmh:oai:arXiv.org:2005.00853","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2005.00853","pdf_url":"https://arxiv.org/pdf/2005.00853","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"doi:10.1162/evco_a_00283","is_oa":true,"landing_page_url":"https://doi.org/10.1162/evco_a_00283","pdf_url":"https://direct.mit.edu/evco/article-pdf/29/2/305/1921051/evco_a_00283.pdf","source":{"id":"https://openalex.org/S38677346","display_name":"Evolutionary Computation","issn_l":"1063-6560","issn":["1063-6560","1530-9304"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315718","host_organization_name":"The MIT Press","host_organization_lineage":["https://openalex.org/P4310315718"],"host_organization_lineage_names":["The MIT Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Evolutionary Computation","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4895254678","display_name":"LabEx Math\u00e9matique Hadamard","funder_award_id":"ANR-11-LABX-0056","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"}],"funders":[{"id":"https://openalex.org/F4320320883","display_name":"Agence Nationale de la Recherche","ror":"https://ror.org/00rbzpz17"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":41,"referenced_works":["https://openalex.org/W1933565355","https://openalex.org/W2004361255","https://openalex.org/W2604934189","https://openalex.org/W2734734929","https://openalex.org/W2808435117","https://openalex.org/W2810302189","https://openalex.org/W2848970508","https://openalex.org/W2887810854","https://openalex.org/W2888504352","https://openalex.org/W2936991357","https://openalex.org/W2941999899","https://openalex.org/W2955800573","https://openalex.org/W2962773240","https://openalex.org/W3014633408","https://openalex.org/W3037605752","https://openalex.org/W3089478229","https://openalex.org/W3089862754","https://openalex.org/W3101304319","https://openalex.org/W3162852665","https://openalex.org/W6605713668","https://openalex.org/W6632425816","https://openalex.org/W6643762872","https://openalex.org/W6646431929","https://openalex.org/W6646440109","https://openalex.org/W6668157053","https://openalex.org/W6671011212","https://openalex.org/W6671535121","https://openalex.org/W6672402388","https://openalex.org/W6675234423","https://openalex.org/W6676482161","https://openalex.org/W6684434985","https://openalex.org/W6687796255","https://openalex.org/W6726439719","https://openalex.org/W6743630711","https://openalex.org/W6747661981","https://openalex.org/W6748050182","https://openalex.org/W6756383120","https://openalex.org/W6763775316","https://openalex.org/W6779652749","https://openalex.org/W6785842062","https://openalex.org/W6821116838"],"related_works":[],"abstract_inverted_index":{"A":[0],"decent":[1],"number":[2],"of":[3,17,29,80,92,112,127,132,148,189,206,258],"lower":[4,87,141,157,253],"bounds":[5,88,142,158],"for":[6,55,97,159,255,266],"non-elitist":[7,93],"population-based":[8],"evolutionary":[9,95],"algorithms":[10,96,190],"has":[11],"been":[12],"shown":[13],"by":[14,213,234],"now.":[15],"Most":[16],"them":[18],"are":[19,145],"technically":[20],"demanding":[21],"due":[22],"to":[23,26,85,137,154,166,221,249],"the":[24,41,81,90,128,133,174,183,186,204,210,229,256,259],"(hard":[25],"avoid)":[27],"use":[28,241],"negative":[30,52,74],"drift":[31,53,57,75],"theorems-general":[32],"results":[33],"which":[34,115,227],"translate":[35],"an":[36,107,251],"expected":[37],"movement":[38],"away":[39],"from":[40],"target":[42],"into":[43],"a":[44,50,179,196,245],"high":[45],"hitting":[46],"time.":[47],"We":[48,67,239],"propose":[49],"simple":[51,261],"theorem":[54],"multiplicative":[56],"scenarios":[58],"and":[59,109,118,215,218,244],"show":[60,167,250],"that":[61,168],"it":[62,220],"can":[63],"simplify":[64],"existing":[65],"analyses.":[66],"discuss":[68],"in":[69,76,203],"more":[70],"detail":[71],"Lehre's":[72],"(2010)":[73],"populations":[77],"method,":[78],"one":[79],"most":[82],"general":[83],"tools":[84],"prove":[86,209],"on":[89,264],"runtime":[91,257],"mutation-based":[94],"discrete":[98],"search":[99],"spaces.":[100],"Together":[101],"with":[102,195],"other":[103,224],"arguments,":[104],"we":[105,143,208],"obtain":[106,144],"alternative":[108],"simpler":[110],"proof":[111],"this":[113,120],"result,":[114],"also":[116,163],"strengthens":[117],"simplifies":[119],"method.":[121],"In":[122],"particular,":[123],"now":[124],"only":[125,149,178],"three":[126],"five":[129],"technical":[130],"conditions":[131],"previous":[134],"result":[135,211],"have":[136],"be":[138],"verified.":[139],"The":[140],"explicit":[146],"instead":[147],"asymptotic.":[150],"This":[151],"allows":[152],"us":[153,165],"compute":[155],"concrete":[156,160],"algorithms,":[161],"but":[162],"enables":[164],"super-polynomial":[169],"runtimes":[170],"appear":[171],"already":[172],"when":[173],"reproduction":[175],"rate":[176,199],"is":[177],"(1-\u03c9(n-1/2))":[180],"factor":[181],"below":[182],"threshold.":[184],"For":[185],"special":[187],"case":[188],"using":[191],"standard":[192],"bit":[193],"mutation":[194,198,222,231],"random":[197],"(called":[200],"uniform":[201],"mixing":[202],"language":[205],"hyper-heuristics),":[207],"stated":[212],"Dang":[214],"Lehre":[216],"(2016b)":[217],"extend":[219],"rates":[223],"than":[225],"\u0398(1/n),":[226],"includes":[228],"heavy-tailed":[230],"operator":[232],"proposed":[233],"Doerr":[235],"et":[236],"al.":[237],"(2017).":[238],"finally":[240],"our":[242],"method":[243],"novel":[246],"domination":[247],"argument":[248],"exponential":[252],"bound":[254],"mutation-only":[260],"genetic":[262],"algorithm":[263],"OneMax":[265],"arbitrary":[267],"population":[268],"size.":[269]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":2},{"year":2020,"cited_by_count":1}],"updated_date":"2026-07-22T07:51:19.307946","created_date":"2020-05-13T00:00:00"}