{"id":"https://openalex.org/W7131415484","doi":"https://doi.org/10.48550/arxiv.2602.20706","title":"Online Algorithms with Unreliable Guidance","display_name":"Online Algorithms with Unreliable Guidance","publication_year":2026,"publication_date":"2026-02-24","ids":{"openalex":"https://openalex.org/W7131415484","doi":"https://doi.org/10.48550/arxiv.2602.20706"},"language":null,"primary_location":{"id":"pmh:doi:10.48550/arxiv.2602.20706","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":null,"any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5093836306","display_name":"Julien Dallot","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Dallot, Julien","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5000264005","display_name":"Yuval Emek","orcid":"https://orcid.org/0000-0002-3123-3451"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Emek, Yuval","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5018351370","display_name":"Yuval Gil","orcid":"https://orcid.org/0009-0007-7762-3029"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Gil, Yuval","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5046854190","display_name":"Maciej Pacut","orcid":"https://orcid.org/0000-0002-6379-1490"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Pacut, Maciej","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5126834154","display_name":"Stefan Schmid","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Schmid, Stefan","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":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.17000712,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"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/T12288","display_name":"Optimization and Search Problems","score":0.8835999965667725,"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.8835999965667725,"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.08340000361204147,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.00570000009611249,"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/online-algorithm","display_name":"Online algorithm","score":0.6866000294685364},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.5307000279426575},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.4869999885559082},{"id":"https://openalex.org/keywords/compiler","display_name":"Compiler","score":0.4844000041484833},{"id":"https://openalex.org/keywords/outcome","display_name":"Outcome (game theory)","score":0.40139999985694885},{"id":"https://openalex.org/keywords/online-model","display_name":"Online model","score":0.4007999897003174},{"id":"https://openalex.org/keywords/focus","display_name":"Focus (optics)","score":0.3968000113964081},{"id":"https://openalex.org/keywords/online-learning","display_name":"Online learning","score":0.36039999127388}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7542999982833862},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.6866000294685364},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6563000082969666},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.5307000279426575},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.4869999885559082},{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.4844000041484833},{"id":"https://openalex.org/C148220186","wikidata":"https://www.wikidata.org/wiki/Q7111912","display_name":"Outcome (game theory)","level":2,"score":0.40139999985694885},{"id":"https://openalex.org/C2777851325","wikidata":"https://www.wikidata.org/wiki/Q7094102","display_name":"Online model","level":2,"score":0.4007999897003174},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.3968000113964081},{"id":"https://openalex.org/C2986087404","wikidata":"https://www.wikidata.org/wiki/Q15946010","display_name":"Online learning","level":2,"score":0.36039999127388},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.32269999384880066},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.30979999899864197},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.3010999858379364},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.29330000281333923},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.27709999680519104},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.2761000096797943},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.2694999873638153},{"id":"https://openalex.org/C18762648","wikidata":"https://www.wikidata.org/wiki/Q42213","display_name":"Work (physics)","level":2,"score":0.2653000056743622},{"id":"https://openalex.org/C95627357","wikidata":"https://www.wikidata.org/wiki/Q7979889","display_name":"Weighted Majority Algorithm","level":5,"score":0.25220000743865967},{"id":"https://openalex.org/C190902152","wikidata":"https://www.wikidata.org/wiki/Q1325106","display_name":"Optimizing compiler","level":3,"score":0.25220000743865967},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.25060001015663147}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:doi:10.48550/arxiv.2602.20706","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},{"id":"doi:10.48550/arxiv.2602.20706","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2602.20706","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":"pmh:doi:10.48550/arxiv.2602.20706","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"sustainable_development_goals":[{"score":0.804389238357544,"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"This":[0],"paper":[1],"introduces":[2],"online":[3,13,114,139],"algorithms":[4,62,131],"with":[5,132,148],"unreliable":[6],"guidance":[7],"(OAG),":[8],"a":[9,25,117],"model":[10,47,96],"for":[11,136,145,156],"ML-augmented":[12],"decision-making":[14],"that":[15,30,81,108,124],"cleanly":[16],"separates":[17],"the":[18,34,40,45,53,85,94,100,104,125],"predictive":[19],"and":[20,88,152,158],"algorithmic":[21],"components,":[22],"thus":[23],"offering":[24],"single,":[26],"well-defined":[27],"analysis":[28],"framework":[29,92],"depends":[31],"only":[32],"on":[33],"problem":[35],"at":[36],"hand.":[37],"Formulated":[38],"through":[39],"lens":[41],"of":[42,67,93],"request-answer":[43],"games,":[44],"OAG":[46,95],"brings":[48],"multiple":[49],"concepts":[50],"(predictions":[51],"from":[52],"answer":[54],"space,":[55],"guide,":[56],"anytime":[57],"competitiveness)":[58],"which":[59],"enable":[60],"learning-augmented":[61,118,130],"to":[63,98],"be":[64],"analyzed":[65],"independently":[66],"predictor-specific":[68],"choices":[69],"-":[70,80],"such":[71],"as":[72],"prediction":[73],"semantics,":[74],"error":[75],"functions,":[76],"or":[77],"probing":[78],"strategies":[79],"would":[82],"otherwise":[83],"restrict":[84],"algorithm's":[86],"generality":[87],"applicability.":[89],"The":[90],"clean":[91],"allows":[97],"build":[99],"first":[101],"generic":[102],"compiler,":[103,107],"drop-or-trust-blindly":[105],"(DTB)":[106],"turns":[109],"almost":[110],"any":[111],"standard,":[112],"prediction-free":[113],"algorithm":[115],"into":[116],"one.":[119],"Although":[120],"simple,":[121],"we":[122,141],"show":[123],"DTB":[126],"compiler":[127],"produces":[128],"new":[129,143],"strong":[133],"consistency-robustness":[134],"guarantees":[135],"three":[137],"classic":[138],"problems:":[140],"achieve":[142],"trade-offs":[144],"bipartite":[146],"matching":[147],"adversarial":[149],"arrival":[150],"order,":[151],"obtain":[153],"optimal":[154],"solutions":[155],"caching":[157],"uniform":[159],"metrical":[160],"task":[161],"systems.":[162]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-02-26T00:00:00"}