{"id":"https://openalex.org/W7118790040","doi":"https://doi.org/10.1137/1.9781611978964.37","title":"A Learning Perspective on Random-Order Covering Problems","display_name":"A Learning Perspective on Random-Order Covering Problems","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7118790040","doi":"https://doi.org/10.1137/1.9781611978964.37"},"language":"en","primary_location":{"id":"doi:10.1137/1.9781611978964.37","is_oa":false,"landing_page_url":"https://doi.org/10.1137/1.9781611978964.37","pdf_url":null,"source":{"id":"https://openalex.org/S4306463922","display_name":"Society for Industrial and Applied Mathematics eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2026 SIAM Symposium on Simplicity in Algorithms (SOSA)","raw_type":"book-chapter"},"type":"book-chapter","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/A5004167360","display_name":"Anupam Gupta","orcid":null},"institutions":[{"id":"https://openalex.org/I57206974","display_name":"New York University","ror":"https://ror.org/0190ak572","country_code":"US","type":"education","lineage":["https://openalex.org/I57206974"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Anupam Gupta","raw_affiliation_strings":["New York University"],"affiliations":[{"raw_affiliation_string":"New York University","institution_ids":["https://openalex.org/I57206974"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5122100314","display_name":"Marco Molinaro","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Marco Molinaro","raw_affiliation_strings":["Microsoft Research \u2013 Redmond, USA and PUC-Rio, Brazil"],"affiliations":[{"raw_affiliation_string":"Microsoft Research \u2013 Redmond, USA and PUC-Rio, Brazil","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5034656746","display_name":"Matteo Russo","orcid":"https://orcid.org/0000-0002-8825-8983"},"institutions":[{"id":"https://openalex.org/I861853513","display_name":"Sapienza University of Rome","ror":"https://ror.org/02be6w209","country_code":"IT","type":"education","lineage":["https://openalex.org/I861853513"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Matteo Russo","raw_affiliation_strings":["Sapienza University of Rome"],"affiliations":[{"raw_affiliation_string":"Sapienza University of Rome","institution_ids":["https://openalex.org/I861853513"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5004167360"],"corresponding_institution_ids":["https://openalex.org/I57206974"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.34500365,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"444","last_page":"462"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9782000184059143,"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.9782000184059143,"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.007400000002235174,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.003800000064074993,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/perspective","display_name":"Perspective (graphical)","score":0.652999997138977},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.6428999900817871},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5388000011444092},{"id":"https://openalex.org/keywords/adversarial-system","display_name":"Adversarial system","score":0.4876999855041504},{"id":"https://openalex.org/keywords/multiplicative-function","display_name":"Multiplicative function","score":0.4763999879360199},{"id":"https://openalex.org/keywords/order","display_name":"Order (exchange)","score":0.4291999936103821}],"concepts":[{"id":"https://openalex.org/C12713177","wikidata":"https://www.wikidata.org/wiki/Q1900281","display_name":"Perspective (graphical)","level":2,"score":0.652999997138977},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.6428999900817871},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5388000011444092},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4959000051021576},{"id":"https://openalex.org/C37736160","wikidata":"https://www.wikidata.org/wiki/Q1801315","display_name":"Adversarial system","level":2,"score":0.4876999855041504},{"id":"https://openalex.org/C42747912","wikidata":"https://www.wikidata.org/wiki/Q1048447","display_name":"Multiplicative function","level":2,"score":0.4763999879360199},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.4291999936103821},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.4108000099658966},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.39489999413490295},{"id":"https://openalex.org/C100808899","wikidata":"https://www.wikidata.org/wiki/Q1192100","display_name":"Set cover problem","level":3,"score":0.39149999618530273},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.38999998569488525},{"id":"https://openalex.org/C2986087404","wikidata":"https://www.wikidata.org/wiki/Q15946010","display_name":"Online learning","level":2,"score":0.32749998569488525},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.2922999858856201},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.28519999980926514},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2768000066280365},{"id":"https://openalex.org/C2776401178","wikidata":"https://www.wikidata.org/wiki/Q12050496","display_name":"Feature (linguistics)","level":2,"score":0.2768000066280365},{"id":"https://openalex.org/C42475967","wikidata":"https://www.wikidata.org/wiki/Q194292","display_name":"Operations research","level":1,"score":0.2587999999523163},{"id":"https://openalex.org/C2777686260","wikidata":"https://www.wikidata.org/wiki/Q144037","display_name":"Calculus (dental)","level":2,"score":0.25600001215934753}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/1.9781611978964.37","is_oa":false,"landing_page_url":"https://doi.org/10.1137/1.9781611978964.37","pdf_url":null,"source":{"id":"https://openalex.org/S4306463922","display_name":"Society for Industrial and Applied Mathematics eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2026 SIAM Symposium on Simplicity in Algorithms (SOSA)","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"In":[0],"the":[1,7,23,39,47,82,87],"random-order":[2,33],"online":[3,78],"set":[4],"cover":[5],"problem,":[6],"instance":[8],"with":[9],"\\(m\\)":[10],"sets":[11],"and":[12],"\\(n\\)":[13],"elements":[14,24],"is":[15],"chosen":[16],"in":[17,26,77],"a":[18,27],"worst-case":[19],"fashion,":[20],"but":[21],"then":[22],"arrive":[25],"uniformly":[28],"random":[29],"order.":[30],"Can":[31],"this":[32],"model":[34],"allow":[35],"us":[36],"to":[37],"circumvent":[38],"bound":[40],"of":[41],"\\(O(\\log":[42,67],"m":[43],"\\log":[44],"n)\\)-competitiveness":[45],"for":[46],"adversarial":[48],"arrival":[49],"order":[50],"model?":[51],"This":[52],"long-standing":[53],"question":[54],"was":[55,73],"recently":[56],"resolved":[57],"by":[58,75,90],"[GKL21],":[59],"who":[60],"gave":[61],"an":[62,66],"algorithm":[63],"that":[64],"achieved":[65],"mn)\\)-competitive":[68],"ratio.":[69],"While":[70],"their":[71],"LearnOrCover":[72],"inspired":[74],"ideas":[76],"learning":[79],"(and":[80],"specifically":[81],"multiplicative":[83],"weights":[84],"update":[85],"method),":[86],"analysis":[88],"proceeded":[89],"showing":[91],"progress":[92],"from":[93],"first":[94],"principles.":[95]},"counts_by_year":[],"updated_date":"2026-01-08T20:10:11.968330","created_date":"2026-01-08T00:00:00"}