{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T05:53:32Z","timestamp":1778824412229,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":34,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,8,13]],"date-time":"2017-08-13T00:00:00Z","timestamp":1502582400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["N00014-14-1-0631, N00014-17-1-2265"],"award-info":[{"award-number":["N00014-14-1-0631, N00014-17-1-2265"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["IIS-1565596, IIS-1615597"],"award-info":[{"award-number":["IIS-1565596, IIS-1615597"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,8,13]]},"DOI":"10.1145\/3097983.3098152","type":"proceedings-article","created":{"date-parts":[[2017,8,4]],"date-time":"2017-08-04T18:35:54Z","timestamp":1501871754000},"page":"1195-1204","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":40,"title":["Privacy-Preserving Distributed Multi-Task Learning with Asynchronous Updates"],"prefix":"10.1145","author":[{"given":"Liyang","family":"Xie","sequence":"first","affiliation":[{"name":"Michigan State University, East Lansing, MI, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Inci M.","family":"Baytas","sequence":"additional","affiliation":[{"name":"Michigan State University, East Lansing, MI, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kaixiang","family":"Lin","sequence":"additional","affiliation":[{"name":"Michigan State University, East Lansing, MI, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiayu","family":"Zhou","sequence":"additional","affiliation":[{"name":"Michigan State University, East Lansing, MI, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2017,8,13]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/1046920.1194905"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-007-5040-8"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2007.4286571"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2016.0012"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1137\/080716542"},{"key":"e_1_3_2_1_6_1","volume-title":"Shiva Prasad Kasiviswanathan, and Kobbi Nissim","author":"Beimel Amos","year":"2010","unstructured":"Amos Beimel , Shiva Prasad Kasiviswanathan, and Kobbi Nissim . 2010 . Bounds on the sample complexity for private learning and private data release Theory of Cryptography Conference. Springer , 437--454. Amos Beimel, Shiva Prasad Kasiviswanathan, and Kobbi Nissim. 2010. Bounds on the sample complexity for private learning and private data release Theory of Cryptography Conference. Springer, 437--454."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-013-0701-9"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-5529-2_5"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/1953048.2021036"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/2567709.2567754"},{"key":"e_1_3_2_1_11_1","volume-title":"A convex formulation for learning shared structures from multiple tasks Proceedings of the 26th Annual International Conference on Machine Learning. ACM, 137--144","author":"Chen Jianhui","unstructured":"Jianhui Chen , Lei Tang , Jun Liu , and Jieping Ye. 2009. A convex formulation for learning shared structures from multiple tasks Proceedings of the 26th Annual International Conference on Machine Learning. ACM, 137--144 . Jianhui Chen, Lei Tang, Jun Liu, and Jieping Ye. 2009. A convex formulation for learning shared structures from multiple tasks Proceedings of the 26th Annual International Conference on Machine Learning. ACM, 137--144."},{"key":"e_1_3_2_1_12_1","volume-title":"Integrating low-rank and group-sparse structures for robust multi-task learning Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining. ACM, 42--50","author":"Chen Jianhui","unstructured":"Jianhui Chen , Jiayu Zhou , and Jieping Ye 2011. Integrating low-rank and group-sparse structures for robust multi-task learning Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining. ACM, 42--50 . Jianhui Chen, Jiayu Zhou, and Jieping Ye 2011. Integrating low-rank and group-sparse structures for robust multi-task learning Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining. ACM, 42--50."},{"key":"e_1_3_2_1_13_1","volume-title":"The Asynchronous PALM Algorithm for Nonsmooth Nonconvex Problems. arXiv preprint arXiv:1604.00526","author":"Davis Damek","year":"2016","unstructured":"Damek Davis . 2016. The Asynchronous PALM Algorithm for Nonsmooth Nonconvex Problems. arXiv preprint arXiv:1604.00526 ( 2016 ). Damek Davis. 2016. The Asynchronous PALM Algorithm for Nonsmooth Nonconvex Problems. arXiv preprint arXiv:1604.00526 (2016)."},{"key":"e_1_3_2_1_14_1","volume-title":"The Sound of APALM Clapping: Faster Nonsmooth Nonconvex Optimization with Stochastic Asynchronous PALM. arXiv preprint arXiv:1606.02338","author":"Davis Damek","year":"2016","unstructured":"Damek Davis , Brent Edmunds , and Madeleine Udell . 2016. The Sound of APALM Clapping: Faster Nonsmooth Nonconvex Optimization with Stochastic Asynchronous PALM. arXiv preprint arXiv:1606.02338 ( 2016 ). Damek Davis, Brent Edmunds, and Madeleine Udell. 2016. The Sound of APALM Clapping: Faster Nonsmooth Nonconvex Optimization with Stochastic Asynchronous PALM. arXiv preprint arXiv:1606.02338 (2016)."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNN.2010.2095882"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/11787006_1"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-78478-4_1"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/11681878_14"},{"key":"e_1_3_2_1_19_1","first-page":"3","article-title":"The algorithmic foundations of differential privacy","volume":"9","author":"Dwork Cynthia","year":"2013","unstructured":"Cynthia Dwork and Aaron Roth 2013 . The algorithmic foundations of differential privacy . Theoretical Computer Science Vol. 9 , 3 -- 4 (2013), 211--407. Cynthia Dwork and Aaron Roth 2013. The algorithmic foundations of differential privacy. Theoretical Computer Science Vol. 9, 3--4 (2013), 211--407.","journal-title":"Theoretical Computer Science"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.12"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1014052.1014067"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835868"},{"key":"e_1_3_2_1_23_1","volume-title":"Matrix computations","author":"Golub Gene H","unstructured":"Gene H Golub and Charles F Van Loan 2012. Matrix computations . Vol. Vol. 3 . JHU Press . Gene H Golub and Charles F Van Loan 2012. Matrix computations. Vol. Vol. 3. JHU Press."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2339530.2339672"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-31863-9_8"},{"key":"e_1_3_2_1_26_1","volume-title":"Proceedings of the 30th International Conference on Machine Learning (ICML-13)","author":"Jain Prateek","year":"2013","unstructured":"Prateek Jain and Abhradeep Thakurta 2013 . Differentially private learning with kernels . In Proceedings of the 30th International Conference on Machine Learning (ICML-13) . 118--126. Prateek Jain and Abhradeep Thakurta 2013. Differentially private learning with kernels. In Proceedings of the 30th International Conference on Machine Learning (ICML-13). 118--126."},{"key":"e_1_3_2_1_27_1","unstructured":"Ali Jalali Sujay Sanghavi Chao Ruan and Pradeep K Ravikumar 2010. A dirty model for multi-task learning. In Advances in Neural Information Processing Systems. 964--972. Ali Jalali Sujay Sanghavi Chao Ruan and Pradeep K Ravikumar 2010. A dirty model for multi-task learning. In Advances in Neural Information Processing Systems. 964--972."},{"key":"e_1_3_2_1_28_1","volume-title":"An accelerated gradient method for trace norm minimization Proceedings of the 26th annual international conference on machine learning. ACM, 457--464","author":"Ji Shuiwang","unstructured":"Shuiwang Ji and Jieping Ye 2009. An accelerated gradient method for trace norm minimization Proceedings of the 26th annual international conference on machine learning. ACM, 457--464 . Shuiwang Ji and Jieping Ye 2009. An accelerated gradient method for trace norm minimization Proceedings of the 26th annual international conference on machine learning. ACM, 457--464."},{"key":"e_1_3_2_1_29_1","volume-title":"Collaborating between Local and Global Learning for Distributed Online Multiple Tasks Proceedings of the 24th ACM International on Conference on Information and Knowledge Management. ACM, 113--122","author":"Jin Xin","unstructured":"Xin Jin , Ping Luo , Fuzhen Zhuang , Jia He , and Qing He 2015. Collaborating between Local and Global Learning for Distributed Online Multiple Tasks Proceedings of the 24th ACM International on Conference on Information and Knowledge Management. ACM, 113--122 . Xin Jin, Ping Luo, Fuzhen Zhuang, Jia He, and Qing He 2015. Collaborating between Local and Global Learning for Distributed Online Multiple Tasks Proceedings of the 24th ACM International on Conference on Information and Knowledge Management. ACM, 113--122."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.29012\/jpc.v6i1.634"},{"key":"e_1_3_2_1_31_1","unstructured":"Seyoung Kim and Eric P Xing 2010. Tree-guided group lasso for multi-task regression with structured sparsity. (2010). Seyoung Kim and Eric P Xing 2010. Tree-guided group lasso for multi-task regression with structured sparsity. (2010)."},{"key":"e_1_3_2_1_32_1","unstructured":"Matt J Kusner Jacob R Gardner Roman Garnett and Kilian Q Weinberger 2015. Differentially Private Bayesian Optimization.. In ICML. 918--927. Matt J Kusner Jacob R Gardner Roman Garnett and Kilian Q Weinberger 2015. Differentially Private Bayesian Optimization.. In ICML. 918--927."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"crossref","unstructured":"Chao Li Michael Hay Vibhor Rastogi Gerome Miklau and Andrew McGregor 2010. Optimizing linear counting queries under differential privacy Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems. ACM 123--134. Chao Li Michael Hay Vibhor Rastogi Gerome Miklau and Andrew McGregor 2010. Optimizing linear counting queries under differential privacy Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems. ACM 123--134.","DOI":"10.1145\/1807085.1807104"},{"key":"e_1_3_2_1_34_1","volume-title":"Sinno Jialin Pan, and Qirong Ho","author":"Liu Sulin","year":"2016","unstructured":"Sulin Liu , Sinno Jialin Pan, and Qirong Ho 2016 . Distributed Multi-task Relationship Learning . (2016). Sulin Liu, Sinno Jialin Pan, and Qirong Ho 2016. Distributed Multi-task Relationship Learning. (2016)."}],"event":{"name":"KDD '17: The 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","location":"Halifax NS Canada","acronym":"KDD '17","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"]},"container-title":["Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3097983.3098152","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3097983.3098152","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3097983.3098152","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,24]],"date-time":"2025-06-24T20:37:56Z","timestamp":1750797476000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3097983.3098152"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,8,13]]},"references-count":34,"alternative-id":["10.1145\/3097983.3098152","10.1145\/3097983"],"URL":"https:\/\/doi.org\/10.1145\/3097983.3098152","relation":{},"subject":[],"published":{"date-parts":[[2017,8,13]]},"assertion":[{"value":"2017-08-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}