{"id":"https://openalex.org/W2955270668","doi":"https://doi.org/10.1145/3321707.3321724","title":"Large-scale noise-resilient evolution-strategies","display_name":"Large-scale noise-resilient evolution-strategies","publication_year":2019,"publication_date":"2019-07-03","ids":{"openalex":"https://openalex.org/W2955270668","doi":"https://doi.org/10.1145/3321707.3321724","mag":"2955270668"},"language":"en","primary_location":{"id":"doi:10.1145/3321707.3321724","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3321707.3321724","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3321707.3321724","source":{"id":"https://openalex.org/S4363608932","display_name":"Proceedings of the Genetic and Evolutionary Computation Conference","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Genetic and Evolutionary Computation Conference","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3321707.3321724","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5071823183","display_name":"Oswin Krause","orcid":"https://orcid.org/0000-0002-0990-559X"},"institutions":[{"id":"https://openalex.org/I124055696","display_name":"University of Copenhagen","ror":"https://ror.org/035b05819","country_code":"DK","type":"education","lineage":["https://openalex.org/I124055696"]}],"countries":["DK"],"is_corresponding":true,"raw_author_name":"Oswin Krause","raw_affiliation_strings":["University of Copenhagen, Copenhagen, Denmark"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Copenhagen, Copenhagen, Denmark","institution_ids":["https://openalex.org/I124055696"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5071823183"],"corresponding_institution_ids":["https://openalex.org/I124055696"],"apc_list":null,"apc_paid":null,"fwci":0.5467,"has_fulltext":true,"cited_by_count":9,"citation_normalized_percentile":{"value":0.70805046,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"682","last_page":"690"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9998000264167786,"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.9998000264167786,"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/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.9995999932289124,"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/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9980999827384949,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5854678153991699},{"id":"https://openalex.org/keywords/noise","display_name":"Noise (video)","score":0.5625015497207642},{"id":"https://openalex.org/keywords/ranking","display_name":"Ranking (information retrieval)","score":0.5552513003349304},{"id":"https://openalex.org/keywords/weighting","display_name":"Weighting","score":0.5282382369041443},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5258229970932007},{"id":"https://openalex.org/keywords/stochastic-gradient-descent","display_name":"Stochastic gradient descent","score":0.5224317908287048},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4521610140800476},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.4346975088119507},{"id":"https://openalex.org/keywords/curse-of-dimensionality","display_name":"Curse of dimensionality","score":0.43233442306518555},{"id":"https://openalex.org/keywords/reinforcement-learning","display_name":"Reinforcement learning","score":0.42007631063461304},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3737543821334839},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.33627212047576904},{"id":"https://openalex.org/keywords/artificial-neural-network","display_name":"Artificial neural network","score":0.13572409749031067}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5854678153991699},{"id":"https://openalex.org/C99498987","wikidata":"https://www.wikidata.org/wiki/Q2210247","display_name":"Noise (video)","level":3,"score":0.5625015497207642},{"id":"https://openalex.org/C189430467","wikidata":"https://www.wikidata.org/wiki/Q7293293","display_name":"Ranking (information retrieval)","level":2,"score":0.5552513003349304},{"id":"https://openalex.org/C183115368","wikidata":"https://www.wikidata.org/wiki/Q856577","display_name":"Weighting","level":2,"score":0.5282382369041443},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5258229970932007},{"id":"https://openalex.org/C206688291","wikidata":"https://www.wikidata.org/wiki/Q7617819","display_name":"Stochastic gradient descent","level":3,"score":0.5224317908287048},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4521610140800476},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.4346975088119507},{"id":"https://openalex.org/C111030470","wikidata":"https://www.wikidata.org/wiki/Q1430460","display_name":"Curse of dimensionality","level":2,"score":0.43233442306518555},{"id":"https://openalex.org/C97541855","wikidata":"https://www.wikidata.org/wiki/Q830687","display_name":"Reinforcement learning","level":2,"score":0.42007631063461304},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3737543821334839},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.33627212047576904},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.13572409749031067},{"id":"https://openalex.org/C126838900","wikidata":"https://www.wikidata.org/wiki/Q77604","display_name":"Radiology","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/C71924100","wikidata":"https://www.wikidata.org/wiki/Q11190","display_name":"Medicine","level":0,"score":0.0},{"id":"https://openalex.org/C115961682","wikidata":"https://www.wikidata.org/wiki/Q860623","display_name":"Image (mathematics)","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3321707.3321724","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3321707.3321724","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3321707.3321724","source":{"id":"https://openalex.org/S4363608932","display_name":"Proceedings of the Genetic and Evolutionary Computation Conference","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Genetic and Evolutionary Computation Conference","raw_type":"proceedings-article"},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/03417840-2454-49bb-a5d5-7e613e51b555","is_oa":false,"landing_page_url":"https://researchprofiles.ku.dk/da/publications/03417840-2454-49bb-a5d5-7e613e51b555","pdf_url":null,"source":{"id":"https://openalex.org/S4306401983","display_name":"Research at the University of Copenhagen (University of Copenhagen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I124055696","host_organization_name":"University of Copenhagen","host_organization_lineage":["https://openalex.org/I124055696"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Krause , O 2019 , Large-scale noise-resilient evolution-strategies . in GECCO 2019 - Proceedings of the 2019 Genetic and Evolutionary Computation Conference . Association for Computing Machinery , pp. 682-690 , 2019 Genetic and Evolutionary Computation Conference, GECCO 2019 , Prague , Czech Republic , 13/07/2019 . https://doi.org/10.1145/3321707.3321724","raw_type":"contributionToPeriodical"}],"best_oa_location":{"id":"doi:10.1145/3321707.3321724","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3321707.3321724","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3321707.3321724","source":{"id":"https://openalex.org/S4363608932","display_name":"Proceedings of the Genetic and Evolutionary Computation Conference","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Genetic and Evolutionary Computation Conference","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320331681","display_name":"Fondation Pour La Conservation Du Saumon Atlantique","ror":null}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2955270668.pdf","grobid_xml":"https://content.openalex.org/works/W2955270668.grobid-xml"},"referenced_works_count":20,"referenced_works":["https://openalex.org/W1479971399","https://openalex.org/W1480347379","https://openalex.org/W2059654640","https://openalex.org/W2084572100","https://openalex.org/W2104578628","https://openalex.org/W2105014696","https://openalex.org/W2112036188","https://openalex.org/W2112269233","https://openalex.org/W2121811374","https://openalex.org/W2142508340","https://openalex.org/W2488432052","https://openalex.org/W2510156930","https://openalex.org/W2549617326","https://openalex.org/W2604423023","https://openalex.org/W2616451375","https://openalex.org/W2804912073","https://openalex.org/W2885580467","https://openalex.org/W2946586661","https://openalex.org/W2963275203","https://openalex.org/W4300702844"],"related_works":["https://openalex.org/W2180954594","https://openalex.org/W2052835778","https://openalex.org/W2049003611","https://openalex.org/W2127804977","https://openalex.org/W2108418243","https://openalex.org/W164103134","https://openalex.org/W2040545019","https://openalex.org/W2787352659","https://openalex.org/W1970611213","https://openalex.org/W4206560911"],"abstract_inverted_index":{"Ranking-based":[0],"Evolution":[1],"Strategies":[2],"(ES)":[3],"are":[4],"efficient":[5],"algorithms":[6],"for":[7,25,162],"problems":[8],"where":[9],"gradient-information":[10],"is":[11,18,62,76,100,106,116,153,167,186,192],"not":[12,19],"available":[13],"or":[14],"when":[15],"the":[16,31,35,40,43,73,93,104,110,113,120,125,134,140,147,151,156,171,189],"gradient":[17,89],"informative.":[20],"This":[21],"makes":[22,52],"ES":[23,49,177],"interesting":[24],"Reinforcement-Learning":[26],"(RL).":[27],"However,":[28],"in":[29,85,119],"RL":[30],"high":[32],"dimensionality":[33],"of":[34,42,48,60,95,112,122,133,142,146,158],"search-space,":[36],"as":[37,39],"well":[38],"noise":[41],"simulations":[44],"make":[45],"direct":[46],"adaptation":[47,145],"challenging.":[50],"Noise":[51],"ranking":[53],"points":[54],"difficult":[55],"and":[56,103,182],"a":[57,66,79,159,196],"large":[58],"budget":[59],"re-evaluations":[61],"needed":[63],"to":[64,129],"maintain":[65],"bounded":[67],"error":[68],"rate.":[69],"In":[70],"this":[71],"work,":[72],"ranked":[74],"weighting":[75,81],"replaced":[77],"by":[78],"linear":[80],"function,":[82],"which":[83],"results":[84,111],"nearly":[86],"unbiased":[87],"stochastic":[88],"descent":[90],"(SGD)":[91],"on":[92,109,139,150,175],"manifold":[94],"probability":[96],"distributions.":[97],"The":[98],"approach":[99],"theoretically":[101],"analysed":[102],"algorithm":[105,126,191],"adapted":[107],"based":[108,149],"analysis.":[114],"It":[115,166],"shown":[117,168,187],"that":[118,170,188],"limit":[121],"infinite":[123],"dimensions,":[124],"becomes":[127],"invariant":[128],"smooth":[130],"monotonous":[131],"transformations":[132],"objective":[135],"function.":[136],"Further,":[137,184],"drawing":[138],"theory":[141],"SGD,":[143],"an":[144],"learning-rates":[148],"noise-level":[152],"proposed":[154,172,190],"at":[155],"cost":[157],"second":[160],"evaluation":[161],"every":[163],"sampled":[164],"point.":[165],"empirically":[169],"method":[173],"improves":[174],"simple":[176],"using":[178],"Cumulative":[179],"Step-size":[180],"Adaptation":[181],"ranking.":[183],"it":[185],"more":[193],"noise-resilient":[194],"than":[195],"ranking-based":[197],"approach.":[198]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2021,"cited_by_count":5}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}