{"id":"https://openalex.org/W7164168178","doi":"https://doi.org/10.48550/arxiv.2606.10068","title":"Importance-Aware Scheduling for High-Dimensional Hyperparameter Optimization","display_name":"Importance-Aware Scheduling for High-Dimensional Hyperparameter Optimization","publication_year":2026,"publication_date":"2026-06-08","ids":{"openalex":"https://openalex.org/W7164168178","doi":"https://doi.org/10.48550/arxiv.2606.10068"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2606.10068","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.10068","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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.2606.10068","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5010808042","display_name":"Ruinan Wang","orcid":"https://orcid.org/0009-0003-1218-2921"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Wang, Ruinan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5138324490","display_name":"Ian Nabney","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Nabney, Ian","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5056404513","display_name":"Mohammad Golbabaee","orcid":"https://orcid.org/0000-0001-5822-2990"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Golbabaee, Mohammad","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/T12535","display_name":"Machine Learning and Data Classification","score":0.9301999807357788,"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/T12535","display_name":"Machine Learning and Data Classification","score":0.9301999807357788,"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.019300000742077827,"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/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.009800000116229057,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/hyperparameter","display_name":"Hyperparameter","score":0.9049000144004822},{"id":"https://openalex.org/keywords/curse-of-dimensionality","display_name":"Curse of dimensionality","score":0.7102000117301941},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6668999791145325},{"id":"https://openalex.org/keywords/hyperparameter-optimization","display_name":"Hyperparameter optimization","score":0.5428000092506409},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.41530001163482666},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.33709999918937683}],"concepts":[{"id":"https://openalex.org/C8642999","wikidata":"https://www.wikidata.org/wiki/Q4171168","display_name":"Hyperparameter","level":2,"score":0.9049000144004822},{"id":"https://openalex.org/C111030470","wikidata":"https://www.wikidata.org/wiki/Q1430460","display_name":"Curse of dimensionality","level":2,"score":0.7102000117301941},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6668999791145325},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6507999897003174},{"id":"https://openalex.org/C10485038","wikidata":"https://www.wikidata.org/wiki/Q48996162","display_name":"Hyperparameter optimization","level":3,"score":0.5428000092506409},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5113999843597412},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.41530001163482666},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.33709999918937683},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.3303999900817871},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.3077999949455261},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.30730000138282776},{"id":"https://openalex.org/C126661757","wikidata":"https://www.wikidata.org/wiki/Q4925641","display_name":"Random search","level":2,"score":0.3057999908924103},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.30219998955726624},{"id":"https://openalex.org/C2987595161","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Optimization algorithm","level":2,"score":0.3021000027656555},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2906999886035919},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.2702000141143799},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.25690001249313354}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2606.10068","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.10068","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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.2606.10068","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.10068","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":[{"id":"https://metadata.un.org/sdg/9","score":0.42214834690093994,"display_name":"Industry, innovation and infrastructure"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Hyperparameter":[0],"Optimization":[1],"(HPO)":[2],"is":[3,24,101,148],"essential":[4],"for":[5],"building":[6],"high-performing":[7],"ML/DL":[8],"models,":[9],"yet":[10],"conventional":[11],"optimizers":[12],"often":[13],"struggle":[14],"in":[15,158],"high-dimensional":[16,159],"spaces":[17],"where":[18,97],"evaluations":[19],"are":[20,109],"costly":[21],"and":[22,56,74,92,119,151],"progress":[23],"diluted":[25],"across":[26],"many":[27],"low-impact":[28],"variables.":[29],"We":[30,61,128],"propose":[31],"Greedy":[32],"Importance":[33],"First":[34],"(GIF),":[35],"an":[36],"importance-aware":[37],"scheduling":[38],"strategy":[39],"that":[40,114,131,146],"uses":[41],"a":[42,58,149],"small-sample":[43],"warm":[44],"start":[45],"to":[46,125,154],"estimate":[47],"hyperparameter":[48],"importance,":[49],"forms":[50],"importance-based":[51],"groups,":[52],"allocates":[53],"trials":[54],"proportionally,":[55],"retains":[57],"full-space":[59],"fallback.":[60],"evaluate":[62],"GIF":[63,80,103,147],"under":[64],"fixed":[65],"evaluation":[66],"budgets":[67],"on":[68,139],"five":[69],"anisotropic":[70],"analytic":[71,141],"functions,":[72],"Bayesmark,":[73,96],"NAS-Bench-301.":[75],"On":[76,95],"the":[77,98,107,120,126,132,136,140],"higher-dimensional":[78],"benchmarks,":[79],"reaches":[81],"better":[82],"incumbents":[83],"with":[84],"faster":[85],"convergence":[86],"than":[87],"TPE,":[88],"BOHB,":[89],"Random":[90],"Search,":[91],"Sequential":[93],"Grouping.":[94],"effective":[99],"dimensionality":[100],"smaller,":[102],"remains":[104],"competitive":[105],"but":[106],"margins":[108],"smaller.":[110],"Ablation":[111],"studies":[112],"show":[113],"importance":[115],"estimation,":[116],"proportional":[117],"allocation,":[118],"fallback":[121],"step":[122],"all":[123],"contribute":[124],"gains.":[127],"also":[129],"verify":[130],"HIA":[133],"component":[134],"recovers":[135],"intended":[137],"anisotropy":[138],"benchmarks.":[142],"These":[143],"results":[144],"suggest":[145],"simple":[150],"plug-compatible":[152],"way":[153],"improve":[155],"sample":[156],"efficiency":[157],"HPO.":[160]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-06-11T00:00:00"}