{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,30]],"date-time":"2026-06-30T05:44:36Z","timestamp":1782798276522,"version":"3.54.5"},"reference-count":31,"publisher":"IEEE","license":[{"start":{"date-parts":[[2026,5,18]],"date-time":"2026-05-18T00:00:00Z","timestamp":1779062400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,5,18]],"date-time":"2026-05-18T00:00:00Z","timestamp":1779062400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026,5,18]]},"DOI":"10.1109\/infocom59046.2026.11571327","type":"proceedings-article","created":{"date-parts":[[2026,6,29]],"date-time":"2026-06-29T19:38:15Z","timestamp":1782761895000},"page":"1-10","source":"Crossref","is-referenced-by-count":0,"title":["Bridging the Regret Gap in Combinatorial Thompson Sampling: Worst-Case Guarantees and Algorithmic Refinement"],"prefix":"10.1109","author":[{"given":"Zhiming","family":"Huang","sequence":"first","affiliation":[{"name":"University of Washington,Paul G. Allen School of Computer Science & Engineering,WA,USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bingshan","family":"Hu","sequence":"additional","affiliation":[{"name":"University of British Columbia,Department of Computer Science,Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jianping","family":"Pan","sequence":"additional","affiliation":[{"name":"University of Victoria,Department of Computer Science,Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-010-5178-7"},{"key":"ref2","article-title":"Analysis of Thompson Sampling for Stochastic Sleeping Bandits","volume-title":"Proc. Conference on Uncertainty in Artificial Intelligence (UAI)","author":"Chatterjee"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2019.00154"},{"key":"ref4","first-page":"2181","article-title":"Hardness of Online Sleeping Combinatorial Optimization Problems","volume-title":"Proc. Advances in Neural Information Processing Systems (NeurIPS)","author":"Kale"},{"key":"ref5","first-page":"2780","article-title":"Online Combinatorial Optimization with Stochastic Decision Sets and Adversarial Losses","volume-title":"Proc. Advances in Neural Information Processing Systems (NeurIPS)","author":"Neu"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2019.8737461"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2019.2954310"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM52122.2024.10621191"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM55648.2025.11044728"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.2307\/1427934"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1023\/A:1013689704352"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-34106-9_18"},{"key":"ref13","article-title":"Near-Optimal Regret Bounds for Thompson Sampling (Corrected)","author":"Agrawal","year":"2017"},{"key":"ref14","first-page":"2249","article-title":"An Empirical Evaluation of Thompson Sampling","volume-title":"Proc. Advances in Neural Information Processing Systems (NeurIPS)","author":"Chapelle"},{"key":"ref15","first-page":"5101","article-title":"Thompson Sampling for Combinatorial Semi-Bandits","volume-title":"Proc. International Conference on Machine Learning (ICML)","author":"Wang"},{"key":"ref16","first-page":"5429","article-title":"Statistical Efficiency of Thompson Sampling for Combinatorial Semi-Bandits","volume-title":"Proc. Advances in Neural Information Processing Systems (NeurIPS)","volume":"33","author":"Perrault"},{"key":"ref17","first-page":"8345","article-title":"On the Suboptimal ity of Thompson Sampling in High Dimensions","volume-title":"Proc. Advances in Neural Information Processing Systems (NeurIPS)","volume":"34","author":"Zhang"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.52202\/079017-2839"},{"key":"ref19","first-page":"535","article-title":"Tight Regret Bounds for Stochastic Combinatorial Semi-Bandits","volume-title":"Proc. Artificial Intelligence and Statistics (AISTATS)","author":"Kveton"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2011.2181864"},{"key":"ref21","first-page":"2116","article-title":"Combinatorial Bandits Revisited","volume-title":"Proc. Advances in Neural Information Processing Systems (NeurIPS)","author":"Combes"},{"key":"ref22","first-page":"151","article-title":"Combinatorial Multi-Armed Bandit: General Framework and Applications","volume-title":"Proc. International Conference on Machine Learning (ICML)","author":"Chen"},{"key":"ref23","first-page":"2830","article-title":"Tight Lower Bounds for Combinatorial Multi-Armed Bandits","volume-title":"Proc. Conference on Learning Theory (COLT)","author":"Merlis"},{"key":"ref24","article-title":"Combinatorial Semi-Bandit with Known Covariance","volume-title":"Proc. Advances in Neural Information Processing Systems (NeurIPS)","volume":"29","author":"Degenne"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1017\/9781108571401"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2020.3025904"},{"key":"ref27","article-title":"Sleeping Combinatorial Bandits","author":"Abhishek","year":"2021"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.52202\/068431-0460"},{"key":"ref29","article-title":"Worst-Case Regret Bounds for Exploration via Randomized Value Functions","volume-title":"Proc. Advances in Neural Information Processing Systems","volume":"32","author":"Russo"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/MWC.2006.1632477"},{"key":"ref31","article-title":"UCSB\/MeshNet","author":"Sheriff","year":"2007"}],"event":{"name":"IEEE INFOCOM 2026 - IEEE Conference on Computer Communications","location":"Tokyo, Japan","start":{"date-parts":[[2026,5,18]]},"end":{"date-parts":[[2026,5,21]]}},"container-title":["IEEE INFOCOM 2026 - IEEE Conference on Computer Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11571071\/11571169\/11571327.pdf?arnumber=11571327","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,30]],"date-time":"2026-06-30T05:12:14Z","timestamp":1782796334000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11571327\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5,18]]},"references-count":31,"URL":"https:\/\/doi.org\/10.1109\/infocom59046.2026.11571327","relation":{},"subject":[],"published":{"date-parts":[[2026,5,18]]}}}