{"id":"https://openalex.org/W7162751966","doi":"https://doi.org/10.48550/arxiv.2605.29477","title":"Runtime Analysis of a Compact Genetic Algorithm on a Truly Multi-valued OneMax Function","display_name":"Runtime Analysis of a Compact Genetic Algorithm on a Truly Multi-valued OneMax Function","publication_year":2026,"publication_date":"2026-05-28","ids":{"openalex":"https://openalex.org/W7162751966","doi":"https://doi.org/10.48550/arxiv.2605.29477"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2605.29477","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.29477","pdf_url":null,"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2605.29477","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5136556017","display_name":"Martin S. Krejca","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Krejca, Martin S.","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5038689623","display_name":"Carsten Witt","orcid":"https://orcid.org/0000-0002-6105-7700"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Witt, Carsten","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.4442000091075897,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.4442000091075897,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.06360000371932983,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.041099999099969864,"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/dimension","display_name":"Dimension (graph theory)","score":0.635699987411499},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.6245999932289124},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.5271000266075134},{"id":"https://openalex.org/keywords/ideal","display_name":"Ideal (ethics)","score":0.37310001254081726},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.35760000348091125},{"id":"https://openalex.org/keywords/current","display_name":"Current (fluid)","score":0.29649999737739563}],"concepts":[{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.635699987411499},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6291000247001648},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.6245999932289124},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.5271000266075134},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4348999857902527},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4325000047683716},{"id":"https://openalex.org/C2776639384","wikidata":"https://www.wikidata.org/wiki/Q840396","display_name":"Ideal (ethics)","level":2,"score":0.37310001254081726},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.35760000348091125},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3492000102996826},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3409999907016754},{"id":"https://openalex.org/C148043351","wikidata":"https://www.wikidata.org/wiki/Q4456944","display_name":"Current (fluid)","level":2,"score":0.29649999737739563},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.2915000021457672},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.28619998693466187},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.27649998664855957},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.2736999988555908},{"id":"https://openalex.org/C501734568","wikidata":"https://www.wikidata.org/wiki/Q42918","display_name":"Mutation","level":3,"score":0.26600000262260437}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2605.29477","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.29477","pdf_url":null,"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2605.29477","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.29477","pdf_url":null,"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Recently,":[0],"the":[1,9,79,119,130,134,153,178,189],"runtime":[2,69,101],"analysis":[3,70],"of":[4,11,45,71,118,188],"multi-valued":[5,30,73,80,179],"estimation-of-distribution":[6],"algorithms":[7],"in":[8,34,147,177],"framework":[10],"Ben":[12],"Jedidia":[13],"et":[14],"al.":[15],"(TCS":[16],"2024)":[17],"has":[18],"made":[19],"significant":[20],"advancements.":[21],"However,":[22],"almost":[23],"all":[24,95],"existing":[25,131],"analyses":[26],"are":[27],"limited":[28],"to":[29,109,127,172],"objective":[31],"functions":[32],"that":[33],"each":[35],"dimension":[36],"only":[37,141],"distinguish":[38],"between":[39],"two":[40,143],"types,":[41],"also":[42],"called":[43],"categories,":[44],"values":[46,144],"and":[47,61,91,145,167,185],"hence":[48],"can":[49],"be":[50],"treated":[51],"with":[52,163],"similar":[53],"methods":[54],"as":[55],"pseudo-Boolean":[56],"problems.":[57],"Only":[58],"recently,":[59],"Adak":[60],"Witt":[62],"(GECCO":[63],"2025)":[64],"have":[65],"presented":[66],"a":[67,72],"first":[68],"compact":[74],"genetic":[75],"algorithm":[76],"(cGA)":[77],"on":[78,94,142],"OneMax":[81,137],"function":[82,138],"G-OneMax$\\colon":[83],"\\{0,\\dots,r-1\\}^n":[84],"\\to":[85],"\\mathbf{N}$":[86],"defined":[87],"by":[88],"G-OneMax$(x_1,\\dots,x_n)=\\sum_{i=1}^n":[89],"{x}_i$":[90],"truly":[92],"depending":[93,139],"$r$":[96],"categories.":[97],"We":[98],"improve":[99],"their":[100],"result":[102,124],"from":[103],"$\\textrm{O}\\bigl(n":[104,110],"r^3":[105],"\\log^2(":[106],"n)\\log":[107],"(r)\\bigr)$":[108],"r":[111],"\\log^3(n)\\log^3(r)\\bigr)$,":[112],"both":[113],"for":[114,133,161],"an":[115],"optimal":[116],"choice":[117],"update":[120],"strength":[121],"$K$.":[122],"Our":[123],"matches,":[125],"up":[126],"polylogarithmic":[128],"factors,":[129],"bound":[132],"simpler":[135],"$r$-valued":[136,190],"essentially":[140],"analyzed":[146],"several":[148],"previous":[149],"works.":[150],"To":[151],"show":[152],"new":[154],"bound,":[155],"we":[156],"use":[157],"improved":[158],"drift":[159],"theorems":[160],"processes":[162],"high":[164],"self-loop":[165],"probabilities":[166],"specifically":[168],"derived":[169],"concentration":[170],"inequalities":[171],"analyze":[173],"how":[174],"probability":[175],"mass":[176],"cGA":[180],"moves":[181],"into":[182],"successively":[183],"smaller":[184,186],"intervals":[187],"frequency":[191],"matrix.":[192]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-05-30T00:00:00"}