{"id":"https://openalex.org/W3131054135","doi":"https://doi.org/10.1145/3410220.3453926","title":"Statistically Efficient, Polynomial-Time Algorithms for Combinatorial Semi-Bandits","display_name":"Statistically Efficient, Polynomial-Time Algorithms for Combinatorial Semi-Bandits","publication_year":2021,"publication_date":"2021-05-31","ids":{"openalex":"https://openalex.org/W3131054135","doi":"https://doi.org/10.1145/3410220.3453926","mag":"3131054135"},"language":"en","primary_location":{"id":"doi:10.1145/3410220.3453926","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3410220.3453926","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Abstract Proceedings of the 2021 ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://hal.science/hal-03201526/document","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5088319613","display_name":"Thibaut Cuvelier","orcid":"https://orcid.org/0000-0002-4233-2316"},"institutions":[{"id":"https://openalex.org/I19370010","display_name":"Orange (France)","ror":"https://ror.org/035j0tq82","country_code":"FR","type":"company","lineage":["https://openalex.org/I19370010"]},{"id":"https://openalex.org/I4210107720","display_name":"CentraleSup\u00e9lec","ror":"https://ror.org/019tcpt25","country_code":"FR","type":"facility","lineage":["https://openalex.org/I277688954","https://openalex.org/I4210107720"]},{"id":"https://openalex.org/I102475099","display_name":"Sup\u00e9lec","ror":"https://ror.org/00n7gwn90","country_code":"FR","type":"education","lineage":["https://openalex.org/I102475099"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Thibaut Cuvelier","raw_affiliation_strings":["Centrale-Supelec, L2S and Orange Labs, Gif-sur-Yvette, France"],"affiliations":[{"raw_affiliation_string":"Centrale-Supelec, L2S and Orange Labs, Gif-sur-Yvette, France","institution_ids":["https://openalex.org/I102475099","https://openalex.org/I19370010","https://openalex.org/I4210107720"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5022336927","display_name":"Richard Combes","orcid":"https://orcid.org/0000-0003-3954-7241"},"institutions":[{"id":"https://openalex.org/I102475099","display_name":"Sup\u00e9lec","ror":"https://ror.org/00n7gwn90","country_code":"FR","type":"education","lineage":["https://openalex.org/I102475099"]},{"id":"https://openalex.org/I4210107720","display_name":"CentraleSup\u00e9lec","ror":"https://ror.org/019tcpt25","country_code":"FR","type":"facility","lineage":["https://openalex.org/I277688954","https://openalex.org/I4210107720"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Richard Combes","raw_affiliation_strings":["Centrale-Supelec, L2S, Gif-sur-Yvette, France"],"affiliations":[{"raw_affiliation_string":"Centrale-Supelec, L2S, Gif-sur-Yvette, France","institution_ids":["https://openalex.org/I102475099","https://openalex.org/I4210107720"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5000879568","display_name":"\u00c9ric Gourdin","orcid":null},"institutions":[{"id":"https://openalex.org/I19370010","display_name":"Orange (France)","ror":"https://ror.org/035j0tq82","country_code":"FR","type":"company","lineage":["https://openalex.org/I19370010"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Eric Gourdin","raw_affiliation_strings":["Orange Labs, Chatillon, France"],"affiliations":[{"raw_affiliation_string":"Orange Labs, Chatillon, France","institution_ids":["https://openalex.org/I19370010"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5088319613"],"corresponding_institution_ids":["https://openalex.org/I102475099","https://openalex.org/I19370010","https://openalex.org/I4210107720"],"apc_list":null,"apc_paid":null,"fwci":0.7147,"has_fulltext":true,"cited_by_count":4,"citation_normalized_percentile":{"value":0.71563404,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"5","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12101","display_name":"Advanced Bandit Algorithms Research","score":1.0,"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":1.0,"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.9868000149726868,"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/T10462","display_name":"Reinforcement Learning in Robotics","score":0.984499990940094,"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/regret","display_name":"Regret","score":0.629944920539856},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6203049421310425},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5946677923202515},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.55744868516922},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5250016450881958},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5192506313323975},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.5074748396873474},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.48318377137184143},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.47995927929878235},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.4592899978160858},{"id":"https://openalex.org/keywords/exponential-time-hypothesis","display_name":"Exponential time hypothesis","score":0.4494287371635437},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.34362196922302246}],"concepts":[{"id":"https://openalex.org/C50817715","wikidata":"https://www.wikidata.org/wiki/Q79895177","display_name":"Regret","level":2,"score":0.629944920539856},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6203049421310425},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5946677923202515},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.55744868516922},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5250016450881958},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5192506313323975},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.5074748396873474},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.48318377137184143},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.47995927929878235},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.4592899978160858},{"id":"https://openalex.org/C71017364","wikidata":"https://www.wikidata.org/wiki/Q5421532","display_name":"Exponential time hypothesis","level":3,"score":0.4494287371635437},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.34362196922302246},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3410220.3453926","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3410220.3453926","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Abstract Proceedings of the 2021 ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems","raw_type":"proceedings-article"},{"id":"pmh:oai:HAL:hal-03201526v1","is_oa":true,"landing_page_url":"https://hal.science/hal-03201526","pdf_url":"https://hal.science/hal-03201526/document","source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"https://www.sigmetrics.org/sigmetrics2021/","raw_type":"Conference papers"}],"best_oa_location":{"id":"pmh:oai:HAL:hal-03201526v1","is_oa":true,"landing_page_url":"https://hal.science/hal-03201526","pdf_url":"https://hal.science/hal-03201526/document","source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"https://www.sigmetrics.org/sigmetrics2021/","raw_type":"Conference papers"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3131054135.pdf","grobid_xml":"https://content.openalex.org/works/W3131054135.grobid-xml"},"referenced_works_count":12,"referenced_works":["https://openalex.org/W1998498767","https://openalex.org/W2006804560","https://openalex.org/W2009551863","https://openalex.org/W2077902449","https://openalex.org/W2105235982","https://openalex.org/W2120575449","https://openalex.org/W2125724988","https://openalex.org/W2585536612","https://openalex.org/W2914156981","https://openalex.org/W3007427904","https://openalex.org/W3037595456","https://openalex.org/W3100329718"],"related_works":["https://openalex.org/W2962917430","https://openalex.org/W2028468530","https://openalex.org/W3172736027","https://openalex.org/W4299801389","https://openalex.org/W4307324288","https://openalex.org/W2574604093","https://openalex.org/W3186611761","https://openalex.org/W2775068415","https://openalex.org/W4214914101","https://openalex.org/W3196775331"],"abstract_inverted_index":{"We":[0,68,127],"consider":[1],"combinatorial":[2],"semi-bandits":[3],"over":[4,134,161],"a":[5,105,141,158,165],"set":[6],"X":[7,47,135,162],"\u2282":[8],"(0,1)d":[9],"where":[10,42,102],"rewards":[11],"are":[12,184],"uncorrelated":[13],"across":[14],"items.":[15],"For":[16],"this":[17,81,191],"problem,":[18],"the":[19,23,70,123,187],"algorithm":[20,72],"ESCB":[21,50,121],"yields":[22],"smallest":[24],"known":[25],"regret":[26,84,125],"bound":[27],"R(T)":[28,85],"=":[29,44,86],"O":[30,87,151],"(":[31],"d":[32],"(\u0142n":[33,35,89,91],"m)2":[34,90],"T)":[36],"\u00f8ver":[37],"\u0394min)":[38,93],"after":[39],"T":[40],"rounds,":[41],"m":[43],"maxx":[45],"\u2208":[46],"1Tx.":[48],"However,":[49],"has":[51],"computational":[52,95],"complexity":[53,97],"O(|X|),":[54],"which":[55,107],"is":[56,74,104,146],"typically":[57],"exponential":[58],"in":[59,65,148,186],"d,":[60],"and":[61,77,94,169,181],"cannot":[62],"be":[63,137],"used":[64],"large":[66],"dimensions.":[67],"propose":[69],"first":[71],"that":[73],"both":[75],"computationally":[76],"statistically":[78],"efficient":[79],"for":[80],"problem":[82],"with":[83,122],"(d":[88],"T)\u00f8ver":[92],"asymptotic":[96],"O(":[98],"\u03b4T-1":[99],"poly":[100,153],"(d)),":[101],"\u03b4T":[103],"function":[106,160],"vanishes":[108],"arbitrarily":[109],"slowly.":[110],"Our":[111],"approach":[112],"involves":[113],"carefully":[114],"designing":[115],"AESCB,":[116],"an":[117],"approximate":[118],"version":[119,189],"of":[120,190],"same":[124],"guarantees.":[126],"show":[128],"that,":[129],"whenever":[130],"budgeted":[131],"linear":[132,159,166],"maximization":[133,175],"can":[136],"solved":[138],"up":[139],"to":[140,164,172],"given":[142,185],"approximation":[143],"ratio,":[144],"AESCB":[145],"implementable":[147],"polynomial":[149],"time":[150],"(\u03b4T-1":[152],"(d))":[154],"by":[155],"repeatedly":[156],"maximizing":[157],"subject":[163],"budget":[167],"constraint,":[168],"showing":[170],"how":[171],"solve":[173],"these":[174],"problems":[176],"efficiently.":[177],"Additional":[178],"algorithms,":[179],"proofs":[180],"numerical":[182],"experiments":[183],"complete":[188],"work.":[192]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3}],"updated_date":"2026-03-10T16:38:18.471706","created_date":"2025-10-10T00:00:00"}