{"id":"https://openalex.org/W7162406431","doi":"https://doi.org/10.1145/3801489.3806913","title":"Prediction-Specific Design of Learning-Augmented Algorithms","display_name":"Prediction-Specific Design of Learning-Augmented Algorithms","publication_year":2026,"publication_date":"2026-05-26","ids":{"openalex":"https://openalex.org/W7162406431","doi":"https://doi.org/10.1145/3801489.3806913"},"language":null,"primary_location":{"id":"doi:10.1145/3801489.3806913","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3801489.3806913","pdf_url":null,"source":null,"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Abstracts of the 2026 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.1145/3801489.3806913","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5097448827","display_name":"\u601d\u54f2 \u674e","orcid":null},"institutions":[{"id":"https://openalex.org/I4210116924","display_name":"Chinese University of Hong Kong, Shenzhen","ror":"https://ror.org/02d5ks197","country_code":"CN","type":"education","lineage":["https://openalex.org/I177725633","https://openalex.org/I180726961","https://openalex.org/I4210116924"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Sizhe Li","raw_affiliation_strings":["The Chinese University of Hong Kong, Shenzhen, Shenzhen, Guangdong, China"],"raw_orcid":"https://orcid.org/0009-0003-6596-7749","affiliations":[{"raw_affiliation_string":"The Chinese University of Hong Kong, Shenzhen, Shenzhen, Guangdong, China","institution_ids":["https://openalex.org/I4210116924"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5137080409","display_name":"Nicolas Christianson","orcid":"https://orcid.org/0000-0001-8330-8964"},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Nicolas Christianson","raw_affiliation_strings":["Stanford University, Stanford, California, USA"],"raw_orcid":"https://orcid.org/0000-0001-8330-8964","affiliations":[{"raw_affiliation_string":"Stanford University, Stanford, California, USA","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5137000838","display_name":"Tongxin Li","orcid":"https://orcid.org/0000-0002-9806-8964"},"institutions":[{"id":"https://openalex.org/I4210116924","display_name":"Chinese University of Hong Kong, Shenzhen","ror":"https://ror.org/02d5ks197","country_code":"CN","type":"education","lineage":["https://openalex.org/I177725633","https://openalex.org/I180726961","https://openalex.org/I4210116924"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Tongxin Li","raw_affiliation_strings":["The Chinese University of Hong Kong, Shenzhen, Shenzhen, Guangdong, China"],"raw_orcid":"https://orcid.org/0000-0002-9806-8964","affiliations":[{"raw_affiliation_string":"The Chinese University of Hong Kong, Shenzhen, Shenzhen, Guangdong, China","institution_ids":["https://openalex.org/I4210116924"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"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":"82","last_page":"84"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.6413999795913696,"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"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.6413999795913696,"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/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.31869998574256897,"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/T11161","display_name":"Consumer Market Behavior and Pricing","score":0.007600000128149986,"subfield":{"id":"https://openalex.org/subfields/1406","display_name":"Marketing"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/robustness","display_name":"Robustness (evolution)","score":0.715399980545044},{"id":"https://openalex.org/keywords/leverage","display_name":"Leverage (statistics)","score":0.6254000067710876},{"id":"https://openalex.org/keywords/pareto-principle","display_name":"Pareto principle","score":0.44190001487731934},{"id":"https://openalex.org/keywords/pareto-optimal","display_name":"Pareto optimal","score":0.3763999938964844},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.37630000710487366},{"id":"https://openalex.org/keywords/algorithm-design","display_name":"Algorithm design","score":0.35120001435279846},{"id":"https://openalex.org/keywords/consistency","display_name":"Consistency (knowledge bases)","score":0.3465999960899353}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7411999702453613},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.715399980545044},{"id":"https://openalex.org/C153083717","wikidata":"https://www.wikidata.org/wiki/Q6535263","display_name":"Leverage (statistics)","level":2,"score":0.6254000067710876},{"id":"https://openalex.org/C137635306","wikidata":"https://www.wikidata.org/wiki/Q182667","display_name":"Pareto principle","level":2,"score":0.44190001487731934},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.42260000109672546},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38600000739097595},{"id":"https://openalex.org/C2986314615","wikidata":"https://www.wikidata.org/wiki/Q36829","display_name":"Pareto optimal","level":3,"score":0.3763999938964844},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.37630000710487366},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.35120001435279846},{"id":"https://openalex.org/C2776436953","wikidata":"https://www.wikidata.org/wiki/Q5163215","display_name":"Consistency (knowledge bases)","level":2,"score":0.3465999960899353},{"id":"https://openalex.org/C2987595161","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Optimization algorithm","level":2,"score":0.33709999918937683},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.3165000081062317},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.31290000677108765},{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.28610000014305115},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.28040000796318054},{"id":"https://openalex.org/C195818886","wikidata":"https://www.wikidata.org/wiki/Q5421724","display_name":"Expressive power","level":2,"score":0.27869999408721924},{"id":"https://openalex.org/C136197465","wikidata":"https://www.wikidata.org/wiki/Q1729295","display_name":"Variety (cybernetics)","level":2,"score":0.2711000144481659},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.26820001006126404},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.25760000944137573}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3801489.3806913","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3801489.3806913","pdf_url":null,"source":null,"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Abstracts of the 2026 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3801489.3806913","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3801489.3806913","pdf_url":null,"source":null,"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Abstracts of the 2026 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems","raw_type":"proceedings-article"},"sustainable_development_goals":[{"score":0.5158067941665649,"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":3,"referenced_works":["https://openalex.org/W3178731179","https://openalex.org/W4389609031","https://openalex.org/W7140615516"],"related_works":[],"abstract_inverted_index":{"Algorithms":[0],"with":[1,17,82],"predictions":[2,154],"have":[3],"emerged":[4],"as":[5,36],"a":[6,47,77,109,121,164],"powerful":[7],"framework":[8,113],"to":[9,43],"combine":[10],"the":[11,18,64,91,101,177],"robustness":[12,70,95],"of":[13,22,67,79,124,180],"traditional":[14],"online":[15,136,160],"algorithms":[16,81,119,132,161],"data-driven":[19],"performance":[20,45,57],"benefits":[21,179],"machine-learned":[23],"(ML)":[24],"predictions.":[25],"However,":[26],"most":[27],"existing":[28],"approaches":[29],"in":[30,46,72,90,100,120],"this":[31,51],"paradigm":[32],"are":[33],"overly":[34],"conservative,":[35],"they":[37],"do":[38],"not":[39,88],"leverage":[40],"problem":[41,125],"structure":[42],"optimize":[44],"prediction-specific":[48,56,102,165],"manner.":[49],"In":[50],"paper,":[52],"we":[53,128],"show":[54],"that":[55,114],"criteria":[58],"can":[59,155],"enable":[60],"significant":[61],"improvements":[62],"over":[63],"coarser":[65],"notions":[66],"consistency":[68],"and":[69,96,127,139,143,173],"considered":[71],"prior":[73],"work.":[74],"We":[75,107],"propose":[76,129],"notion":[78],"strongly-optimal":[80,118,131],"predictions,":[83],"which":[84],"obtain":[85],"Pareto":[86],"optimality":[87],"just":[89],"worst-case":[92],"tradeoff":[93,103],"between":[94,104],"consistency,":[97],"but":[98],"also":[99],"these":[105],"metrics.":[106],"develop":[108],"general":[110],"bi-level":[111],"optimization":[112],"enables":[115],"systematically":[116],"designing":[117],"wide":[122],"variety":[123],"settings,":[126],"explicit":[130],"for":[133],"several":[134],"classic":[135],"problems:":[137],"deterministic":[138],"randomized":[140],"ski":[141],"rental,":[142],"one-max":[144],"search.":[145],"Our":[146],"analysis":[147],"reveals":[148],"new":[149],"structural":[150],"insights":[151],"into":[152,159],"how":[153],"be":[156],"optimally":[157],"integrated":[158],"by":[162],"leveraging":[163],"design.":[166],"Empirical":[167],"evaluations":[168],"on":[169],"dynamic":[170],"power":[171],"management":[172],"VIX":[174],"trading":[175],"validate":[176],"practical":[178],"our":[181],"framework.":[182]},"counts_by_year":[],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2026-05-27T00:00:00"}