{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T21:58:04Z","timestamp":1768341484526,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":30,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,10,11]],"date-time":"2020-10-11T00:00:00Z","timestamp":1602374400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,10,11]]},"DOI":"10.1145\/3397166.3409123","type":"proceedings-article","created":{"date-parts":[[2020,10,8]],"date-time":"2020-10-08T02:02:42Z","timestamp":1602122562000},"page":"261-270","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":16,"title":["Private and communication-efficient edge learning"],"prefix":"10.1145","author":[{"given":"Xin","family":"Zhang","sequence":"first","affiliation":[{"name":"Iowa State University"}]},{"given":"Minghong","family":"Fang","sequence":"additional","affiliation":[{"name":"Iowa State University"}]},{"given":"Jia","family":"Liu","sequence":"additional","affiliation":[{"name":"Iowa State University"}]},{"given":"Zhengyuan","family":"Zhu","sequence":"additional","affiliation":[{"name":"Iowa State University"}]}],"member":"320","published-online":{"date-parts":[[2020,10,11]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"6343","volume-title":"Distributed learning without distress: Privacy-preserving empirical risk minimization,\" in Advances in Neural Information Processing Systems","author":"Jayaraman B.","year":"2018"},{"key":"e_1_3_2_1_2_1","volume-title":"Leasgd: an efficient and privacy-preserving decentralized algorithm for distributed learning,\" arXiv preprint arXiv:1811.11124","author":"Cheng H.-P.","year":"2018"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2018.2855169"},{"key":"e_1_3_2_1_4_1","first-page":"308","volume-title":"ACM","author":"Abadi M.","year":"2016"},{"key":"e_1_3_2_1_5_1","volume-title":"Dp-lssgd: A stochastic optimization method to lift the utility in privacy-preserving erm","author":"Wang B.","year":"2019"},{"key":"e_1_3_2_1_6_1","volume-title":"Efficient private erm for smooth objectives,\" arXiv preprint arXiv:1703.09947","author":"Zhang J.","year":"2017"},{"key":"e_1_3_2_1_7_1","first-page":"7652","volume-title":"Communication compression for decentralized training,\" in Advances in Neural Information Processing Systems","author":"Tang H.","year":"2018"},{"key":"e_1_3_2_1_8_1","first-page":"4447","author":"Stich S. U.","year":"2018","journal-title":"\"Sparsified sgd with memory,\" in Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_1_9_1","first-page":"1299","volume-title":"Gradient sparsification for communication-efficient distributed optimization,\" in Advances in Neural Information Processing Systems","author":"Wangni J.","year":"2018"},{"key":"e_1_3_2_1_10_1","volume-title":"Robust and communication-efficient collaborative learning,\" arXiv preprint arXiv:1907.10595","author":"Reisizadeh A.","year":"2019"},{"key":"e_1_3_2_1_11_1","first-page":"2431","volume-title":"IEEE","author":"Zhang X.","year":"2019"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2019.2932876"},{"key":"e_1_3_2_1_13_1","first-page":"2777","volume-title":"IEEE","author":"Liu Y.","year":"2018"},{"key":"e_1_3_2_1_14_1","first-page":"3409","volume-title":"IEEE","author":"Ding T.","year":"2018"},{"key":"e_1_3_2_1_15_1","first-page":"5330","volume-title":"Can decentralized algorithms outperform centralized algorithms? a case study for decentralized parallel stochastic gradient descent,\" in Advances in Neural Information Processing Systems","author":"Lian X.","year":"2017"},{"key":"e_1_3_2_1_16_1","first-page":"7564","author":"Agarwal N.","year":"2018","journal-title":"Advances in Neural Information Processing Systems"},{"issue":"3","key":"e_1_3_2_1_17_1","first-page":"4","volume":"9","author":"Dwork C.","year":"2014","journal-title":"Foundations and Trends\u00ae in Theoretical Computer Science"},{"key":"e_1_3_2_1_18_1","first-page":"265","volume-title":"Calibrating noise to sensitivity in private data analysis,\" in Theory of cryptography conference","author":"Dwork C.","year":"2006"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2008.2009515"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1137\/130943170"},{"issue":"4","key":"e_1_3_2_1_21_1","first-page":"2341","volume":"23","author":"Ghadimi S.","year":"2013","journal-title":"\"Stochastic first-and zeroth-order methods for nonconvex stochastic programming,\" SIAM Journal on Optimization"},{"key":"e_1_3_2_1_22_1","first-page":"2737","volume-title":"Asynchronous parallel stochastic gradient for nonconvex optimization,\" in Advances in Neural Information Processing Systems","author":"Lian X.","year":"2015"},{"key":"e_1_3_2_1_23_1","volume-title":"Using randomized response for differential privacy preserving data collection.\" in EDBT\/ICDT Workshops","author":"Wang Y.","year":"2016"},{"key":"e_1_3_2_1_24_1","first-page":"381","volume-title":"ACM","author":"Dwork C.","year":"2009"},{"key":"e_1_3_2_1_25_1","first-page":"765","volume-title":"ACM","author":"Roth A.","year":"2010"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.14778\/3055330.3055331"},{"key":"e_1_3_2_1_27_1","volume-title":"Subsampled r\u00e9nyi differential privacy and analytical moments accountant,\" arXiv preprint arXiv:1808.00087","author":"Wang Y.-X.","year":"2018"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2018.2818081"},{"key":"e_1_3_2_1_29_1","first-page":"5904","volume-title":"Collaborative deep learning in fixed topology networks,\" in Advances in Neural Information Processing Systems","author":"Jiang Z.","year":"2017"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/CSF.2017.11"}],"event":{"name":"Mobihoc '20: The Twenty-first ACM International Symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile Computing","location":"Virtual Event USA","acronym":"Mobihoc '20","sponsor":["SIGMOBILE ACM Special Interest Group on Mobility of Systems, Users, Data and Computing"]},"container-title":["Proceedings of the Twenty-First International Symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3397166.3409123","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3397166.3409123","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:41:25Z","timestamp":1750200085000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3397166.3409123"}},"subtitle":["a sparse differential gaussian-masking distributed SGD approach"],"short-title":[],"issued":{"date-parts":[[2020,10,11]]},"references-count":30,"alternative-id":["10.1145\/3397166.3409123","10.1145\/3397166"],"URL":"https:\/\/doi.org\/10.1145\/3397166.3409123","relation":{},"subject":[],"published":{"date-parts":[[2020,10,11]]},"assertion":[{"value":"2020-10-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}