{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T22:29:10Z","timestamp":1783636150651,"version":"3.55.0"},"reference-count":48,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"11","license":[{"start":{"date-parts":[[2022,11,1]],"date-time":"2022-11-01T00:00:00Z","timestamp":1667260800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,11,1]],"date-time":"2022-11-01T00:00:00Z","timestamp":1667260800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,11,1]],"date-time":"2022-11-01T00:00:00Z","timestamp":1667260800000},"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":["IEEE Trans. Neural Netw. Learning Syst."],"published-print":{"date-parts":[[2022,11]]},"DOI":"10.1109\/tnnls.2021.3072238","type":"journal-article","created":{"date-parts":[[2021,6,23]],"date-time":"2021-06-23T19:28:40Z","timestamp":1624476520000},"page":"6103-6115","source":"Crossref","is-referenced-by-count":142,"title":["Privacy-Preserving Asynchronous Vertical Federated Learning Algorithms for Multiparty Collaborative Learning"],"prefix":"10.1109","volume":"33","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8653-1117","authenticated-orcid":false,"given":"Bin","family":"Gu","sequence":"first","affiliation":[{"name":"Department of Machine Learning, Mohamed bin Zayed University of Artificial Intelligence, Abu Dhabi, United Arab Emirates"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7480-5010","authenticated-orcid":false,"given":"An","family":"Xu","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, University of Pittsburgh, Pittsburgh, PA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhouyuan","family":"Huo","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, University of Pittsburgh, Pittsburgh, PA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2620-3247","authenticated-orcid":false,"given":"Cheng","family":"Deng","sequence":"additional","affiliation":[{"name":"School of Electronic Engineering, Xidian University, Xi’an, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3483-8333","authenticated-orcid":false,"given":"Heng","family":"Huang","sequence":"additional","affiliation":[{"name":"JD Finance America Corporation, Mountain View, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/3298981"},{"key":"ref2","volume-title":"Regulation (EU) 2016\/679 of the European Parliament and of the Council on the Protection of Natural Persons With Regard to the Processing of Personal Data and on the Free Movement of Such Data, and Repealing Directive 95\/46\/EC (General Data Protection Regulation)","year":"2016"},{"key":"ref3","volume-title":"Facebook to contact 87 million users affected by data breach","author":"Badshah","year":"2018"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ACSAC.2001.991526"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1515\/popets-2017-0053"},{"issue":"1","key":"ref6","first-page":"125","article-title":"Privacy-preserving analysis of vertically partitioned data using secure matrix products","volume":"25","author":"Karr","year":"2009","journal-title":"J. Off. Statist."},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/1014052.1014139"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1515\/popets-2017-0053"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/775047.775142"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956776"},{"key":"ref11","article-title":"Private federated learning on vertically partitioned data via entity resolution and additively homomorphic encryption","volume-title":"arXiv:1711.10677","author":"Hardy","year":"2017"},{"key":"ref12","article-title":"Entity resolution and federated learning get a federated resolution","volume-title":"arXiv:1803.04035","author":"Nock","year":"2018"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/MIS.2021.3082561"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TBDATA.2020.2992755"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/11731139_74"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/1281192.1281275"},{"key":"ref17","article-title":"Feature-distributed SVRG for high-dimensional linear classification","volume-title":"arXiv:1802.03604","author":"Zhang","year":"2018"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-7908-2604-3_16"},{"key":"ref19","first-page":"1807","article-title":"Faster derivative-free stochastic algorithm for shared memory machines","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Gu"},{"key":"ref20","first-page":"1646","article-title":"SAGA: A fast incremental gradient method with support for non-strongly convex composite objectives","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Defazio"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-016-1030-6"},{"key":"ref22","first-page":"689","article-title":"Spider: Near-optimal non-convex optimization via stochastic path-integrated differential estimator","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Fang"},{"key":"ref23","article-title":"ProxSARAH: An efficient algorithmic framework for stochastic composite nonconvex optimization","volume-title":"arXiv:1902.05679","author":"Pham","year":"2019"},{"key":"ref24","volume-title":"Deep Learning","volume":"1","author":"Goodfellow","year":"2016"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v30i1.10305"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1137\/16m1057000"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v31i1.10940"},{"key":"ref28","first-page":"46","article-title":"ASAGA: Asynchronous parallel saga","volume-title":"Proc. 20th Int. Conf. Artif. Intell. Statist. (AISTATS)","author":"Leblond"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v31i1.10910"},{"key":"ref30","article-title":"Asynchronous stochastic block coordinate descent with variance reduction","volume-title":"arXiv:1610.09447","author":"Gu","year":"2016"},{"key":"ref31","first-page":"56","article-title":"Breaking the nonsmooth barrier: A scalable parallel method for composite optimization","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Pedregosa"},{"key":"ref32","article-title":"Nonconvex sparse learning via stochastic optimization with progressive variance reduction","volume-title":"arXiv:1605.02711","author":"Li","year":"2016"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i9.16999"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330765"},{"key":"ref35","first-page":"246","article-title":"Fast, exact model selection and permutation testing for l2-regularized logistic regression","volume-title":"Proc. Artif. Intell. Statist.","author":"Conroy"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1534\/genetics.112.146720"},{"issue":"3","key":"ref37","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1023\/A:1018628609742","article-title":"Least squares support vector machine classifiers","volume":"9","author":"Suykens","year":"1999","journal-title":"Neural Process. Lett."},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1137\/140961791"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1137\/120887679"},{"issue":"1","key":"ref40","first-page":"184:1","article-title":"On faster convergence of cyclic block coordinate descent-type methods for strongly convex minimization","volume":"18","author":"Li","year":"2017","journal-title":"J. Mach. Learn. Res."},{"key":"ref41","first-page":"491","article-title":"An improved convergence analysis of cyclic block coordinate descent-type methods for strongly convex minimization","volume-title":"Proc. 19th Int. Conf. Artif. Intell. Statist. (AISTATS)","author":"Li"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1137\/100802001"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1007\/11752578_29"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.21105\/joss.00026"},{"key":"ref45","article-title":"Boosting privately: Privacy-preserving federated extreme boosting for mobile crowdsensing","volume":"abs\/1907.10218","author":"Liu","year":"2019","journal-title":"CoRR"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2021.3053220"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2019.8737416"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1145\/1961189.1961199"}],"container-title":["IEEE Transactions on Neural Networks and Learning Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/5962385\/9931397\/09463409.pdf?arnumber=9463409","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,11]],"date-time":"2024-01-11T22:23:26Z","timestamp":1705011806000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9463409\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11]]},"references-count":48,"journal-issue":{"issue":"11"},"URL":"https:\/\/doi.org\/10.1109\/tnnls.2021.3072238","relation":{},"ISSN":["2162-237X","2162-2388"],"issn-type":[{"value":"2162-237X","type":"print"},{"value":"2162-2388","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,11]]}}}