{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T01:35:33Z","timestamp":1740101733737,"version":"3.37.3"},"reference-count":24,"publisher":"IEEE","license":[{"start":{"date-parts":[[2023,3,22]],"date-time":"2023-03-22T00:00:00Z","timestamp":1679443200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,3,22]],"date-time":"2023-03-22T00:00:00Z","timestamp":1679443200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1907658,OAC-1940074,CNS-2148104"],"award-info":[{"award-number":["CCF-1907658,OAC-1940074,CNS-2148104"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023,3,22]]},"DOI":"10.1109\/ciss56502.2023.10089668","type":"proceedings-article","created":{"date-parts":[[2023,4,10]],"date-time":"2023-04-10T18:58:36Z","timestamp":1681153116000},"page":"1-6","source":"Crossref","is-referenced-by-count":0,"title":["C-DIEGO: An Algorithm with Near-Optimal Sample Complexity for Distributed, Streaming PCA"],"prefix":"10.1109","author":[{"given":"Muhammad","family":"Zulqarnain","sequence":"first","affiliation":[{"name":"Rutgers University,Department of Electrical and Computer Engineering,New Brunswick,NJ,USA,08854"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arpita","family":"Gang","sequence":"additional","affiliation":[{"name":"Rutgers University,Department of Electrical and Computer Engineering,New Brunswick,NJ,USA,08854"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Waheed U.","family":"Bajwa","sequence":"additional","affiliation":[{"name":"Rutgers University,Department of Electrical and Computer Engineering,New Brunswick,NJ,USA,08854"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"doi-asserted-by":"publisher","key":"ref1","DOI":"10.1037\/h0071325"},{"key":"ref2","first-page":"50","article-title":"Method of stochastic approximation in the determination of the largest eigenvalue of the mathematical expectation of random matrices","author":"Krasulina","year":"1970","journal-title":"Automatation and Remote Control"},{"doi-asserted-by":"publisher","key":"ref3","DOI":"10.1007\/BF00275687"},{"key":"ref4","article-title":"The fast convergence of incremental PCA","volume-title":"Proc. Advances in Neural Information Processing Systems","author":"Balsubramani","year":"2013"},{"key":"ref5","first-page":"1147","article-title":"Streaming PCA: Matching matrix Bernstein and near-optimal finite sample guarantees for Ojas algorithm","volume-title":"Proc. Conference on Learning Theory","author":"Jain","year":"2016"},{"key":"ref6","article-title":"Distributed stochastic algorithms for high-rate streaming principal component analysis","author":"Raja","year":"2022","journal-title":"Transactions on Machine Learning Research"},{"volume-title":"Representation learning in distributed networks","year":"2022","author":"Gang","key":"ref7"},{"doi-asserted-by":"publisher","key":"ref8","DOI":"10.1007\/978-3-540-30218-6_19"},{"doi-asserted-by":"publisher","key":"ref9","DOI":"10.4324\/9781410612403"},{"doi-asserted-by":"publisher","key":"ref10","DOI":"10.1016\/0893-6080(89)90044-0"},{"key":"ref11","first-page":"144","article-title":"A stochastic PCA and SVD algorithm with an exponential convergence rate","volume-title":"Proc. International Conference on Machine Learning","author":"Shamir","year":"2015"},{"key":"ref12","first-page":"58","article-title":"Accelerated stochastic power iteration","volume-title":"Proc. International Conference on Artificial Intelligence and Statistics","author":"Xu","year":"2018"},{"doi-asserted-by":"publisher","key":"ref13","DOI":"10.1109\/JPROC.2018.2846568"},{"doi-asserted-by":"publisher","key":"ref14","DOI":"10.1109\/JSTSP.2011.2118742"},{"doi-asserted-by":"publisher","key":"ref15","DOI":"10.1109\/Allerton.2013.6736701"},{"doi-asserted-by":"publisher","key":"ref16","DOI":"10.1109\/TSP.2015.2472372"},{"doi-asserted-by":"publisher","key":"ref17","DOI":"10.1109\/TSIPN.2021.3122297"},{"key":"ref18","first-page":"1","article-title":"DeEPCA: Decentralized Exact PCA with linear convergence rate","author":"Ye","year":"2021","journal-title":"J. Mach. Learn. Res."},{"doi-asserted-by":"publisher","key":"ref19","DOI":"10.1109\/TSP.2022.3229635"},{"doi-asserted-by":"publisher","key":"ref20","DOI":"10.1016\/j.sigpro.2021.108408"},{"year":"2004","author":"Boyd","journal-title":"Gossip and mixing times of random walks on random graphs","key":"ref21"},{"doi-asserted-by":"publisher","key":"ref22","DOI":"10.1016\/j.jcss.2007.04.014"},{"doi-asserted-by":"publisher","key":"ref23","DOI":"10.1137\/S0036144503423264"},{"doi-asserted-by":"publisher","key":"ref24","DOI":"10.1109\/MSP.2012.2211477"}],"event":{"name":"2023 57th Annual Conference on Information Sciences and Systems (CISS)","start":{"date-parts":[[2023,3,22]]},"location":"Baltimore, MD, USA","end":{"date-parts":[[2023,3,24]]}},"container-title":["2023 57th Annual Conference on Information Sciences and Systems (CISS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10089615\/10089616\/10089668.pdf?arnumber=10089668","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,3]],"date-time":"2024-03-03T11:10:08Z","timestamp":1709464208000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10089668\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3,22]]},"references-count":24,"URL":"https:\/\/doi.org\/10.1109\/ciss56502.2023.10089668","relation":{},"subject":[],"published":{"date-parts":[[2023,3,22]]}}}