{"id":"https://openalex.org/W2740079300","doi":"https://doi.org/10.24963/ijcai.2017/281","title":"Efficiency Through Procrastination: Approximately Optimal Algorithm Configuration with Runtime Guarantees","display_name":"Efficiency Through Procrastination: Approximately Optimal Algorithm Configuration with Runtime Guarantees","publication_year":2017,"publication_date":"2017-07-28","ids":{"openalex":"https://openalex.org/W2740079300","doi":"https://doi.org/10.24963/ijcai.2017/281","mag":"2740079300"},"language":"en","primary_location":{"id":"doi:10.24963/ijcai.2017/281","is_oa":true,"landing_page_url":"https://doi.org/10.24963/ijcai.2017/281","pdf_url":"https://www.ijcai.org/proceedings/2017/0281.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.ijcai.org/proceedings/2017/0281.pdf","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5040052580","display_name":"Robert Kleinberg","orcid":"https://orcid.org/0000-0002-8306-3407"},"institutions":[{"id":"https://openalex.org/I205783295","display_name":"Cornell University","ror":"https://ror.org/05bnh6r87","country_code":"US","type":"education","lineage":["https://openalex.org/I205783295"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Robert Kleinberg","raw_affiliation_strings":["Cornell University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Cornell University","institution_ids":["https://openalex.org/I205783295"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5089807699","display_name":"Kevin Leyton\u2010Brown","orcid":"https://orcid.org/0000-0002-7644-5327"},"institutions":[{"id":"https://openalex.org/I141945490","display_name":"University of British Columbia","ror":"https://ror.org/03rmrcq20","country_code":"CA","type":"education","lineage":["https://openalex.org/I141945490"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Kevin Leyton-Brown","raw_affiliation_strings":["University of British Columbia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of British Columbia","institution_ids":["https://openalex.org/I141945490"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5082964830","display_name":"Brendan Lucier","orcid":"https://orcid.org/0009-0006-3497-0875"},"institutions":[{"id":"https://openalex.org/I4210164937","display_name":"Microsoft Research (United Kingdom)","ror":"https://ror.org/05k87vq12","country_code":"GB","type":"company","lineage":["https://openalex.org/I1290206253","https://openalex.org/I4210164937"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Brendan Lucier","raw_affiliation_strings":["Microsoft Research"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Microsoft Research","institution_ids":["https://openalex.org/I4210164937"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":29,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"2023","last_page":"2031"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.9998999834060669,"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"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9984999895095825,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9983999729156494,"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/procrastination","display_name":"Procrastination","score":0.928144097328186},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7588446140289307},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5288119316101074},{"id":"https://openalex.org/keywords/asymptotically-optimal-algorithm","display_name":"Asymptotically optimal algorithm","score":0.4933985769748688},{"id":"https://openalex.org/keywords/algorithm-design","display_name":"Algorithm design","score":0.4331415891647339},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3984537720680237}],"concepts":[{"id":"https://openalex.org/C194279344","wikidata":"https://www.wikidata.org/wiki/Q330104","display_name":"Procrastination","level":2,"score":0.928144097328186},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7588446140289307},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5288119316101074},{"id":"https://openalex.org/C181789720","wikidata":"https://www.wikidata.org/wiki/Q4812191","display_name":"Asymptotically optimal algorithm","level":2,"score":0.4933985769748688},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.4331415891647339},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3984537720680237},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C542102704","wikidata":"https://www.wikidata.org/wiki/Q183257","display_name":"Psychotherapist","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.24963/ijcai.2017/281","is_oa":true,"landing_page_url":"https://doi.org/10.24963/ijcai.2017/281","pdf_url":"https://www.ijcai.org/proceedings/2017/0281.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.24963/ijcai.2017/281","is_oa":true,"landing_page_url":"https://doi.org/10.24963/ijcai.2017/281","pdf_url":"https://www.ijcai.org/proceedings/2017/0281.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2740079300.pdf","grobid_xml":"https://content.openalex.org/works/W2740079300.grobid-xml"},"referenced_works_count":23,"referenced_works":["https://openalex.org/W60686164","https://openalex.org/W1519060350","https://openalex.org/W1519597478","https://openalex.org/W1556137908","https://openalex.org/W1562227633","https://openalex.org/W2068637807","https://openalex.org/W2073107347","https://openalex.org/W2106411961","https://openalex.org/W2115519224","https://openalex.org/W2141363466","https://openalex.org/W2164212322","https://openalex.org/W2166566250","https://openalex.org/W2167603139","https://openalex.org/W2192203593","https://openalex.org/W2400086084","https://openalex.org/W2556522401","https://openalex.org/W2914156981","https://openalex.org/W2950680102","https://openalex.org/W2950929549","https://openalex.org/W2952473658","https://openalex.org/W4247501327","https://openalex.org/W4248403059","https://openalex.org/W4297803580"],"related_works":["https://openalex.org/W2393888177","https://openalex.org/W2544423928","https://openalex.org/W2115794623","https://openalex.org/W2360264381","https://openalex.org/W2067173559","https://openalex.org/W2148738811","https://openalex.org/W1613730747","https://openalex.org/W2541389358","https://openalex.org/W4318948887","https://openalex.org/W1994204274"],"abstract_inverted_index":{"Algorithm":[0],"configuration":[1,27,49],"methods":[2],"have":[3,11],"achieved":[4],"much":[5],"practical":[6],"success,":[7],"but":[8],"to":[9],"date":[10],"not":[12],"been":[13],"backed":[14],"by":[15],"meaningful":[16],"performance":[17],"guarantees.":[18],"We":[19],"address":[20],"this":[21],"gap":[22],"with":[23],"a":[24],"new":[25],"algorithm":[26,48],"framework,":[28],"Structured":[29],"Procrastination.":[30],"With":[31],"high":[32],"probability":[33],"and":[34],"nearly":[35],"as":[36,38],"quickly":[37],"possible":[39],"in":[40],"the":[41],"worst":[42],"case,":[43],"our":[44],"framework":[45],"finds":[46],"an":[47],"that":[50],"provably":[51],"achieves":[52],"near":[53],"optimal":[54],"performance.":[55],"Moreover,":[56],"its":[57],"running":[58],"time":[59],"requirements":[60],"asymptotically":[61],"dominate":[62],"those":[63],"of":[64],"existing":[65],"methods.":[66]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":11},{"year":2019,"cited_by_count":5}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}