{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:56:51Z","timestamp":1773377811323,"version":"3.50.1"},"reference-count":42,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,6,26]],"date-time":"2022-06-26T00:00:00Z","timestamp":1656201600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,6,26]],"date-time":"2022-06-26T00:00:00Z","timestamp":1656201600000},"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":[[2022,6,26]]},"DOI":"10.1109\/isit50566.2022.9834499","type":"proceedings-article","created":{"date-parts":[[2022,8,3]],"date-time":"2022-08-03T15:34:22Z","timestamp":1659540862000},"page":"1653-1658","source":"Crossref","is-referenced-by-count":4,"title":["Efficient Distributed Machine Learning via Combinatorial Multi-Armed Bandits"],"prefix":"10.1109","author":[{"given":"Maximilian","family":"Egger","sequence":"first","affiliation":[{"name":"Technical University of Munich,Germany"}]},{"given":"Rawad","family":"Bitar","sequence":"additional","affiliation":[{"name":"Technical University of Munich,Germany"}]},{"given":"Antonia","family":"Wachter-Zeh","sequence":"additional","affiliation":[{"name":"Technical University of Munich,Germany"}]},{"given":"Deniz","family":"G\u00fcnd\u00fcz","sequence":"additional","affiliation":[{"name":"Imperial College London,United Kingdom"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/BF01301683"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780199535255.001.0001"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/DYSPAN.2010.5457857"},{"key":"ref32","first-page":"1651","article-title":"Combinatorial multi-armed bandit with general reward functions","volume":"29","author":"chen","year":"2016","journal-title":"Advances in neural information processing systems"},{"key":"ref31","first-page":"535","article-title":"Tight Regret Bounds for Stochastic Combinatorial Semi-Bandits","volume":"38","author":"kveton","year":"2015","journal-title":"Proc International Conference on Artificial Intelligence and Statistics"},{"key":"ref30","first-page":"1746","article-title":"Combinatorial multi-armed bandit and its extension to probabilistically triggered arms","volume":"17","author":"chen","year":"2016","journal-title":"The Journal of Machine Learning Research"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1017\/9781108571401"},{"key":"ref36","article-title":"Cost-efficient distributed learning via combinatorial multi-armed bandits","author":"egger","year":"2022"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1137\/16M1080173"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2011.2181864"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2014.6848010"},{"key":"ref40","first-page":"1476","article-title":"Convergence diagnostics for stochastic gradient descent with constant learning rate","volume":"84","author":"chee","year":"2018","journal-title":"Proc International Conference on Artificial Intelligence and Statistics"},{"key":"ref11","first-page":"5610","article-title":"Communication-computation efficient gradient coding","author":"ye","year":"2018","journal-title":"International Conference on Machine Learning"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3029396"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.3390\/e22050544"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2019.2952051"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPSW.2018.00137"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2020.2991361"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849514"},{"key":"ref18","article-title":"Approximate gradient coding via sparse random graphs","author":"charles","year":"2017"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/3366700"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2277869"},{"key":"ref4","first-page":"3368","article-title":"Gradient coding: Avoiding stragglers in distributed learning","volume":"70","author":"tandon","year":"2017","journal-title":"Proc International Conference on Machine Learning"},{"key":"ref27","article-title":"UCB algorithm for exponential distributions","author":"jouini","year":"2012"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541478"},{"key":"ref6","article-title":"Better mini-batch algorithms via accelerated gradient methods","volume":"24","author":"cotter","year":"2011","journal-title":"Advances in neural information processing systems"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.1987.1104491"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177729586"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP40776.2020.9053961"},{"key":"ref7","first-page":"803","article-title":"Slow and stale gradients can win the race: Error-runtime trade-offs in distributed SGD","volume":"84","author":"dutta","year":"2018","journal-title":"Proc International Conference on Artificial Intelligence and Statistics"},{"key":"ref2","article-title":"Revisiting distributed synchronous SGD","author":"chen","year":"2017"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.2307\/2332286"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/2408776.2408794"},{"key":"ref20","article-title":"ErasureHead: Distributed gradient descent without delays using approximate gradient coding","author":"wang","year":"2019"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2019.8683267"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849580"},{"key":"ref42","article-title":"On the pareto frontier of regret minimization and best arm identification in stochastic bandits","author":"zhong","year":"2021"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/0196-8858(85)90002-8"},{"key":"ref41","first-page":"7641","article-title":"On convergence-diagnostic based step sizes for stochastic gradient descent","volume":"119","author":"pesme","year":"2020","journal-title":"Proc International Conference on Machine Learning"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3133791"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1023\/A:1013689704352"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.2307\/1427934"}],"event":{"name":"2022 IEEE International Symposium on Information Theory (ISIT)","location":"Espoo, Finland","start":{"date-parts":[[2022,6,26]]},"end":{"date-parts":[[2022,7,1]]}},"container-title":["2022 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9834325\/9834269\/09834499.pdf?arnumber=9834499","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:35:14Z","timestamp":1773347714000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9834499\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,26]]},"references-count":42,"URL":"https:\/\/doi.org\/10.1109\/isit50566.2022.9834499","relation":{},"subject":[],"published":{"date-parts":[[2022,6,26]]}}}