{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T06:18:58Z","timestamp":1774678738768,"version":"3.50.1"},"reference-count":33,"publisher":"IEEE","license":[{"start":{"date-parts":[[2024,7,7]],"date-time":"2024-07-07T00:00:00Z","timestamp":1720310400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,7,7]],"date-time":"2024-07-07T00:00:00Z","timestamp":1720310400000},"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":[[2024,7,7]]},"DOI":"10.1109\/isit57864.2024.10619653","type":"proceedings-article","created":{"date-parts":[[2024,8,19]],"date-time":"2024-08-19T13:25:01Z","timestamp":1724073901000},"page":"777-782","source":"Crossref","is-referenced-by-count":1,"title":["Minimal Communication-Cost Statistical Learning"],"prefix":"10.1109","author":[{"given":"Milad","family":"Sefidgaran","sequence":"first","affiliation":[{"name":"Paris Research Center, Huawei Technologies,France"}]},{"given":"Abdellatif","family":"Zaidi","sequence":"additional","affiliation":[{"name":"Université Gustave Eiffel,France"}]},{"given":"Piotr","family":"Krasnowski","sequence":"additional","affiliation":[{"name":"Paris Research Center, Huawei Technologies,France"}]}],"member":"263","reference":[{"key":"ref1","first-page":"1273","article-title":"Communication-efficient learning of deep networks from decentralized data","volume-title":"Artificial intelligence and statistics","author":"McMahan","year":"2017"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jnca.2018.05.003"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2019.2928806"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/GCWkshps52748.2021.9682062"},{"key":"ref5","article-title":"8-bit approximations for parallelism in deep learning","author":"Dettmers","year":"2015","journal-title":"arXiv preprint"},{"key":"ref6","article-title":"Qsgd: Communication-efficient sgd via gradient quantization and encoding","volume":"30","author":"Alistarh","year":"2017","journal-title":"Advances in neural information processing systems"},{"key":"ref7","first-page":"560","article-title":"signsgd: Compressed optimisation for non-convex problems","volume-title":"International Conference on Machine Learning","author":"Bernstein"},{"key":"ref8","article-title":"signsgd with majority vote is communication efficient and fault tolerant","author":"Bernstein","year":"2018","journal-title":"arXiv preprint"},{"key":"ref9","first-page":"5325","article-title":"Error compensated quantized sgd and its applications to large-scale distributed optimization","volume-title":"International Conference on Machine Learning","author":"Wu"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/MICRO.2018.00023"},{"key":"ref11","article-title":"Exploring fast and communication-efficient algorithms in large-scale distributed networks","author":"Yu","year":"2019","journal-title":"arXiv preprint"},{"key":"ref12","first-page":"4772","article-title":"Catastrophic fisher explosion: Early phase fisher matrix impacts generalization","volume-title":"International Conference on Machine Learning","author":"Jastrzebski"},{"key":"ref13","article-title":"Sparsified sgd with memory","volume":"31","author":"Stich","year":"2018","journal-title":"Advances in Neural Information Processing Systems"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/D17-1045"},{"key":"ref15","article-title":"The convergence of sparsified gradient methods","volume":"31","author":"Alistarh","year":"2018","journal-title":"Advances in Neural Information Processing Systems"},{"key":"ref16","article-title":"Qsparse-local-sgd: Distributed sgd with quantization, sparsification and local computations","volume":"32","author":"Basu","year":"2019","journal-title":"Advances in Neural Information Processing Systems"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/MLHPC.2016.004"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.21437\/interspeech.2015-354"},{"key":"ref19","first-page":"254","article-title":"Stronger generalization bounds for deep nets via a compression approach","volume-title":"International Conference on Machine Learning","author":"Arora"},{"key":"ref20","first-page":"2","article-title":"Algorithmic regularization in over-parameterized matrix sensing and neural networks with quadratic ac-tivations","volume-title":"Conference On Learning Theory","author":"Li"},{"key":"ref21","first-page":"1147","article-title":"Streaming pca: Matching matrix bernstein and near-optimal finite sample guaran-tees for ojas algorithm","volume-title":"Conference on learning theory","author":"Jain"},{"key":"ref22","volume-title":"Compressed communication for distributed deep learning: Survey and quantitative evaluation","author":"Xu","year":"2020"},{"key":"ref23","article-title":"Minimal random code learning: Getting bits back from compressed model parameters","author":"Havasi","year":"2018","journal-title":"arXiv preprint"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2007.32"},{"key":"ref25","first-page":"21308","article-title":"Algorithms for the communication of samples","volume-title":"International Conference on Machine Learning","author":"Theis"},{"key":"ref26","article-title":"Communication-efficient federated learning through importance sam-pling","author":"Isik","year":"2023","journal-title":"arXiv preprint"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT54713.2023.10206678"},{"key":"ref28","first-page":"4416","article-title":"Rate-distortion theoretic generalization bounds for stochastic learning algorithms","volume-title":"Conference on Learning Theory","author":"Sefidgaran"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/tit.2024.3414266"},{"key":"ref30","article-title":"Statistical theory of extreme valuse and some practical applications","author":"Gumbel","year":"1954","journal-title":"Nat. Bur. Standards Appl. Math. Ser. 33"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1214\/17-AAP1326"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2054651"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2015.7133173"}],"event":{"name":"2024 IEEE International Symposium on Information Theory (ISIT)","location":"Athens, Greece","start":{"date-parts":[[2024,7,7]]},"end":{"date-parts":[[2024,7,12]]}},"container-title":["2024 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/10619013\/10619074\/10619653.pdf?arnumber=10619653","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:28:38Z","timestamp":1773347318000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10619653\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,7]]},"references-count":33,"URL":"https:\/\/doi.org\/10.1109\/isit57864.2024.10619653","relation":{},"subject":[],"published":{"date-parts":[[2024,7,7]]}}}