{"id":"https://openalex.org/W4206979291","doi":"https://doi.org/10.1109/ssci50451.2021.9660174","title":"Towards Feature-Free Automated Algorithm Selection for Single-Objective Continuous Black-Box Optimization","display_name":"Towards Feature-Free Automated Algorithm Selection for Single-Objective Continuous Black-Box Optimization","publication_year":2021,"publication_date":"2021-12-05","ids":{"openalex":"https://openalex.org/W4206979291","doi":"https://doi.org/10.1109/ssci50451.2021.9660174"},"language":"en","primary_location":{"id":"doi:10.1109/ssci50451.2021.9660174","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ssci50451.2021.9660174","pdf_url":null,"source":{"id":"https://openalex.org/S4363604921","display_name":"2021 IEEE Symposium Series on Computational Intelligence (SSCI)","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":"2021 IEEE Symposium Series on Computational Intelligence (SSCI)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5011446626","display_name":"Raphael Patrick Prager","orcid":"https://orcid.org/0000-0003-1237-4248"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Raphael Patrick Prager","raw_affiliation_strings":["Statistics and Optimization University of M&#x00FC;nster,M&#x00FC;nster,Germany"],"affiliations":[{"raw_affiliation_string":"Statistics and Optimization University of M&#x00FC;nster,M&#x00FC;nster,Germany","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5026873752","display_name":"Moritz Vinzent Seiler","orcid":"https://orcid.org/0000-0002-1750-9060"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Moritz Vinzent Seiler","raw_affiliation_strings":["Statistics and Optimization University of M&#x00FC;nster,M&#x00FC;nster,Germany"],"affiliations":[{"raw_affiliation_string":"Statistics and Optimization University of M&#x00FC;nster,M&#x00FC;nster,Germany","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5084825454","display_name":"Heike Trautmann","orcid":"https://orcid.org/0000-0002-9788-8282"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Heike Trautmann","raw_affiliation_strings":["Statistics and Optimization University of M&#x00FC;nster,M&#x00FC;nster,Germany"],"affiliations":[{"raw_affiliation_string":"Statistics and Optimization University of M&#x00FC;nster,M&#x00FC;nster,Germany","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5008455153","display_name":"Pascal Kerschke","orcid":"https://orcid.org/0000-0003-2862-1418"},"institutions":[{"id":"https://openalex.org/I78650965","display_name":"TU Dresden","ror":"https://ror.org/042aqky30","country_code":"DE","type":"education","lineage":["https://openalex.org/I78650965"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Pascal Kerschke","raw_affiliation_strings":["Big Data Analytics in Transportation TU Dresden,Dresden,Germany","Big Data Analytics in Transportation TU Dresden, Dresden, Germany"],"affiliations":[{"raw_affiliation_string":"Big Data Analytics in Transportation TU Dresden,Dresden,Germany","institution_ids":["https://openalex.org/I78650965"]},{"raw_affiliation_string":"Big Data Analytics in Transportation TU Dresden, Dresden, Germany","institution_ids":["https://openalex.org/I78650965"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5011446626"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.754,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.75331838,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"8"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9998999834060669,"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.9998999834060669,"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.9998999834060669,"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/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.9976999759674072,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.6676098108291626},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6645005345344543},{"id":"https://openalex.org/keywords/black-box","display_name":"Black box","score":0.5280307531356812},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.49237120151519775},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.4421634078025818},{"id":"https://openalex.org/keywords/modular-design","display_name":"Modular design","score":0.4281045198440552},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.4251669943332672},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4088604748249054},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.3211819529533386},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.22237953543663025}],"concepts":[{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.6676098108291626},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6645005345344543},{"id":"https://openalex.org/C94966114","wikidata":"https://www.wikidata.org/wiki/Q29256","display_name":"Black box","level":2,"score":0.5280307531356812},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.49237120151519775},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.4421634078025818},{"id":"https://openalex.org/C101468663","wikidata":"https://www.wikidata.org/wiki/Q1620158","display_name":"Modular design","level":2,"score":0.4281045198440552},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.4251669943332672},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4088604748249054},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.3211819529533386},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.22237953543663025},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","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},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ssci50451.2021.9660174","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ssci50451.2021.9660174","pdf_url":null,"source":{"id":"https://openalex.org/S4363604921","display_name":"2021 IEEE Symposium Series on Computational Intelligence (SSCI)","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":"2021 IEEE Symposium Series on Computational Intelligence (SSCI)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions","score":0.5}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W1471542436","https://openalex.org/W1495775210","https://openalex.org/W2063966510","https://openalex.org/W2095314857","https://openalex.org/W2099087967","https://openalex.org/W2101234009","https://openalex.org/W2150337126","https://openalex.org/W2151554678","https://openalex.org/W2157331557","https://openalex.org/W2506038236","https://openalex.org/W2734645630","https://openalex.org/W2750236386","https://openalex.org/W2768348081","https://openalex.org/W2768617563","https://openalex.org/W2883780447","https://openalex.org/W2898873842","https://openalex.org/W2908510526","https://openalex.org/W2951665692","https://openalex.org/W2955587577","https://openalex.org/W3029372092","https://openalex.org/W3038891809","https://openalex.org/W3098258749","https://openalex.org/W3105047877","https://openalex.org/W3107783396","https://openalex.org/W4256333068","https://openalex.org/W6675354045","https://openalex.org/W6745609711","https://openalex.org/W6753767121","https://openalex.org/W6757817989","https://openalex.org/W6786151234"],"related_works":["https://openalex.org/W2378211422","https://openalex.org/W2745001401","https://openalex.org/W4321353415","https://openalex.org/W2130974462","https://openalex.org/W972276598","https://openalex.org/W4246352526","https://openalex.org/W2028665553","https://openalex.org/W2086519370","https://openalex.org/W3088304681","https://openalex.org/W4385437088"],"abstract_inverted_index":{"We":[0],"propose":[1],"a":[2,36,44,48,70,118,192],"novel":[3],"method":[4,126],"for":[5,195],"automated":[6,147],"algorithm":[7,148,154],"selection":[8,29,149],"in":[9,63,146],"the":[10,28,58,76,80,85,95,151,157,164,168,171],"domain":[11],"of":[12,47,60,109,120,132,161,170,200],"single-objective":[13],"continuous":[14],"black-box":[15],"optimization.":[16],"In":[17,97,112],"contrast":[18],"to":[19,78,197],"existing":[20],"methods,":[21],"we":[22,116],"use":[23,169],"convolutional":[24],"neural":[25],"networks":[26],"as":[27],"apparatus":[30],"which":[31,74],"bases":[32],"its":[33,136,184],"decision":[34],"on":[35,177,186],"so-called":[37],"\u2018fitness":[38],"map\u2019.":[39],"This":[40,190],"fitness":[41,172],"map":[42,173],"is":[43,127,138,174],"2D":[45],"representation":[46],"two":[49],"dimensional":[50],"search":[51],"space":[52],"where":[53,105],"different":[54,101],"gray":[55],"scales":[56],"indicate":[57,166],"quality":[59],"found":[61],"solutions":[62],"certain":[64],"areas.":[65],"Our":[66],"devised":[67],"approach":[68],"uses":[69],"modular":[71],"CMA-ES":[72,83],"framework":[73],"offers":[75,191],"option":[77],"create":[79],"conventional":[81],"CMA-ES,":[82],"with":[84],"alternate":[86],"step-size":[87],"adaptation":[88],"and":[89,135,156,203],"many":[90],"other":[91,198],"variants":[92],"proposed":[93],"over":[94],"years.":[96],"total,":[98],"4":[99],"608":[100],"configurations":[102,107],"are":[103,108,143],"possible":[104,122],"most":[106],"complementary":[110],"nature.":[111],"this":[113],"proof-of-concept":[114],"work,":[115],"consider":[117],"subset":[119],"32":[121],"configurations.":[123,162],"The":[124],"developed":[125],"evaluated":[128],"against":[129,140],"an":[130],"excerpt":[131],"BBOB":[133],"functions":[134],"performance":[137],"compared":[139],"baselines":[141],"that":[142,167],"commonly":[144],"used":[145],"-":[150],"best":[152,158],"standalone":[153],"(configuration)":[155],"obtainable":[159],"sequence":[160],"While":[163],"results":[165],"not":[175],"superior":[176],"every":[178],"benchmark":[179],"problem,":[180],"it":[181],"indubitably":[182],"shows":[183],"merit":[185],"more":[187],"hard-to-solve":[188],"problems.":[189],"promising":[193],"perspective":[194],"generalizing":[196],"types":[199],"optimization":[201],"problems":[202],"problem":[204],"domains.":[205]},"counts_by_year":[{"year":2025,"cited_by_count":6},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}
