{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T18:31:04Z","timestamp":1772044264770,"version":"3.50.1"},"reference-count":65,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61876220"],"award-info":[{"award-number":["61876220"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61876221"],"award-info":[{"award-number":["61876221"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61976164"],"award-info":[{"award-number":["61976164"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62036006"],"award-info":[{"award-number":["62036006"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012659","name":"Foundation for Innovative Research Groups of the National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61621005"],"award-info":[{"award-number":["61621005"]}],"id":[{"id":"10.13039\/501100012659","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Major Research Plan of the National Natural Science Foundation of China","award":["91438201"],"award-info":[{"award-number":["91438201"]}]},{"name":"Major Research Plan of the National Natural Science Foundation of China","award":["91438103"],"award-info":[{"award-number":["91438103"]}]},{"name":"Program for Cheung Kong Scholars and Innovative Research Team in University","award":["IRT_15R53"],"award-info":[{"award-number":["IRT_15R53"]}]},{"name":"Fund for Foreign Scholars in University Research and Teaching Programs","award":["B07048"],"award-info":[{"award-number":["B07048"]}]},{"name":"National Science Basic Research Plan in Shaanxi Province of China","award":["2020JM-194"],"award-info":[{"award-number":["2020JM-194"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans.Inform.Forensic Secur."],"published-print":{"date-parts":[[2021]]},"DOI":"10.1109\/tifs.2021.3113768","type":"journal-article","created":{"date-parts":[[2021,9,20]],"date-time":"2021-09-20T20:11:43Z","timestamp":1632168703000},"page":"4733-4745","source":"Crossref","is-referenced-by-count":19,"title":["Differentially Private ADMM Algorithms for Machine Learning"],"prefix":"10.1109","volume":"16","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1040-352X","authenticated-orcid":false,"given":"Fanhua","family":"Shang","sequence":"first","affiliation":[]},{"given":"Tao","family":"Xu","sequence":"additional","affiliation":[]},{"given":"Yuanyuan","family":"Liu","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8475-2749","authenticated-orcid":false,"given":"Hongying","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Longjie","family":"Shen","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0415-8556","authenticated-orcid":false,"given":"Maoguo","family":"Gong","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","first-page":"2037","article-title":"Renyi differentially private ERM for smooth objectives","author":"chen","year":"2019","journal-title":"Proc 22nd Int Conf Artif Intell Statist"},{"key":"ref38","first-page":"1069","article-title":"Differentially private empirical risk minimization","volume":"12","author":"chaudhuri","year":"2011","journal-title":"J Mach Learn Res"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1016\/S0893-6080(98)00116-6"},{"key":"ref32","first-page":"372","article-title":"A method of solving a convex programming problem with convergence rate O(1\/k²)","volume":"27","author":"nesterov","year":"1983","journal-title":"Sov Math Doklady"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2020\/431"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.12"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2007.367856"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1137\/120896219"},{"key":"ref35","article-title":"An overview of gradient descent optimization algorithms","author":"ruder","year":"2016","journal-title":"arXiv 1609 04747"},{"key":"ref34","author":"nesterov","year":"2014","journal-title":"Introductory Lectures on Convex Optimization A Basic Course"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2018.2878765"},{"key":"ref62","first-page":"473","article-title":"Personalized and private peer-to-peer machine learning","author":"bellet","year":"2018","journal-title":"Proc 21st Int Conf Artif Intell Statist"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1109\/BigData47090.2019.9005716"},{"key":"ref63","article-title":"DP-LSSGD: A stochastic optimization method to lift the utility in privacy-preserving ERM","author":"wang","year":"2019","journal-title":"arXiv 1906 12056"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2019.09.020"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2018.2855169"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/3374664.3375733"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-014-0826-5"},{"key":"ref29","first-page":"315","article-title":"Accelerating stochastic gradient descent using predictive variance reduction","author":"johnson","year":"2013","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref2","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1561\/0400000042","article-title":"The algorithmic foundations of differential privacy","volume":"9","author":"dwork","year":"2014","journal-title":"Found Trends Theor Comput Sci"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/11681878_14"},{"key":"ref20","article-title":"Efficient privacy-preserving stochastic nonconvex optimization","author":"wang","year":"2019","journal-title":"arXiv 1910 13659"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1214\/11-AOS878"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btp218"},{"key":"ref24","article-title":"Differentially private ADMM for convex distributed learning: Improved accuracy via multi-step approximation","author":"huang","year":"2020","journal-title":"arXiv 2005 07890"},{"key":"ref23","first-page":"80","article-title":"Stochastic alternating direction method of multipliers","author":"ouyang","year":"2013","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2020.3009007"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2019.2931068"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2020.3000512"},{"key":"ref51","first-page":"263","article-title":"Rényi differential privacy","author":"mironov","year":"2017","journal-title":"Proc IEEE 30th Comput Secur Found Symp (CSF)"},{"key":"ref59","first-page":"5975","article-title":"A simple stochastic variance reduced algorithm with fast convergence rates","author":"zhou","year":"2018","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref58","first-page":"485","article-title":"Model selection through sparse maximum likelihood estimation for multivariate Gaussian or binary data","volume":"9","author":"el ghaoui","year":"2008","journal-title":"J Mach Learn Res"},{"key":"ref57","article-title":"Loopless variance reduced stochastic ADMM for equality constrained problems in IoT applications","author":"liu","year":"2021","journal-title":"IEEE Internet of Things Journal"},{"key":"ref56","first-page":"620","article-title":"Towards an optimal stochastic alternating direction method of multipliers","author":"azadi","year":"2014","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref55","article-title":"Stochastic ADMM for nonsmooth optimization","author":"ouyang","year":"2012","journal-title":"arXiv 1211 0632"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2017.2748590"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1109\/18.382009"},{"key":"ref52","first-page":"2407","article-title":"Fast-and-light stochastic ADMM","author":"zheng","year":"2016","journal-title":"Proc Int Joint Conf Artif Intell"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.cose.2020.101951"},{"key":"ref11","first-page":"682","article-title":"Privacy of facial soft biometrics: Suppressing gender but retaining identity","author":"othman","year":"2014","journal-title":"Proc Eur Conf Comput Vis"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-67786-6_6"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/1851275.1851199"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2011.26"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/2660267.2660348"},{"key":"ref15","first-page":"1","article-title":"Learning with privacy at scale","volume":"1","year":"2017","journal-title":"Mach Learn Appl"},{"key":"ref16","first-page":"3571","article-title":"Collecting telemetry data privately","author":"ding","year":"2017","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3226070"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978318"},{"key":"ref19","first-page":"2722","article-title":"Differentially private empirical risk minimization revisited: Faster and more general","author":"wang","year":"2018","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref4","doi-asserted-by":"crossref","first-page":"627","DOI":"10.1145\/1557019.1557090","article-title":"Differentially private recommender systems: Building privacy into the Netflix prize contenders","author":"mcsherry","year":"2009","journal-title":"Proc ACM SIGKDD Conf Knowledge Discovery Data Mining"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/MCI.2020.2976185"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ASONAM.2013.6785787"},{"key":"ref5","first-page":"440","article-title":"Personalized social recommendations-accurate or private?","author":"machanavajjhala","year":"2011","journal-title":"Proc Int Conf On Very Large Data Bases"},{"key":"ref8","first-page":"152","article-title":"A practical application of differential privacy to personalized online advertising","author":"lindell","year":"2011","journal-title":"Proc IACR"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/WI-IAT.2013.12"},{"key":"ref49","first-page":"2287","article-title":"Accelerated variance reduced stochastic ADMM","author":"liu","year":"2017","journal-title":"Proc AAAI Conf Artif Intell"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/2320765.2320816"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2020.3029899"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2019.2939713"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1561\/2200000016"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1137\/14095697X"},{"key":"ref42","first-page":"1876","article-title":"Multiparty differential privacy via aggregation of locally trained classifiers","author":"pathak","year":"2010","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2017\/548"},{"key":"ref44","first-page":"1310","article-title":"Privacy-preserving deep learning","author":"shokri","year":"2015","journal-title":"Proc 53rd Annu Allerton Conf Commun Control Comput (Allerton)"},{"key":"ref43","first-page":"6346","article-title":"Distributed learning without distress: Privacy-preserving empirical risk minimization","author":"jayaraman","year":"2018","journal-title":"Proc Adv Neural Inf Process Syst"}],"container-title":["IEEE Transactions on Information Forensics and Security"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10206\/9151439\/09540875.pdf?arnumber=9540875","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,9]],"date-time":"2023-11-09T02:41:15Z","timestamp":1699497675000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9540875\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"references-count":65,"URL":"https:\/\/doi.org\/10.1109\/tifs.2021.3113768","relation":{},"ISSN":["1556-6013","1556-6021"],"issn-type":[{"value":"1556-6013","type":"print"},{"value":"1556-6021","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]}}}