{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T05:10:02Z","timestamp":1735708202708,"version":"3.32.0"},"reference-count":33,"publisher":"IEEE","license":[{"start":{"date-parts":[[2024,11,24]],"date-time":"2024-11-24T00:00:00Z","timestamp":1732406400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,11,24]],"date-time":"2024-11-24T00:00:00Z","timestamp":1732406400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100013058","name":"Jiangsu Provincial Key Research and Development Program","doi-asserted-by":"publisher","award":["BE2022068,BE2022068-1"],"award-info":[{"award-number":["BE2022068,BE2022068-1"]}],"id":[{"id":"10.13039\/501100013058","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024,11,24]]},"DOI":"10.1109\/itw61385.2024.10806992","type":"proceedings-article","created":{"date-parts":[[2024,12,30]],"date-time":"2024-12-30T19:18:57Z","timestamp":1735586337000},"page":"354-359","source":"Crossref","is-referenced-by-count":0,"title":["Lossy Compression for Sparse Aggregation"],"prefix":"10.1109","author":[{"given":"Yijun","family":"Fan","sequence":"first","affiliation":[{"name":"The Chinese University of Hong Kong,Department of Information Engineering"}]},{"given":"Fangwei","family":"Ye","sequence":"additional","affiliation":[{"name":"College of Computer Science and Technology, Nanjing University of Aeronautics and Astronautics,Nanjing,China"}]},{"given":"Raymond W.","family":"Yeung","sequence":"additional","affiliation":[{"name":"The Chinese University of Hong Kong,Department of Information Engineering"}]}],"member":"263","reference":[{"key":"ref1","first-page":"8253","article-title":"Fetchsgd: Communication-efficient feder-ated learning with sketching","volume-title":"International Conference on Machine Learning. PMLR","author":"Rothchild","year":"2020"},{"key":"ref2","article-title":"The communication cost of security and privacy in federated frequency estimation","author":"Chen","year":"2022","journal-title":"arXiv preprint"},{"doi-asserted-by":"publisher","key":"ref3","DOI":"10.1109\/SP46214.2022.9833635"},{"doi-asserted-by":"publisher","key":"ref4","DOI":"10.1109\/ICASSP39728.2021.9413764"},{"doi-asserted-by":"publisher","key":"ref5","DOI":"10.1561\/2200000083"},{"key":"ref6","first-page":"21984","article-title":"Eden: Communication-efficient and robust distributed mean estimation for federated learning","volume-title":"International Conference on Machine Learning. PMLR","author":"Vargaftik","year":"2022"},{"doi-asserted-by":"publisher","key":"ref7","DOI":"10.1109\/TIT.2022.3161620"},{"key":"ref8","first-page":"1273","article-title":"Communication-efficient learning of deep networks from decentralized data","author":"McMahan","year":"2017","journal-title":"Artificial intelligence and statistics. PMLR"},{"doi-asserted-by":"publisher","key":"ref9","DOI":"10.1109\/JIOT.2014.2387155"},{"doi-asserted-by":"publisher","key":"ref10","DOI":"10.21437\/Interspeech.2015-354"},{"doi-asserted-by":"publisher","key":"ref11","DOI":"10.18653\/v1\/D17-1045"},{"doi-asserted-by":"publisher","key":"ref12","DOI":"10.1109\/IJCNN.2019.8852172"},{"doi-asserted-by":"publisher","key":"ref13","DOI":"10.1109\/JIOT.2021.3073112"},{"key":"ref14","article-title":"Variance-based gradient compression for efficient distributed deep learning","author":"Tsuzuku","year":"2018","journal-title":"ar Xiv preprint"},{"doi-asserted-by":"publisher","key":"ref15","DOI":"10.1109\/TWC.2020.2974748"},{"key":"ref16","article-title":"Secure federated submodellearning","author":"Niu","year":"2019","journal-title":"arXiv preprint"},{"key":"ref17","first-page":"21150","article-title":"Deepreduce: A sparse-tensor communication framework for federated deep learning","volume":"34","author":"Xu","year":"2021","journal-title":"Advances in Neural Information Processing Systems"},{"key":"ref18","first-page":"51","article-title":"Communication complexity in locally private distribution estimation and heavy hitters","volume-title":"International Conference on Machine Learning. PMLR","author":"Acharya","year":"2019"},{"doi-asserted-by":"publisher","key":"ref19","DOI":"10.1109\/TIT.1973.1055037"},{"key":"ref20","article-title":"Information-theoretic lower bounds for distributed statistical estimation with communication constraints","volume":"26","author":"Zhang","year":"2013","journal-title":"Advances in Neural Information Processing Systems"},{"doi-asserted-by":"publisher","key":"ref21","DOI":"10.1109\/TIT.2022.3174409"},{"issue":"1","key":"ref22","first-page":"5","article-title":"Distributed statis-tical estimation of high-dimensional and nonparametric distributions with communication constraints, february 2018","volume":"1","author":"Han","year":"2018","journal-title":"Talk given at ITA"},{"doi-asserted-by":"publisher","key":"ref23","DOI":"10.1109\/TIT.2020.3028439"},{"key":"ref24","first-page":"31915","article-title":"Collaborative learning of discrete distributions under heterogeneity and communication constraints","volume":"35","author":"Huang","year":"2022","journal-title":"Advances in neural information processing systems"},{"key":"ref25","article-title":"Optimal private discrete distribution estimation with one-bit communication","author":"Nam","year":"2023","journal-title":"arXiv preprint"},{"doi-asserted-by":"publisher","key":"ref26","DOI":"10.1109\/TIT.2022.3218772"},{"key":"ref27","article-title":"Exact optimality of communication-privacy-utility tradeoffs in distributed mean estimation","volume":"36","author":"Isik","year":"2024","journal-title":"Advances in Neural Information Processing Systems"},{"key":"ref28","first-page":"3329","article-title":"Distributed mean estimation with limited communication","author":"Suresh","year":"2017","journal-title":"International confer-ence on machine learning. PMLR"},{"key":"ref29","first-page":"2021","article-title":"Fedpaq: A communication-efficient federated learning method with periodic averaging and quantization","volume-title":"International conference on artificial intelligence and statistics. PMLR","author":"Reisizadeh","year":"2020"},{"key":"ref30","first-page":"2350","article-title":"Federated learning with compression: Unified analysis and sharp guarantees","volume-title":"International Conference on Artificial Intelligence and Statistics. PMLR","author":"Haddadpour","year":"2021"},{"key":"ref31","article-title":"Machine unlearning of federated clusters","volume-title":"The Eleventh International Conference on Learning Representations","author":"Pan","year":"2022"},{"key":"ref32","article-title":"On the combinatorics of placing balls into ordered bins","author":"Bonde","year":"2020","journal-title":"arXiv preprint"},{"volume-title":"Information theory and network coding","year":"2008","author":"Yeung","key":"ref33"}],"event":{"name":"2024 IEEE Information Theory Workshop (ITW)","start":{"date-parts":[[2024,11,24]]},"location":"Shenzhen, China","end":{"date-parts":[[2024,11,28]]}},"container-title":["2024 IEEE Information Theory Workshop (ITW)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/10806859\/10806904\/10806992.pdf?arnumber=10806992","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,31]],"date-time":"2024-12-31T06:22:07Z","timestamp":1735626127000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10806992\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11,24]]},"references-count":33,"URL":"https:\/\/doi.org\/10.1109\/itw61385.2024.10806992","relation":{},"subject":[],"published":{"date-parts":[[2024,11,24]]}}}