{"id":"https://openalex.org/W2605136245","doi":"https://doi.org/10.1145/3040718.3040724","title":"Lower Bounds on the Run Time of the Univariate Marginal Distribution Algorithm on OneMax","display_name":"Lower Bounds on the Run Time of the Univariate Marginal Distribution Algorithm on OneMax","publication_year":2017,"publication_date":"2017-01-12","ids":{"openalex":"https://openalex.org/W2605136245","doi":"https://doi.org/10.1145/3040718.3040724","mag":"2605136245"},"language":"en","primary_location":{"id":"doi:10.1145/3040718.3040724","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3040718.3040724","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 14th ACM/SIGEVO Conference on Foundations of Genetic Algorithms","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://orbit.dtu.dk/en/publications/1fd1ea8e-91c3-4577-8631-062a1f687e96","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5056585957","display_name":"Martin S. Krejca","orcid":"https://orcid.org/0000-0002-1765-1219"},"institutions":[{"id":"https://openalex.org/I143288331","display_name":"Hasso Plattner Institute","ror":"https://ror.org/058rn5r42","country_code":"DE","type":"facility","lineage":["https://openalex.org/I143288331","https://openalex.org/I176453806"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Martin S. Krejca","raw_affiliation_strings":["Hasso Plattner Institute, Potsdam, Germany"],"affiliations":[{"raw_affiliation_string":"Hasso Plattner Institute, Potsdam, Germany","institution_ids":["https://openalex.org/I143288331"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5038689623","display_name":"Carsten Witt","orcid":"https://orcid.org/0000-0002-6105-7700"},"institutions":[{"id":"https://openalex.org/I96673099","display_name":"Technical University of Denmark","ror":"https://ror.org/04qtj9h94","country_code":"DK","type":"education","lineage":["https://openalex.org/I96673099"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Carsten Witt","raw_affiliation_strings":["Technical University of Denmark, Kongens Lyngby, Denmark"],"affiliations":[{"raw_affiliation_string":"Technical University of Denmark, Kongens Lyngby, Denmark","institution_ids":["https://openalex.org/I96673099"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5056585957"],"corresponding_institution_ids":["https://openalex.org/I143288331"],"apc_list":null,"apc_paid":null,"fwci":6.6512,"has_fulltext":false,"cited_by_count":35,"citation_normalized_percentile":{"value":0.97239978,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"65","last_page":"79"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9993000030517578,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9993000030517578,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9959999918937683,"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/T11321","display_name":"Error Correcting Code Techniques","score":0.9954000115394592,"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/estimation-of-distribution-algorithm","display_name":"Estimation of distribution algorithm","score":0.7087740898132324},{"id":"https://openalex.org/keywords/univariate","display_name":"Univariate","score":0.6207219958305359},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6123219132423401},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.605967104434967},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5926988124847412},{"id":"https://openalex.org/keywords/population","display_name":"Population","score":0.4985158443450928},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4772745966911316},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.4662080705165863},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4561211168766022},{"id":"https://openalex.org/keywords/marginal-distribution","display_name":"Marginal distribution","score":0.44844067096710205},{"id":"https://openalex.org/keywords/distribution","display_name":"Distribution (mathematics)","score":0.44163960218429565},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.43120241165161133},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4079524278640747},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.24857410788536072},{"id":"https://openalex.org/keywords/random-variable","display_name":"Random variable","score":0.12040716409683228},{"id":"https://openalex.org/keywords/multivariate-statistics","display_name":"Multivariate statistics","score":0.07426950335502625},{"id":"https://openalex.org/keywords/biology","display_name":"Biology","score":0.07100889086723328}],"concepts":[{"id":"https://openalex.org/C162500139","wikidata":"https://www.wikidata.org/wiki/Q2835887","display_name":"Estimation of distribution algorithm","level":2,"score":0.7087740898132324},{"id":"https://openalex.org/C199163554","wikidata":"https://www.wikidata.org/wiki/Q1681619","display_name":"Univariate","level":3,"score":0.6207219958305359},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6123219132423401},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.605967104434967},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5926988124847412},{"id":"https://openalex.org/C2908647359","wikidata":"https://www.wikidata.org/wiki/Q2625603","display_name":"Population","level":2,"score":0.4985158443450928},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4772745966911316},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.4662080705165863},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4561211168766022},{"id":"https://openalex.org/C165216359","wikidata":"https://www.wikidata.org/wiki/Q670653","display_name":"Marginal distribution","level":3,"score":0.44844067096710205},{"id":"https://openalex.org/C110121322","wikidata":"https://www.wikidata.org/wiki/Q865811","display_name":"Distribution (mathematics)","level":2,"score":0.44163960218429565},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.43120241165161133},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4079524278640747},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.24857410788536072},{"id":"https://openalex.org/C122123141","wikidata":"https://www.wikidata.org/wiki/Q176623","display_name":"Random variable","level":2,"score":0.12040716409683228},{"id":"https://openalex.org/C161584116","wikidata":"https://www.wikidata.org/wiki/Q1952580","display_name":"Multivariate statistics","level":2,"score":0.07426950335502625},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.07100889086723328},{"id":"https://openalex.org/C144024400","wikidata":"https://www.wikidata.org/wiki/Q21201","display_name":"Sociology","level":0,"score":0.0},{"id":"https://openalex.org/C149923435","wikidata":"https://www.wikidata.org/wiki/Q37732","display_name":"Demography","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/3040718.3040724","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3040718.3040724","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 14th ACM/SIGEVO Conference on Foundations of Genetic Algorithms","raw_type":"proceedings-article"},{"id":"pmh:oai:pure.atira.dk:publications/1fd1ea8e-91c3-4577-8631-062a1f687e96","is_oa":true,"landing_page_url":"https://orbit.dtu.dk/en/publications/1fd1ea8e-91c3-4577-8631-062a1f687e96","pdf_url":null,"source":{"id":"https://openalex.org/S4306400705","display_name":"Technical University of Denmark, DTU Orbit (Technical University of Denmark, DTU)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I96673099","host_organization_name":"Technical University of Denmark","host_organization_lineage":["https://openalex.org/I96673099"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Krejca , M S &amp; Witt , C 2020 , ' Lower bounds on the run time of the Univariate Marginal Distribution Algorithm on OneMax ' , Theoretical Computer Science , vol. 832 , pp. 143-165 . https://doi.org/10.1016/j.tcs.2018.06.004","raw_type":"article"},{"id":"pmh:oai:pure.atira.dk:publications/560d7e75-2a26-4e79-b833-c7bfea919222","is_oa":true,"landing_page_url":"https://orbit.dtu.dk/en/publications/560d7e75-2a26-4e79-b833-c7bfea919222","pdf_url":null,"source":{"id":"https://openalex.org/S4306400705","display_name":"Technical University of Denmark, DTU Orbit (Technical University of Denmark, DTU)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I96673099","host_organization_name":"Technical University of Denmark","host_organization_lineage":["https://openalex.org/I96673099"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Krejca , M S &amp; Witt , C 2017 , Lower bounds on the run time of the univariate marginal distribution algorithm on OneMax . in 14th ACM/SIGEVO Workshop on Foundations of Genetic Algorithms . Association for Computing Machinery , pp. 65-79 , 14th ACM/SIGEVO Workshop on Foundations of Genetic Algorithms , Copenhagen , Denmark , 12/01/2017 . https://doi.org/10.1145/3040718.3040724","raw_type":"contributionToPeriodical"}],"best_oa_location":{"id":"pmh:oai:pure.atira.dk:publications/1fd1ea8e-91c3-4577-8631-062a1f687e96","is_oa":true,"landing_page_url":"https://orbit.dtu.dk/en/publications/1fd1ea8e-91c3-4577-8631-062a1f687e96","pdf_url":null,"source":{"id":"https://openalex.org/S4306400705","display_name":"Technical University of Denmark, DTU Orbit (Technical University of Denmark, DTU)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I96673099","host_organization_name":"Technical University of Denmark","host_organization_lineage":["https://openalex.org/I96673099"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Krejca , M S &amp; Witt , C 2020 , ' Lower bounds on the run time of the Univariate Marginal Distribution Algorithm on OneMax ' , Theoretical Computer Science , vol. 832 , pp. 143-165 . https://doi.org/10.1016/j.tcs.2018.06.004","raw_type":"article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W82518839","https://openalex.org/W1692958259","https://openalex.org/W1970025632","https://openalex.org/W1979634879","https://openalex.org/W1981482533","https://openalex.org/W1990799344","https://openalex.org/W1999340906","https://openalex.org/W2003289346","https://openalex.org/W2050215344","https://openalex.org/W2053360669","https://openalex.org/W2082931571","https://openalex.org/W2102044362","https://openalex.org/W2110667749","https://openalex.org/W2170674160","https://openalex.org/W2296129337","https://openalex.org/W2414365832","https://openalex.org/W2499149626","https://openalex.org/W2501406586","https://openalex.org/W2751862591","https://openalex.org/W2790825170","https://openalex.org/W4301441647","https://openalex.org/W6724612407"],"related_works":["https://openalex.org/W2085244387","https://openalex.org/W1571925721","https://openalex.org/W2352581933","https://openalex.org/W2387767111","https://openalex.org/W2369632919","https://openalex.org/W2145407785","https://openalex.org/W2065645426","https://openalex.org/W2048487010","https://openalex.org/W23362591","https://openalex.org/W2057282319"],"abstract_inverted_index":{"The":[0,85],"Univariate":[1],"Marginal":[2],"Distribution":[3],"Algorithm":[4],"(UMDA),":[5],"a":[6,15,25],"popular":[7],"estimation":[8,125],"of":[9,28,58,81,92,96,99,120,126],"distribution":[10,127],"algorithm,":[11,105],"is":[12,36,45,48,62,75],"studied":[13],"from":[14,69],"run":[16,43,56,79,121],"time":[17,44,57,80,122],"perspective.":[18],"On":[19],"the":[20,37,49,55,59,65,78,93,97,104,118],"classical":[21],"OneMax":[22],"benchmark":[23],"function,":[24],"lower":[26,52],"bound":[27,53],"\u03a9(\u03bc\u221an":[29],"+":[30],"n":[31],"log":[32],"n),":[33],"where":[34],"\u03bc":[35],"population":[38],"size,":[39],"on":[40,54],"its":[41],"expected":[42],"proved.":[46],"This":[47],"first":[50],"direct":[51],"UMDA.":[60],"It":[61],"stronger":[63],"than":[64],"bounds":[66],"that":[67],"follow":[68],"general":[70],"black-box":[71],"complexity":[72],"theory":[73],"and":[74],"matched":[76],"by":[77,103],"many":[82],"evolutionary":[83],"algorithms.":[84],"results":[86],"are":[87],"obtained":[88],"through":[89],"advanced":[90],"analyses":[91],"stochastic":[94],"change":[95],"frequencies":[98],"bit":[100],"values":[101],"maintained":[102],"including":[106],"carefully":[107],"designed":[108],"potential":[109],"functions.":[110],"These":[111],"techniques":[112],"may":[113],"prove":[114],"useful":[115],"in":[116,129],"advancing":[117],"field":[119],"analysis":[123],"for":[124],"algorithms":[128],"general.":[130]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":7},{"year":2019,"cited_by_count":8},{"year":2018,"cited_by_count":14},{"year":2017,"cited_by_count":3}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}
