{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T08:54:54Z","timestamp":1730278494494,"version":"3.28.0"},"reference-count":21,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,11,1]],"date-time":"2022-11-01T00:00:00Z","timestamp":1667260800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,11,1]],"date-time":"2022-11-01T00:00:00Z","timestamp":1667260800000},"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,11,1]]},"DOI":"10.1109\/itw54588.2022.9965863","type":"proceedings-article","created":{"date-parts":[[2022,12,7]],"date-time":"2022-12-07T20:47:00Z","timestamp":1670446020000},"page":"49-54","source":"Crossref","is-referenced-by-count":3,"title":["An Information-theoretic Method for Collaborative Distributed Learning with Limited Communication"],"prefix":"10.1109","author":[{"given":"Xinyi","family":"Tong","sequence":"first","affiliation":[{"name":"Tsinghua University,Tsinghua-Berkeley Shenzhen Institute"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jian","family":"Xu","sequence":"additional","affiliation":[{"name":"Tsinghua University,Tsinghua-Berkeley Shenzhen Institute"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shao-Lun","family":"Huang","sequence":"additional","affiliation":[{"name":"Tsinghua University,Tsinghua-Berkeley Shenzhen Institute"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","article-title":"Local SGD converges fast and communicates little","author":"stich","year":"2019","journal-title":"International Conference on Learning Representations"},{"key":"ref11","article-title":"Communication-efficient SGD: from local SGD to one-shot averaging","author":"spiridonoff","year":"2021","journal-title":"NeurIPS"},{"key":"ref12","article-title":"Local SGD: unified theory and new efficient methods","author":"gorbunov","year":"2021","journal-title":"International Conference on Artificial Intelligence and Statistics"},{"key":"ref13","first-page":"26","article-title":"Distributed learning, communication complexity and privacy","author":"balcan","year":"2012","journal-title":"Conference on Learning Theory JMLR Workshop and Conference Proceedings"},{"key":"ref14","first-page":"9583","article-title":"Lower bounds for learning distributions under communication constraints via fisher information","volume":"21","author":"barnes","year":"2020","journal-title":"The Journal of Machine Learning Research"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897582"},{"key":"ref16","first-page":"18920","article-title":"Distributed estimation with multiple samples per user: Sharp rates and phase transition","volume":"34","author":"acharya","year":"2021","journal-title":"Advances in neural information processing systems"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/18.720546"},{"key":"ref18","volume":"2","author":"feller","year":"2008","journal-title":"An Introduction to Probability Theory and Its Applications"},{"journal-title":"Handbook of Theoretical Computer Science (Vol A) Algorithms and Complexity","year":"1991","author":"van leeuwen","key":"ref19"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2021.3095077"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-022-01664-x"},{"key":"ref6","article-title":"QSGD: communication-efficient SGD via gradient quantization and encoding","author":"alistarh","year":"2017","journal-title":"Advances in Neural Information Processing Systems (NIPS)"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-7908-2604-3_16"},{"key":"ref8","article-title":"A linear speedup analysis of distributed deep learning with sparse and quantized communication","author":"jiang","year":"2018","journal-title":"NeurIPS"},{"key":"ref7","article-title":"Gradient sparsification for communication-efficient distributed optimization","author":"wangni","year":"2018","journal-title":"NIPS"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-15-6109-2"},{"key":"ref1","first-page":"30:1","article-title":"A survey on distributed machine learning","volume":"53","author":"verbraeken","year":"2020","journal-title":"ACM Comput Surv"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2020.2985917"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.2307\/2372336"},{"key":"ref21","first-page":"185","article-title":"Improved bounds on bell numbers and on moments of sums of random variables","volume":"30","author":"berend","year":"2010","journal-title":"Probability and Mathematical Statistics"}],"event":{"name":"2022 IEEE Information Theory Workshop (ITW)","start":{"date-parts":[[2022,11,1]]},"location":"Mumbai, India","end":{"date-parts":[[2022,11,9]]}},"container-title":["2022 IEEE Information Theory Workshop (ITW)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9965754\/9965755\/09965863.pdf?arnumber=9965863","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,26]],"date-time":"2022-12-26T19:42:30Z","timestamp":1672083750000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9965863\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11,1]]},"references-count":21,"URL":"https:\/\/doi.org\/10.1109\/itw54588.2022.9965863","relation":{},"subject":[],"published":{"date-parts":[[2022,11,1]]}}}