{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T01:30:02Z","timestamp":1740101402965,"version":"3.37.3"},"reference-count":34,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,10,31]],"date-time":"2022-10-31T00:00:00Z","timestamp":1667174400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,10,31]],"date-time":"2022-10-31T00:00:00Z","timestamp":1667174400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000181","name":"Air Force Office of Scientific Research","doi-asserted-by":"publisher","award":["FA9550-20-1-0039"],"award-info":[{"award-number":["FA9550-20-1-0039"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,10,31]]},"DOI":"10.1109\/ieeeconf56349.2022.10051902","type":"proceedings-article","created":{"date-parts":[[2023,3,7]],"date-time":"2023-03-07T18:41:29Z","timestamp":1678214489000},"page":"1286-1290","source":"Crossref","is-referenced-by-count":0,"title":["Robust Stochastic Principal Component Analysis via Barron Loss"],"prefix":"10.1109","author":[{"given":"Mayur","family":"Dhanaraj","sequence":"first","affiliation":[{"name":"Rochester Institute of Technology,Dept. Electrical and Microelectronics Engineering,Rochester,NY"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Panos P.","family":"Markopoulos","sequence":"additional","affiliation":[{"name":"The University of Texas at San Antonio,Dept. of Elect. & Comput. Engineering and Comput. Science,San Antonio,TX"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-7566-5"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/BF00275687"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/0022-247X(85)90131-3"},{"key":"ref4","first-page":"3174","article-title":"The Fast Convergence of Incremental PCA","author":"Balsubramani","year":"2013","journal-title":"Adv. Neural Inf. Process. Syst. (NeurIPS)"},{"article-title":"Convergence of stochastic gradient descent for pca","volume-title":"Proc. Int. Conf. Mach. Learn. (ICML)","author":"Shamir","key":"ref5"},{"volume-title":"Outliers in statistical data","year":"1994","author":"Barnett","key":"ref6"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2019.00446"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177729586"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.1977.1101561"},{"key":"ref10","article-title":"AdaOja: Adaptive Learning Rates for Streaming PCA","author":"Henriksen","year":"2019","journal-title":"arXiv preprint"},{"key":"ref11","first-page":"144","article-title":"A Stochastic PCA and SVD algorithm with an Exponential Convergence Rate","volume-title":"Proc. Int. Conf. Mach. Learn. (ICML)","author":"Shamir"},{"key":"ref12","first-page":"248","article-title":"Fast stochastic algorithms for SVD and PCA: Convergence properties and convexity","volume-title":"Int. Conf. Mach. Learn. (ICML)","author":"Shamir"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2012.6483308"},{"key":"ref14","first-page":"1815","article-title":"Stochastic Optimization of PCA with Capped MSG","author":"Arora","year":"2013","journal-title":"Adv. Neural Inf. Process. Syst. (NeurIPS)"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/0041-5553(69)90135-9"},{"key":"ref16","article-title":"Exponentially convergent stochastic k-pca without variance reduction","volume":"32","author":"Tang","year":"2019","journal-title":"Adv. Neural Inf. Process. Syst. (NeurIPS)"},{"key":"ref17","first-page":"58","article-title":"Accelerated Stochastic Power Iteration","volume-title":"Proc. Mach. Learn. Res. (PMLR","volume":"84","author":"De Sa","year":"2018"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-017-1182-z"},{"key":"ref19","article-title":"Dimensionality reduction for stationary time series via stochastic nonconvex optimization","volume":"31","author":"Chen","year":"2018","journal-title":"Adv. Neural Inf. Process. Syst. (NeurIPS)"},{"key":"ref20","article-title":"Adagrad stepsizes: Sharp convergence over nonconvex landscapes, from any initialization","author":"Ward","year":"2018","journal-title":"arXiv preprint"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-13709-0_19"},{"key":"ref22","article-title":"History pca: A new algorithm for streaming pca","author":"Yang","year":"2018","journal-title":"arXiv preprint"},{"key":"ref23","first-page":"2886","article-title":"Memory Limited, Streaming. PCA","author":"Mitliagkas","year":"2013","journal-title":"Adv. Neural Inf. Process. Syst. (NeurIPS)"},{"key":"ref24","first-page":"2861","article-title":"The Noisy Power Method: A Meta Algorithm with Applications","author":"Hardt","year":"2014","journal-title":"Adv. Neural Inf. Process. Syst. (NeurIPS)"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2006.07.012"},{"key":"ref26","first-page":"473","article-title":"Rivalry of two families of algorithms for memory-restricted streaming pea","volume-title":"Proc. Artificial Intell. Statist. (AISTATS)","author":"Li"},{"key":"ref27","first-page":"284","article-title":"An improved gap-dependency analysis of the noisy power method","volume-title":"Proc. Conf. Learn. Theory (COLT)","author":"Balcan"},{"key":"ref28","first-page":"4302","article-title":"Stochastic variance-reduced algorithms for pea with arbitrary mini-batch sizes","volume-title":"Proc. Artificial Intell. Statist. (AISTATS)","author":"Kim","year":"2020"},{"key":"ref29","first-page":"7014","article-title":"On the equivalence of Ojas algorithm and GROUSE","volume-title":"Proc. Artificial Intell. Statist. (AISTATS), Virtual only","author":"Balzano","year":"2022"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2010.5706976"},{"key":"ref31","first-page":"266","article-title":"Robust Stochastic Principal Component Analysis","volume-title":"Proc. Artificial Intell. Statist. (AISTATS)","author":"Goes"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/IEEECONF53345.2021.9723232"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2019.00772"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/34.927464"}],"event":{"name":"2022 56th Asilomar Conference on Signals, Systems, and Computers","start":{"date-parts":[[2022,10,31]]},"location":"Pacific Grove, CA, USA","end":{"date-parts":[[2022,11,2]]}},"container-title":["2022 56th Asilomar Conference on Signals, Systems, and Computers"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10051833\/10051818\/10051902.pdf?arnumber=10051902","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,13]],"date-time":"2024-02-13T16:41:25Z","timestamp":1707842485000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10051902\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10,31]]},"references-count":34,"URL":"https:\/\/doi.org\/10.1109\/ieeeconf56349.2022.10051902","relation":{},"subject":[],"published":{"date-parts":[[2022,10,31]]}}}