{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T21:48:37Z","timestamp":1740174517629,"version":"3.37.3"},"reference-count":52,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2023,5,1]],"date-time":"2023-05-01T00:00:00Z","timestamp":1682899200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,5,1]],"date-time":"2023-05-01T00:00:00Z","timestamp":1682899200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,5,1]],"date-time":"2023-05-01T00:00:00Z","timestamp":1682899200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"National Key R&D Program of China","award":["021ZD0140405"],"award-info":[{"award-number":["021ZD0140405"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62102029","62201285","62101283"],"award-info":[{"award-number":["62102029","62201285","62101283"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012236","name":"Beijing Institute of Technology Research Fund Program for Young Scholars","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100012236","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Jiangsu Natural Science Foundation for Distinguished Young Scholars","award":["BK20220054"],"award-info":[{"award-number":["BK20220054"]}]},{"name":"Future Network Scientific Research Fund Project","award":["FNSRFP-2021-ZD-8"],"award-info":[{"award-number":["FNSRFP-2021-ZD-8"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Netw. Sci. Eng."],"published-print":{"date-parts":[[2023,5,1]]},"DOI":"10.1109\/tnse.2022.3231320","type":"journal-article","created":{"date-parts":[[2022,12,22]],"date-time":"2022-12-22T18:38:43Z","timestamp":1671734323000},"page":"1586-1598","source":"Crossref","is-referenced-by-count":0,"title":["Distributed Robust Bandits With Efficient Communication"],"prefix":"10.1109","volume":"10","author":[{"given":"Ao","family":"Wang","sequence":"first","affiliation":[{"name":"College of Telecommunications and Information Engineering, Nanjing University of Posts and Telecommunications, Nanjing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9270-1810","authenticated-orcid":false,"given":"Zhida","family":"Qin","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Beijing Institute of Technology, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2229-054X","authenticated-orcid":false,"given":"Lu","family":"Zheng","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Beijing Institute of Technology, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0749-0001","authenticated-orcid":false,"given":"Dapeng","family":"Li","sequence":"additional","affiliation":[{"name":"College of Telecommunications and Information Engineering, Nanjing University of Posts and Telecommunications, Nanjing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0142-1515","authenticated-orcid":false,"given":"Lin","family":"Gao","sequence":"additional","affiliation":[{"name":"Electronic and Information Engineering, Harbin Institute of Technology, Shenzhen, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM41043.2020.9155431"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM41043.2020.9155362"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM41043.2020.9155408"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM41043.2020.9155518"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2019.2916489"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2020.3041654"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2021.3055679"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.001.1900649"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2020.3045050"},{"key":"ref10","first-page":"1901","article-title":"Decentralized exploration in multi-armed bandits","volume-title":"Proc. Int. Conf. Mach. Learn.","volume":"97","author":"Fraud","year":"2019"},{"key":"ref11","first-page":"234","article-title":"Cooperative online learning: Keeping your neighbors updated","volume-title":"Proc. Algorithmic Learn. Theory","volume":"117","author":"Cesa-Bianchi","year":"2020"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2017.2789293"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/MWC.2019.1800458"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/MWC.001.1900028"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/3366701"},{"key":"ref16","first-page":"961","article-title":"Non-stochastic multi-player multi-armed bandits: Optimal rate with collision information, sublinear without","volume":"125","author":"Bubeck","year":"2020","journal-title":"Proc. Conf. Learn. Theory"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2302471"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2230215"},{"key":"ref19","first-page":"155","article-title":"Multi-player bandits - a musical chairs approach","volume":"48","author":"Rosenski","year":"2016","journal-title":"Proc. Int. Conf. Mach. Learn."},{"key":"ref20","first-page":"19","article-title":"Gossip-based distributed stochastic bandit algorithms","volume":"28","author":"Szrnyi","year":"2013","journal-title":"Proc. Int. Conf. Mach. Learn."},{"key":"ref21","first-page":"4529","article-title":"Decentralized cooperative stochastic bandits","volume-title":"Proc. Int. Adv. Conf. Neural Inf. Process. Syst.","volume":"32","author":"Martnez-Rubio","year":"2019"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2019.00017"},{"key":"ref23","article-title":"Distributed bandit learning: Near-optimal regret with efficient communication","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Wang","year":"2020"},{"key":"ref24","first-page":"1","article-title":"Delay and cooperation in nonstochastic bandits","volume":"20","author":"Cesa-Bianchi","year":"2019","journal-title":"J. Mach. Learn. Res."},{"key":"ref25","first-page":"4872","article-title":"Delay and cooperation in nonstochastic linear bandits","volume-title":"Proc. Int. Adv. Conf. Neural Inf. Process. Syst.","author":"Ito","year":"2020"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/11503415_16"},{"key":"ref27","first-page":"3110","article-title":"Individual regret in cooperative nonstochastic multi-armed bandits","volume-title":"Proc. Int. Adv. Conf. Neural Inf. Process. Syst.","author":"Bar-On","year":"2019"},{"key":"ref28","first-page":"357","article-title":"Private and byzantine-proof cooperative decision-making","volume-title":"Proc. 19th Int. Conf. Auton. Agents MultiAgent Syst.","author":"Dubey","year":"2020"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/3466772.3467045"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/3570614"},{"article-title":"Exploiting heterogeneity in robust federated best-arm identification","year":"2021","author":"Mitra","key":"ref31"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/3188745.3188918"},{"key":"ref33","first-page":"1562","article-title":"Better algorithms for stochastic bandits with adversarial corruptions","volume-title":"Proc. Conf. Learn. Theory","volume":"99","author":"Gupta","year":"2019"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-018-5758-5"},{"key":"ref35","first-page":"1","article-title":"Tsallis-inf: An optimal algorithm for stochastic and adversarial bandits","volume":"22","author":"Zimmert","year":"2021","journal-title":"J. Mach. Learn. Res."},{"key":"ref36","article-title":"Improved analysis of robustness of the tsallis-inf algorithm to adversarial corruptions in stochastic multiarmed bandits","author":"Masoudian","year":"2021","journal-title":"Proc. Int. Conf. Comput. Learn. Theory"},{"key":"ref37","first-page":"2552","article-title":"Parameter-free multi-armed bandit algorithms with hybrid data-dependent regret bounds","volume-title":"Proc. Conf. Learn. Theory","volume":"134","author":"Ito","year":"2021"},{"key":"ref38","first-page":"1444","article-title":"Simple combinatorial algorithms for combinatorial bandits: Corruptions and approximations","volume-title":"Proc. Uncertainty Artif. Intell.","author":"Xu","year":"2021"},{"key":"ref39","first-page":"1071","article-title":"Corruption-tolerant gaussian process bandit optimization","volume-title":"Proc. Int. Conf. Artif. Intell. Statist.","author":"Bogunovic","year":"2020"},{"key":"ref40","first-page":"991","article-title":"Stochastic linear bandits robust to adversarial attacks","volume-title":"Proc. Int. Conf. Artif. Intell. Statist.","author":"Bogunovic","year":"2021"},{"key":"ref41","first-page":"6142","article-title":"Achieving near instance-optimality and minimax-optimality in stochastic and adversarial linear bandits simultaneously","volume-title":"in Proc. Int. Conf. Mach. Learn.","author":"Lee","year":"2021"},{"key":"ref42","first-page":"19943","article-title":"Adversarial bandits with corruptions: Regret lower bound and no-regret algorithm","volume-title":"Proc. Int. Adv. Conf. Neural Inf. Process. Syst.","volume":"33","author":"Yang","year":"2020"},{"key":"ref43","first-page":"529","article-title":"An efficient algorithm for cooperative semi-bandits","volume-title":"Proc. 32nd Int. Conf. Algorithmic Learn. Theory","volume":"132","author":"Vecchia","year":"2021"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2021.3086014"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45435-7_18"},{"key":"ref46","first-page":"8885","article-title":"Cooperative stochastic bandits with asynchronous agents and constrained feedback","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Yang","year":"2021"},{"key":"ref47","first-page":"1079","article-title":"Action elimination and stopping conditions for the multi-armed bandit and reinforcement learning problems","volume":"7","author":"Even-Dar","year":"2006","journal-title":"J. Mach. Learn. Res."},{"key":"ref48","first-page":"752","article-title":"Top-k combinatorial bandits with full-bandit feedback","volume":"117","author":"Rejwan","year":"2020","journal-title":"Proc. Algorithmic Learn. Theory"},{"key":"ref49","first-page":"722","article-title":"Adaptive multiple-arm identification","volume":"70","author":"Chen","year":"2017","journal-title":"Proc. Int. Conf. Mach. Learn."},{"key":"ref50","first-page":"4042","article-title":"Data poisoning attacks on stochastic bandits","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Liu","year":"2019"},{"key":"ref51","first-page":"3640","article-title":"Adversarial attacks on stochastic bandits","volume-title":"Proc. Int. Adv. Conf. Neural Inf. Process. Syst.","author":"Jun","year":"2018"},{"key":"ref52","first-page":"4102","article-title":"Bandits with delayed, aggregated anonymous feedback","volume":"80","author":"Pike-Burke","year":"2018","journal-title":"Proc. Int. Conf. Mach. Learn."}],"container-title":["IEEE Transactions on Network Science and Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6488902\/10107645\/09996575.pdf?arnumber=9996575","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,21]],"date-time":"2024-11-21T19:17:47Z","timestamp":1732216667000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9996575\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5,1]]},"references-count":52,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tnse.2022.3231320","relation":{},"ISSN":["2327-4697","2334-329X"],"issn-type":[{"type":"electronic","value":"2327-4697"},{"type":"electronic","value":"2334-329X"}],"subject":[],"published":{"date-parts":[[2023,5,1]]}}}