{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:38:32Z","timestamp":1773376712461,"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.10619154","type":"proceedings-article","created":{"date-parts":[[2024,8,19]],"date-time":"2024-08-19T13:25:01Z","timestamp":1724073901000},"page":"593-598","source":"Crossref","is-referenced-by-count":0,"title":["Optimal Private Discrete Distribution Estimation with One-Bit Communication"],"prefix":"10.1109","author":[{"given":"Seung-Hyun","family":"Nam","sequence":"first","affiliation":[{"name":"School of Electrical Engineering, KAIST,Daejeon,South Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vincent Y.","family":"F. Tan","sequence":"additional","affiliation":[{"name":"National University of Singapore,Department of ECE, Department of Mathematics,Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Si-Hyeon","family":"Lee","sequence":"additional","affiliation":[{"name":"School of Electrical Engineering, KAIST,Daejeon,South Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/tifs.2024.3419721"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1137\/090756090"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2012.6483382"},{"key":"ref4","author":"Duchi","year":"2014","journal-title":"Local privacy, data processing inequalities, and statistical minimax rates"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2013.2253320"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1561\/0400000042"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/2660267.2660348"},{"key":"ref8","article-title":"Extremal mechanisms for local differential privacy","volume":"27","author":"Kairouz","year":"2014","journal-title":"Advances in neural information processing systems"},{"key":"ref9","first-page":"2436","article-title":"Discrete distribution estimation under local privacy","volume-title":"Proceedings of The 33rd International Conference on Machine Learning, ser. Proceedings of Machine Learning Research","volume":"48","author":"Kairouz","year":"2016"},{"key":"ref10","author":"Bhowmick","year":"2018","journal-title":"Protection against reconstruction and its applications in private federated learning"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2809790"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2865558"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2962804"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2935768"},{"key":"ref15","first-page":"1120","article-title":"Hadamard response: Estimating distributions privately, efficiently, and with little communication","volume-title":"Proc. 22nd Int. Conf. Artificial Intelligence and Statistics, ser. Proceedings of Machine Learning Research","volume":"89","author":"Acharya","year":"2019"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2020.3039461"},{"key":"ref17","first-page":"89","article-title":"Tight analysis of privacy and utility trade-off in approximate differential privacy","volume-title":"Proceedings of the Twenty Third International Conference on Artificial Intelligence and Statistics, ser. Proceedings of Machine Learning Research","volume":"108","author":"Geng"},{"key":"ref18","first-page":"6418","article-title":"Private frequency estimation via projective geometry","volume-title":"Proc. 39th Int. Conf. Machine Learning, ser. Proceedings of Machine Learning Research","volume":"162","author":"Feldman","year":"2022"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT54713.2023.10206918"},{"key":"ref20","author":"Ye","year":"2017","journal-title":"Asymptotically optimal private estimation under mean square loss"},{"key":"ref21","first-page":"7680","article-title":"Optimal compression of locally differentially private mechanisms","volume-title":"Proceedings of The 25th International Conference on Artificial Intelligence and Statistics, ser. Proceedings of Machine Learning Research","volume":"151","author":"Shah"},{"key":"ref22","first-page":"37761","article-title":"Exact optimality of communication-privacy-utility trade-offs in distributed mean estimation","volume-title":"Advances in Neural Information Processing Systems","volume":"36","author":"Isik","year":"2023"},{"key":"ref23","first-page":"51","article-title":"Communication complexity in locally private distribution estimation and heavy hitters","volume-title":"International Conference on Machine Learning","author":"Acharya","year":"2019"},{"key":"ref24","first-page":"3229","article-title":"Simple binary hypothesis testing under local differential privacy and communication constraints","volume-title":"Proceedings of Thirty Sixth Conference on Learning Theory, ser. Proceedings of Machine Learning Research","volume":"195","author":"Pensia","year":"2023"},{"key":"ref25","first-page":"79","article-title":"Estimating sparse discrete distributions under privacy and communication constraints","volume-title":"Proceedings of the 32nd International Conference on Algorithmic Learning Theory, ser. Proceedings of Machine Learning Research","volume":"132","author":"Acharya"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/tit.2022.3218772"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2022.3205276"},{"key":"ref28","author":"Nam","year":"2023","journal-title":"Achieving the exactly optimal privacy-utility trade-off with low communication cost via shared randomness"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-1166-2"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4899-0027-2"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511802256"},{"issue":"1","key":"ref32","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":"ref33","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2017.08.011"}],"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\/10619154.pdf?arnumber=10619154","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:27:51Z","timestamp":1773347271000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10619154\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,7]]},"references-count":33,"URL":"https:\/\/doi.org\/10.1109\/isit57864.2024.10619154","relation":{},"subject":[],"published":{"date-parts":[[2024,7,7]]}}}