{"id":"https://openalex.org/W7095960882","doi":null,"title":"Sequential Model-Based Optimization for General Algorithm Configuration (extended version)","display_name":"Sequential Model-Based Optimization for General Algorithm Configuration (extended version)","alternate_titles":[],"publication_year":null,"publication_date":null,"ids":{"openalex":"https://openalex.org/W7095960882"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.185.1993","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.185.1993","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.ubc.ca/spider/hutter/papers/10-TR-SMAC.pdf","raw_type":"text"},"parent_works":[],"lineage":["https://openalex.org/W7095960882"],"child_works_count":0,"type":"article","is_traditional":true,"indexed_in":[],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Frank Hutter","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Frank Hutter","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5025342513","display_name":"Holger H. Hoos","orcid":"https://orcid.org/0000-0003-0629-0099","observed_orcids":["https://orcid.org/0000-0003-0629-0099"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Holger H. Hoos","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5089807699","display_name":"Kevin Leyton\u2010Brown","orcid":"https://orcid.org/0000-0002-7644-5327","observed_orcids":["https://orcid.org/0000-0002-7644-5327"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kevin Leyton-brown","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":4,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":true,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.5307999849319458,"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.5307999849319458,"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/T12535","display_name":"Machine Learning and Data Classification","score":0.3508000075817108,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.05400000140070915,"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/algorithm-configuration","display_name":"algorithm configuration","score":0.9829999804496765},{"id":"https://openalex.org/keywords/sequential-model-based-optimization","display_name":"sequential model-based optimization","score":0.9440000057220459},{"id":"https://openalex.org/keywords/regression-models","display_name":"regression models","score":0.6899999976158142},{"id":"https://openalex.org/keywords/propositional-satisfiability","display_name":"propositional satisfiability","score":0.8730000257492065},{"id":"https://openalex.org/keywords/mixed-integer-programming","display_name":"mixed integer programming","score":0.8820000290870667},{"id":"https://openalex.org/keywords/cplex","display_name":"CPLEX","score":0.7379999756813049},{"id":"https://openalex.org/keywords/hyperparameter-optimization","display_name":"hyperparameter optimization","score":0.5899999737739563}],"concepts":[{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.6834999918937683},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5602999925613403},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5511000156402588},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5239999890327454},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.49390000104904175},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.4767000079154968},{"id":"https://openalex.org/C5274069","wikidata":"https://www.wikidata.org/wiki/Q2285707","display_name":"Categorical variable","level":2,"score":0.4440999925136566},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.43560001254081726},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.4018000066280365},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3736000061035156},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.36579999327659607},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.3580000102519989},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.34790000319480896},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.3456999957561493},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.3199999928474426},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.31450000405311584},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.31130000948905945},{"id":"https://openalex.org/C72434380","wikidata":"https://www.wikidata.org/wiki/Q230930","display_name":"State space","level":2,"score":0.29670000076293945},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.2888000011444092},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.28299999237060547},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.2768000066280365},{"id":"https://openalex.org/C143936061","wikidata":"https://www.wikidata.org/wiki/Q2030088","display_name":"DPLL algorithm","level":4,"score":0.27379998564720154},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.2712000012397766},{"id":"https://openalex.org/C69562738","wikidata":"https://www.wikidata.org/wiki/Q200694","display_name":"Propositional calculus","level":2,"score":0.2671000063419342},{"id":"https://openalex.org/C203208320","wikidata":"https://www.wikidata.org/wiki/Q5150830","display_name":"Combinatorial search","level":4,"score":0.25040000677108765}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.185.1993","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.185.1993","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.ubc.ca/spider/hutter/papers/10-TR-SMAC.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.676.3559","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.676.3559","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.ubc.ca/labs/beta/Projects/SMAC/papers/11-LION5-SMAC.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.737.3206","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.737.3206","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.ubc.ca/%7Ehoos/Publ/HutEtAl11.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W7099298427","https://openalex.org/W60686164","https://openalex.org/W2346138280","https://openalex.org/W2950680102","https://openalex.org/W2295272781","https://openalex.org/W164287990","https://openalex.org/W7098171795","https://openalex.org/W7098505257","https://openalex.org/W2963248505","https://openalex.org/W7098540129"],"abstract_inverted_index":{"Abstract.":[0],"State-of-the-art":[1],"algorithms":[2],"for":[3,41,58,106,121,143],"hard":[4],"computational":[5],"problems":[6],"often":[7],"ex-pose":[8],"many":[9,116,170],"parameters":[10,95,118],"that":[11],"can":[12],"be":[13],"modified":[14],"to":[15,33,35,49,69,88,110],"improve":[16],"empirical":[17],"performance.":[18],"However,":[19],"manually":[20],"exploring":[21],"the":[22,53,56,71,89,107,144,152,173],"resulting":[23],"combinatorial":[24],"space":[25],"of":[26,55,73,91,123],"parameter":[27,78],"set-tings":[28],"is":[29],"tedious":[30],"and":[31,119,138,168],"tends":[32],"lead":[34],"unsatisfactory":[36],"outcomes.":[37],"Recently,":[38],"automated":[39],"approaches":[40],"solving":[42,59],"this":[43,81,100,104],"algorithm":[44,75,94,112,130],"configuration":[45,113,131,176],"problem":[46,147],"have":[47],"led":[48],"substantial":[50],"improvements":[51],"in":[52,169],"state":[54],"art":[57],"various":[60],"problems.":[61],"One":[62],"promising":[63],"approach":[64,82],"constructs":[65],"explicit":[66],"regression":[67],"models":[68],"describe":[70],"dependence":[72],"target":[74],"performance":[76],"on":[77,96],"settings;":[79],"however,":[80],"has":[83],"so":[84],"far":[85],"been":[86],"limited":[87],"optimization":[90,120],"few":[92],"numerical":[93],"single":[97],"instances.":[98,124],"In":[99,160],"paper,":[101],"we":[102],"extend":[103],"paradigm":[105],"first":[108],"time":[109],"gen-eral":[111],"problems,":[114],"allowing":[115],"categorical":[117],"sets":[122],"We":[125],"experimentally":[126],"validate":[127],"our":[128,163],"new":[129],"procedure":[132,164],"by":[133],"optimizing":[134],"a":[135,139],"local":[136],"search":[137,141],"tree":[140],"solver":[142,158],"propositional":[145],"satisfiability":[146],"(SAT),":[148],"as":[149,151],"well":[150],"commercial":[153],"mixed":[154],"integer":[155],"programming":[156],"(MIP)":[157],"CPLEX.":[159],"these":[161],"experiments,":[162],"yielded":[165],"state-of-the-art":[166],"performance,":[167],"cases":[171],"outperformed":[172],"previous":[174],"best":[175],"approach.":[177],"1":[178]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W7095960882","counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2026-11-16T12:05:36.265796","created_date":"2025-10-27T00:00:00"}
