{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T08:25:09Z","timestamp":1761294309225,"version":"3.37.3"},"reference-count":22,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,6,6]],"date-time":"2021-06-06T00:00:00Z","timestamp":1622937600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,6,6]],"date-time":"2021-06-06T00:00:00Z","timestamp":1622937600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,6,6]],"date-time":"2021-06-06T00:00:00Z","timestamp":1622937600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100016684","name":"Center for Cognitive Computing Systems Research","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100016684","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000879","name":"Alfred P. Sloan Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000879","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,6,6]]},"DOI":"10.1109\/icassp39728.2021.9414506","type":"proceedings-article","created":{"date-parts":[[2021,5,13]],"date-time":"2021-05-13T19:53:45Z","timestamp":1620935625000},"page":"3365-3369","source":"Crossref","is-referenced-by-count":2,"title":["Near-Optimal Algorithms for Piecewise-Stationary Cascading Bandits"],"prefix":"10.1109","author":[{"given":"Lingda","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huozhi","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bingcong","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lav R.","family":"Varshney","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhizhen","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-24412-4_16"},{"key":"ref11","first-page":"199","article-title":"Stochastic multi-armed-bandit problem with non-stationary rewards","author":"besbes","year":"2014","journal-title":"Proc 24th Annu Conf Neural Inf Process Syst (NeurIPS’14)"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.23919\/ACC.2018.8431265"},{"key":"ref13","first-page":"418","article-title":"Nearly optimal adaptive procedure with change detection for piecewise-stationary bandit","author":"cao","year":"2019","journal-title":"Proc 22nd Int Conf Artif Intell Stat (AISTATS 2019)"},{"key":"ref14","article-title":"A change-detection based framework for piecewise-stationary multi-armed bandit problem","author":"liu","year":"2018","journal-title":"Proc 32nd AAAI Conf Artif Intell (AAAI’18)"},{"article-title":"The generalized likelihood ratio test meets klucb: an improved algorithm for piece-wise non-stationary bandits","year":"2019","author":"besson","key":"ref15"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i04.6176"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.2307\/2333009"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1093\/biomet\/58.3.509"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2019\/396"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1023\/A:1013689704352"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/0196-8858(85)90002-8"},{"article-title":"Adversarial linear contextual bandits with graph-structured side observations","year":"2020","author":"wang","key":"ref6"},{"key":"ref5","first-page":"993","article-title":"Bandit online learning with unknown delays","author":"li","year":"2019","journal-title":"Proc 22th Int Conf Artif Intell Stat (AISTATS 2019)"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/1553374.1553524"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/3289600.3290958"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/1341531.1341545"},{"key":"ref1","first-page":"767","article-title":"Cascading bandits: Learning to rank in the cascade model","author":"kveton","year":"2015","journal-title":"Proc 32th Int Conf Mach Learn (ICML 2015)"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539701398375"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.1976.1101146"},{"article-title":"Nearly optimal algorithms for piecewise-stationary cascading bandits","year":"2019","author":"wang","key":"ref22"},{"article-title":"Mixture martingales revisited with applications to sequential tests and confidence intervals","year":"2018","author":"kaufmann","key":"ref21"}],"event":{"name":"ICASSP 2021 - 2021 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","start":{"date-parts":[[2021,6,6]]},"location":"Toronto, ON, Canada","end":{"date-parts":[[2021,6,11]]}},"container-title":["ICASSP 2021 - 2021 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9413349\/9413350\/09414506.pdf?arnumber=9414506","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T15:41:07Z","timestamp":1652197267000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9414506\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,6]]},"references-count":22,"URL":"https:\/\/doi.org\/10.1109\/icassp39728.2021.9414506","relation":{},"subject":[],"published":{"date-parts":[[2021,6,6]]}}}