{"id":"https://openalex.org/W3152930417","doi":"https://doi.org/10.1109/infocom42981.2021.9488692","title":"Dynamically Choosing the Candidate Algorithm with Ostasos in Online Optimization","display_name":"Dynamically Choosing the Candidate Algorithm with Ostasos in Online Optimization","publication_year":2021,"publication_date":"2021-05-10","ids":{"openalex":"https://openalex.org/W3152930417","doi":"https://doi.org/10.1109/infocom42981.2021.9488692","mag":"3152930417"},"language":"en","primary_location":{"id":"doi:10.1109/infocom42981.2021.9488692","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infocom42981.2021.9488692","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE INFOCOM 2021 - IEEE Conference on Computer Communications","raw_type":"proceedings-article"},"type":"conference-paper","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/A5101954867","display_name":"Weirong Chen","orcid":"https://orcid.org/0009-0000-1102-6845"},"institutions":[{"id":"https://openalex.org/I881766915","display_name":"Nanjing University","ror":"https://ror.org/01rxvg760","country_code":"CN","type":"education","lineage":["https://openalex.org/I881766915"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Weirong Chen","raw_affiliation_strings":["State Key Laboratory for Novel Software Technology, Nanjing University, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"State Key Laboratory for Novel Software Technology, Nanjing University, China","institution_ids":["https://openalex.org/I881766915"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101513130","display_name":"Jiaqi Zheng","orcid":"https://orcid.org/0000-0001-8403-9655"},"institutions":[{"id":"https://openalex.org/I881766915","display_name":"Nanjing University","ror":"https://ror.org/01rxvg760","country_code":"CN","type":"education","lineage":["https://openalex.org/I881766915"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Jiaqi Zheng","raw_affiliation_strings":["State Key Laboratory for Novel Software Technology, Nanjing University, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"State Key Laboratory for Novel Software Technology, Nanjing University, China","institution_ids":["https://openalex.org/I881766915"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5004238004","display_name":"Haoyu Yu","orcid":"https://orcid.org/0000-0003-3671-0402"},"institutions":[{"id":"https://openalex.org/I881766915","display_name":"Nanjing University","ror":"https://ror.org/01rxvg760","country_code":"CN","type":"education","lineage":["https://openalex.org/I881766915"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Haoyu Yu","raw_affiliation_strings":["State Key Laboratory for Novel Software Technology, Nanjing University, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"State Key Laboratory for Novel Software Technology, Nanjing University, China","institution_ids":["https://openalex.org/I881766915"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I881766915"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":"3","issue":null,"first_page":"1","last_page":"10"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.9998000264167786,"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.9998000264167786,"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.9994999766349792,"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/T11942","display_name":"Transportation and Mobility Innovations","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/2203","display_name":"Automotive Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7747609615325928},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.7555351853370667},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.5862813591957092},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5652879476547241},{"id":"https://openalex.org/keywords/trace","display_name":"TRACE (psycholinguistics)","score":0.5638827085494995},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.542713463306427},{"id":"https://openalex.org/keywords/algorithm-design","display_name":"Algorithm design","score":0.5203737616539001},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.49841761589050293},{"id":"https://openalex.org/keywords/optimization-algorithm","display_name":"Optimization algorithm","score":0.49157747626304626},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.43788546323776245},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3840622007846832},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.25653213262557983},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.11786606907844543},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.08937808871269226}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7747609615325928},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.7555351853370667},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.5862813591957092},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5652879476547241},{"id":"https://openalex.org/C75291252","wikidata":"https://www.wikidata.org/wiki/Q1315756","display_name":"TRACE (psycholinguistics)","level":2,"score":0.5638827085494995},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.542713463306427},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.5203737616539001},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.49841761589050293},{"id":"https://openalex.org/C2987595161","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Optimization algorithm","level":2,"score":0.49157747626304626},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.43788546323776245},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3840622007846832},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.25653213262557983},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.11786606907844543},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.08937808871269226},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/infocom42981.2021.9488692","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infocom42981.2021.9488692","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE INFOCOM 2021 - IEEE Conference on Computer Communications","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":45,"referenced_works":["https://openalex.org/W157259654","https://openalex.org/W1897808256","https://openalex.org/W2032352143","https://openalex.org/W2085786299","https://openalex.org/W2128085284","https://openalex.org/W2145339207","https://openalex.org/W2168405694","https://openalex.org/W2183531780","https://openalex.org/W2222512263","https://openalex.org/W2430704425","https://openalex.org/W2513180554","https://openalex.org/W2539259927","https://openalex.org/W2551119206","https://openalex.org/W2778234499","https://openalex.org/W2798611120","https://openalex.org/W2804869728","https://openalex.org/W2808205696","https://openalex.org/W2890624904","https://openalex.org/W2897771603","https://openalex.org/W2921646839","https://openalex.org/W2941480181","https://openalex.org/W2949691426","https://openalex.org/W2951777528","https://openalex.org/W2952720641","https://openalex.org/W2952817195","https://openalex.org/W2952933729","https://openalex.org/W2962689668","https://openalex.org/W2963382851","https://openalex.org/W2963903516","https://openalex.org/W2963945346","https://openalex.org/W2964309292","https://openalex.org/W2976415674","https://openalex.org/W3123661679","https://openalex.org/W3125579698","https://openalex.org/W3174114811","https://openalex.org/W4231111162","https://openalex.org/W4247154108","https://openalex.org/W6697753929","https://openalex.org/W6729728847","https://openalex.org/W6747447992","https://openalex.org/W6750262388","https://openalex.org/W6751632969","https://openalex.org/W6752261189","https://openalex.org/W6754148645","https://openalex.org/W6797735162"],"related_works":["https://openalex.org/W4213299358","https://openalex.org/W2564742953","https://openalex.org/W2793095688","https://openalex.org/W1623410360","https://openalex.org/W3115340459","https://openalex.org/W2950803469","https://openalex.org/W2583614279","https://openalex.org/W2004975914","https://openalex.org/W2109659895","https://openalex.org/W1930615501"],"abstract_inverted_index":{"The":[0],"increasing":[1],"challenge":[2],"in":[3,8,18,83],"designing":[4],"online":[5,19,94],"algorithms":[6,82],"lies":[7],"the":[9,15,30,55,60,70,93,101],"distribution":[10,16],"uncertainty.":[11],"To":[12],"cope":[13],"with":[14,62],"variations":[17],"optimization,":[20],"an":[21,27,47],"intuitive":[22],"idea":[23],"is":[24,74],"to":[25,38,92],"reselect":[26],"algorithm":[28,49,58],"from":[29],"candidate":[31,81],"set":[32],"that":[33,52,69,78],"will":[34],"be":[35],"more":[36],"suitable":[37,57],"future":[39],"distributions.":[40],"In":[41],"this":[42],"paper,":[43],"we":[44,89],"propose":[45],"Ostasos,":[46],"automatic":[48],"selection":[50],"framework":[51],"can":[53],"choose":[54],"most":[56],"on":[59],"fly":[61],"provable":[63],"guarantees.":[64],"Rigorous":[65],"theoretical":[66],"analysis":[67],"demonstrates":[68],"performance":[71],"of":[72,79,85,103],"Ostasos":[73,91],"no":[75],"worse":[76],"than":[77],"any":[80],"terms":[84],"competitive":[86],"ratio.":[87],"Finally,":[88],"apply":[90],"car-hailing":[95],"problem":[96],"and":[97],"trace-driven":[98],"experiments":[99],"verify":[100],"effectiveness":[102],"Ostasos.":[104]},"counts_by_year":[{"year":2026,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}