{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,23]],"date-time":"2026-04-23T14:55:50Z","timestamp":1776956150275,"version":"3.51.4"},"reference-count":25,"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"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,6,26]]},"DOI":"10.1109\/isit50566.2022.9834700","type":"proceedings-article","created":{"date-parts":[[2022,8,3]],"date-time":"2022-08-03T15:34:22Z","timestamp":1659540862000},"page":"1465-1470","source":"Crossref","is-referenced-by-count":12,"title":["Improved Information Theoretic Generalization Bounds for Distributed and Federated Learning"],"prefix":"10.1109","author":[{"given":"L. P.","family":"Barnes","sequence":"first","affiliation":[{"name":"Princeton University,Department of Electrical and Computer Engineering"}]},{"given":"A.","family":"Dytso","sequence":"additional","affiliation":[{"name":"New Jersey Institute of Technology,Department of Electrical and Computer Engineering"}]},{"given":"H. V.","family":"Poor","sequence":"additional","affiliation":[{"name":"Princeton University,Department of Electrical and Computer Engineering"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/11681878_14"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1137\/090756090"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978308"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/SPAWC48557.2020.9154277"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT50566.2022.9834700"},{"key":"ref15","first-page":"2635","article-title":"Learnability, stability and uniform convergence","volume":"11","author":"shalev-shwartz","year":"2010","journal-title":"Journal of Machine Learning Research"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/0041-5553(67)90040-7"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3130381"},{"key":"ref18","article-title":"Clustering with Bregman divergences","volume":"6","author":"banerjee","year":"2005","journal-title":"Journal of Machine Learning Research"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437571"},{"key":"ref4","article-title":"Communication-efficient learning of deep networks from decentralized data","author":"mcmahan","year":"2017","journal-title":"Proceedings of AISTATS"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2020.2991139"},{"key":"ref6","article-title":"Federated learning: Strategies for improving communication efficiency","author":"kone?n\u00fd","year":"2016","journal-title":"Proceedings of the NIPS Workshop on Private Multi-Party Machine Learning"},{"key":"ref5","article-title":"Federated optimization: Distributed machine learning for on-device intelligence","author":"konecn\u00fd","year":"2016","journal-title":"CoRR"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2020.3042094"},{"key":"ref7","article-title":"Deep gradient compression: Reducing the communication bandwidth for distributed training","author":"lin","year":"2018","journal-title":"Proceedings of the 6th International Congress on Learning Representations (ICLR)"},{"key":"ref2","first-page":"2521","article-title":"Information-theoretic analysis of generalization capability of learning algorithms","author":"xu","year":"2017","journal-title":"Advances in neural information processing systems"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1965.10480775"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2945779"},{"key":"ref20","article-title":"Generalization bounds for noisy iterative algorithms using properties of additive noise channels","author":"wang","year":"2021"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3085190"},{"key":"ref21","first-page":"1270","article-title":"High probability generalization bounds for uniformly stable algorithms with nearly optimal rate","volume":"99","author":"feldman","year":"2019","journal-title":"Proceedings of the Thirty-Second Conference on Learning Theory"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2016.7606789"},{"key":"ref23","first-page":"7245","article-title":"Chaining mutual information and tightening generalization bounds","author":"asadi","year":"2018","journal-title":"Advances in neural information processing systems"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006774"}],"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\/09834700.pdf?arnumber=9834700","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:36:30Z","timestamp":1773347790000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9834700\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,26]]},"references-count":25,"URL":"https:\/\/doi.org\/10.1109\/isit50566.2022.9834700","relation":{},"subject":[],"published":{"date-parts":[[2022,6,26]]}}}