{"id":"https://openalex.org/W7160966644","doi":"https://doi.org/10.48550/arxiv.2605.09277","title":"Worst-Case Regret Bounds for Combinatorial Thompson Sampling in Sleeping Semi-Bandits","display_name":"Worst-Case Regret Bounds for Combinatorial Thompson Sampling in Sleeping Semi-Bandits","publication_year":2026,"publication_date":"2026-05-10","ids":{"openalex":"https://openalex.org/W7160966644","doi":"https://doi.org/10.48550/arxiv.2605.09277"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2605.09277","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.09277","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2605.09277","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5135912234","display_name":"Zhiming Huang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Huang, Zhiming","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5135952192","display_name":"Bingshan Hu","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Hu, Bingshan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5135921715","display_name":"Jianping Pan","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Pan, Jianping","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":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"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/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.9679999947547913,"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.9679999947547913,"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/T11704","display_name":"Mobile Crowdsensing and Crowdsourcing","score":0.005799999926239252,"subfield":{"id":"https://openalex.org/subfields/1706","display_name":"Computer Science Applications"},"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/T13553","display_name":"Age of Information Optimization","score":0.003100000089034438,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/regret","display_name":"Regret","score":0.9251999855041504},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.7279999852180481},{"id":"https://openalex.org/keywords/thompson-sampling","display_name":"Thompson sampling","score":0.6388000249862671},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5853999853134155},{"id":"https://openalex.org/keywords/prior-probability","display_name":"Prior probability","score":0.5109000205993652},{"id":"https://openalex.org/keywords/gaussian","display_name":"Gaussian","score":0.48579999804496765}],"concepts":[{"id":"https://openalex.org/C50817715","wikidata":"https://www.wikidata.org/wiki/Q79895177","display_name":"Regret","level":2,"score":0.9251999855041504},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.7279999852180481},{"id":"https://openalex.org/C73602740","wikidata":"https://www.wikidata.org/wiki/Q7795822","display_name":"Thompson sampling","level":3,"score":0.6388000249862671},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6049000024795532},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5853999853134155},{"id":"https://openalex.org/C177769412","wikidata":"https://www.wikidata.org/wiki/Q278090","display_name":"Prior probability","level":3,"score":0.5109000205993652},{"id":"https://openalex.org/C163716315","wikidata":"https://www.wikidata.org/wiki/Q901177","display_name":"Gaussian","level":2,"score":0.48579999804496765},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.47380000352859497},{"id":"https://openalex.org/C140779682","wikidata":"https://www.wikidata.org/wiki/Q210868","display_name":"Sampling (signal processing)","level":3,"score":0.4731999933719635},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.41780000925064087},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.37130001187324524},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3458000123500824},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.34549999237060547},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.3068999946117401},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.28700000047683716},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.28119999170303345},{"id":"https://openalex.org/C20353970","wikidata":"https://www.wikidata.org/wiki/Q1056998","display_name":"Simple random sample","level":3,"score":0.257099986076355}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2605.09277","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.09277","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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":"doi:10.48550/arxiv.2605.09277","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.09277","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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":false,"raw_source_name":null,"raw_type":"Preprint"},"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":{"We":[0,139],"revisit":[1],"combinatorial":[2,21],"Thompson":[3],"sampling":[4],"(CTS)":[5],"for":[6,177],"semi-bandits":[7],"with":[8,28,77,151],"sleeping":[9,57],"arms,":[10,58],"where":[11],"arm":[12],"availability":[13],"varies":[14],"over":[15],"time":[16],"and":[17,68,102,115,170,172],"actions":[18],"must":[19],"satisfy":[20],"constraints,":[22],"as":[23],"in":[24,51],"wireless":[25],"mesh":[26],"routing":[27],"fluctuating":[29],"link":[30],"availability.":[31],"Despite":[32],"its":[33],"practical":[34],"relevance,":[35],"CTS":[36,76],"has":[37],"been":[38],"hindered":[39],"by":[40,87],"several":[41],"long-standing":[42,85],"problems:":[43],"(i)":[44],"the":[45,52,60,70,89,111],"absence":[46],"of":[47,62,75,94,100,107,148],"worst-case":[48,91],"regret":[49,92,146],"guarantees":[50],"semi-bandit":[53],"setting":[54],"even":[55],"without":[56],"(ii)":[59],"lack":[61],"theory":[63,114],"under":[64],"adversarially":[65],"varying":[66],"availability,":[67],"(iii)":[69],"consistently":[71,164],"weak":[72],"empirical":[73],"performance":[74],"Gaussian":[78,130],"priors":[79],"(CTS-G).":[80],"This":[81],"paper":[82],"resolves":[83],"these":[84],"issues":[86],"providing":[88],"first":[90],"analysis":[93],"CTS-G,":[95],"proving":[96],"an":[97,144],"upper":[98],"bound":[99,106,147,155],"$\\tilde{O}(m\\sqrt{NT})$":[101],"a":[103,121,127,152],"matching":[104,153],"lower":[105,154],"$\\tilde\u03a9(m\\sqrt{NT})$.":[108],"To":[109],"bridge":[110],"gap":[112],"between":[113],"practice,":[116],"we":[117,173],"further":[118],"propose":[119],"CL-SG,":[120],"simple":[122],"CTS-G":[123,169],"variant":[124],"that":[125,141,162],"samples":[126],"single":[128],"shared":[129],"seed":[131],"each":[132],"round":[133],"to":[134],"coordinate":[135],"exploration":[136],"across":[137],"arms.":[138],"show":[140],"CL-SG":[142,163],"achieves":[143],"improved":[145],"$\\tilde{O}(\\sqrt{mNT})$,":[149],"together":[150],"$\u03a9(\\sqrt{mNT})$.":[156],"Experiments":[157],"on":[158],"real-world":[159],"datasets":[160],"demonstrate":[161],"outperforms":[165],"strong":[166],"baselines":[167],"including":[168],"CTS-B,":[171],"open-source":[174],"our":[175],"implementation":[176],"reproducibility.":[178]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-05-13T00:00:00"}