{"id":"https://openalex.org/W4313414603","doi":"https://doi.org/10.3390/a16010017","title":"Hyperparameter Optimization Using Successive Halving with Greedy Cross Validation","display_name":"Hyperparameter Optimization Using Successive Halving with Greedy Cross Validation","publication_year":2022,"publication_date":"2022-12-27","ids":{"openalex":"https://openalex.org/W4313414603","doi":"https://doi.org/10.3390/a16010017"},"language":"en","primary_location":{"id":"doi:10.3390/a16010017","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a16010017","pdf_url":"https://www.mdpi.com/1999-4893/16/1/17/pdf?version=1672135360","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.mdpi.com/1999-4893/16/1/17/pdf?version=1672135360","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5059986259","display_name":"Daniel S. Soper","orcid":"https://orcid.org/0000-0002-5922-3415"},"institutions":[{"id":"https://openalex.org/I4210133369","display_name":"Decision Sciences (United States)","ror":"https://ror.org/03gcvf773","country_code":"US","type":"company","lineage":["https://openalex.org/I4210133369"]},{"id":"https://openalex.org/I142934699","display_name":"California State University, Fullerton","ror":"https://ror.org/02avqqw26","country_code":"US","type":"education","lineage":["https://openalex.org/I142934699"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Daniel S. Soper","raw_affiliation_strings":["Information Systems & Decision Sciences Department, California State University, Fullerton, CA 92831, USA"],"affiliations":[{"raw_affiliation_string":"Information Systems & Decision Sciences Department, California State University, Fullerton, CA 92831, USA","institution_ids":["https://openalex.org/I142934699","https://openalex.org/I4210133369"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5059986259"],"corresponding_institution_ids":["https://openalex.org/I142934699","https://openalex.org/I4210133369"],"apc_list":{"value":1400,"currency":"CHF","value_usd":1515},"apc_paid":{"value":1400,"currency":"CHF","value_usd":1515},"fwci":3.3064,"has_fulltext":true,"cited_by_count":24,"citation_normalized_percentile":{"value":0.93306036,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":98,"max":99},"biblio":{"volume":"16","issue":"1","first_page":"17","last_page":"17"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9991000294685364,"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/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9991000294685364,"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/T12535","display_name":"Machine Learning and Data Classification","score":0.998199999332428,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9980000257492065,"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/hyperparameter","display_name":"Hyperparameter","score":0.9107472896575928},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6632909774780273},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.6535854339599609},{"id":"https://openalex.org/keywords/cross-validation","display_name":"Cross-validation","score":0.6282196640968323},{"id":"https://openalex.org/keywords/hyperparameter-optimization","display_name":"Hyperparameter optimization","score":0.5430599451065063},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.5307901501655579},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.44400957226753235},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.4331378638744354},{"id":"https://openalex.org/keywords/model-selection","display_name":"Model selection","score":0.42329853773117065},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.35407137870788574},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3519633412361145},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.230768084526062},{"id":"https://openalex.org/keywords/support-vector-machine","display_name":"Support vector machine","score":0.14882400631904602}],"concepts":[{"id":"https://openalex.org/C8642999","wikidata":"https://www.wikidata.org/wiki/Q4171168","display_name":"Hyperparameter","level":2,"score":0.9107472896575928},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6632909774780273},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.6535854339599609},{"id":"https://openalex.org/C27181475","wikidata":"https://www.wikidata.org/wiki/Q541014","display_name":"Cross-validation","level":2,"score":0.6282196640968323},{"id":"https://openalex.org/C10485038","wikidata":"https://www.wikidata.org/wiki/Q48996162","display_name":"Hyperparameter optimization","level":3,"score":0.5430599451065063},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.5307901501655579},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.44400957226753235},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.4331378638744354},{"id":"https://openalex.org/C93959086","wikidata":"https://www.wikidata.org/wiki/Q6888345","display_name":"Model selection","level":2,"score":0.42329853773117065},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35407137870788574},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3519633412361145},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.230768084526062},{"id":"https://openalex.org/C12267149","wikidata":"https://www.wikidata.org/wiki/Q282453","display_name":"Support vector machine","level":2,"score":0.14882400631904602}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.3390/a16010017","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a16010017","pdf_url":"https://www.mdpi.com/1999-4893/16/1/17/pdf?version=1672135360","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:95471a14501440a5a39fc1770cc45914","is_oa":true,"landing_page_url":"https://doaj.org/article/95471a14501440a5a39fc1770cc45914","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms, Vol 16, Iss 1, p 17 (2022)","raw_type":"article"},{"id":"pmh:oai:mdpi.com:/1999-4893/16/1/17/","is_oa":true,"landing_page_url":"https://dx.doi.org/10.3390/a16010017","pdf_url":null,"source":{"id":"https://openalex.org/S4306400947","display_name":"MDPI (MDPI AG)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210097602","host_organization_name":"Multidisciplinary Digital Publishing Institute (Switzerland)","host_organization_lineage":["https://openalex.org/I4210097602"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms","raw_type":"Text"}],"best_oa_location":{"id":"doi:10.3390/a16010017","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a16010017","pdf_url":"https://www.mdpi.com/1999-4893/16/1/17/pdf?version=1672135360","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4313414603.pdf","grobid_xml":"https://content.openalex.org/works/W4313414603.grobid-xml"},"referenced_works_count":28,"referenced_works":["https://openalex.org/W1536826708","https://openalex.org/W1539741229","https://openalex.org/W1575029535","https://openalex.org/W2014374971","https://openalex.org/W2023320048","https://openalex.org/W2063978378","https://openalex.org/W2101234009","https://openalex.org/W2131241448","https://openalex.org/W2166107799","https://openalex.org/W2209840346","https://openalex.org/W2250904038","https://openalex.org/W2556522401","https://openalex.org/W2594830834","https://openalex.org/W2618530766","https://openalex.org/W2749093116","https://openalex.org/W3009009611","https://openalex.org/W3195075407","https://openalex.org/W4213009331","https://openalex.org/W4213308398","https://openalex.org/W4248156351","https://openalex.org/W4251742697","https://openalex.org/W4288625073","https://openalex.org/W6675354045","https://openalex.org/W6678911119","https://openalex.org/W6683584131","https://openalex.org/W6730169791","https://openalex.org/W6774926797","https://openalex.org/W6833387226"],"related_works":["https://openalex.org/W2953665647","https://openalex.org/W4281646320","https://openalex.org/W4205712847","https://openalex.org/W3169687406","https://openalex.org/W4388119537","https://openalex.org/W3014750173","https://openalex.org/W3114025147","https://openalex.org/W4287818966","https://openalex.org/W3192751261","https://openalex.org/W4380552001"],"abstract_inverted_index":{"Training":[0],"and":[1,18],"evaluating":[2],"the":[3,21,37,64,97,104,108,141,145,155,158,163],"performance":[4,143],"of":[5,43,67,107,134,144,157],"many":[6],"competing":[7],"Artificial":[8],"Intelligence":[9],"(AI)/Machine":[10],"Learning":[11],"(ML)":[12],"models":[13,47,102,160],"can":[14],"be":[15],"very":[16],"time-consuming":[17],"expensive.":[19],"Furthermore,":[20],"costs":[22],"associated":[23],"with":[24,52],"this":[25],"hyperparameter":[26,50,69],"optimization":[27,51],"task":[28],"grow":[29],"exponentially":[30],"when":[31,48],"cross":[32,53,86,92,124],"validation":[33,54,87,93,125],"is":[34,55,126,136,168,183],"used":[35],"during":[36,103],"model":[38,109],"selection":[39,110],"process.":[40,111],"Finding":[41],"ways":[42],"quickly":[44],"identifying":[45],"high-performing":[46],"conducting":[49],"hence":[56],"an":[57],"important":[58],"problem":[59],"in":[60,121],"AI/ML":[61,101,159],"research.":[62],"Among":[63],"proposed":[65,146],"methods":[66],"accelerating":[68],"optimization,":[70],"successive":[71,118,129,148,165,176,181,192],"halving":[72,119,149,166,182],"has":[73,88],"emerged":[74],"as":[75],"a":[76,90,116],"popular,":[77],"state-of-the-art":[78],"early":[79,105],"stopping":[80],"algorithm.":[81,150],"Concurrently,":[82],"recent":[83],"work":[84],"on":[85],"yielded":[89],"greedy":[91,117,123,147,164,180],"algorithm":[94,120,167],"that":[95,154,179],"prioritizes":[96],"most":[98],"promising":[99],"candidate":[100],"stages":[106],"The":[112,151],"current":[113],"paper":[114],"proposes":[115],"which":[122],"integrated":[127],"into":[128],"halving.":[130,193],"An":[131],"extensive":[132],"series":[133],"experiments":[135],"then":[137],"conducted":[138],"to":[139,171],"evaluate":[140],"comparative":[142],"results":[152],"show":[153],"quality":[156],"selected":[161,173],"by":[162,174],"statistically":[169],"identical":[170],"those":[172],"standard":[175,191],"halving,":[177],"but":[178],"typically":[184],"more":[185],"than":[186,190],"3.5":[187],"times":[188],"faster":[189]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":8},{"year":2024,"cited_by_count":6},{"year":2023,"cited_by_count":8}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}