{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T10:13:14Z","timestamp":1740132794898,"version":"3.37.3"},"reference-count":49,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"NSF","award":["CCF-1704204"],"award-info":[{"award-number":["CCF-1704204"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Signal Process."],"published-print":{"date-parts":[[2022]]},"DOI":"10.1109\/tsp.2022.3181333","type":"journal-article","created":{"date-parts":[[2022,6,10]],"date-time":"2022-06-10T20:23:48Z","timestamp":1654892628000},"page":"2985-2999","source":"Crossref","is-referenced-by-count":1,"title":["Landscape Correspondence of Empirical and Population Risks in the Eigendecomposition Problem"],"prefix":"10.1109","volume":"70","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3729-7496","authenticated-orcid":false,"given":"Shuang","family":"Li","sequence":"first","affiliation":[{"name":"Department of Mathematics, University of California, Los Angeles, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7879-1338","authenticated-orcid":false,"given":"Gongguo","family":"Tang","sequence":"additional","affiliation":[{"name":"Department of Electrical Engineering, Colorado School of Mines, Golden, CO, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2165-4586","authenticated-orcid":false,"given":"Michael B.","family":"Wakin","sequence":"additional","affiliation":[{"name":"Department of Electrical Engineering, Colorado School of Mines, Golden, CO, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/6173.003.0022"},{"key":"ref2","article-title":"Nonconvex low-rank symmetric tensor completion from noisy data","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"32","author":"Cai","year":"2019"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2016.1534"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2046205"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.74.036104"},{"key":"ref6","first-page":"1139","article-title":"On the importance of initialization and momentum in deep learning","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Sutskever","year":"2013"},{"article-title":"An overview of gradient descent optimization algorithms","year":"2016","author":"Ruder","key":"ref7"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2399924"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-019-09429-9"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2756858"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2019.2937282"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1093\/imaiai\/iaz009"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2598574"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2992234"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2018.01.001"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2840711"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2745623"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/s00025-016-0564-5"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3050427"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1002\/cpa.21760"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/0-387-34239-7"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/18.930926"},{"key":"ref23","first-page":"831","article-title":"Principles of risk minimization for learning theory","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Vapnik","year":"1992"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1214\/17-AOS1637"},{"key":"ref25","first-page":"3502","article-title":"The landscape of non-convex empirical risk with degenerate population risk","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Li","year":"2019"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1515\/9781400830244"},{"key":"ref27","first-page":"2332","article-title":"Global convergence of stochastic gradient descent for some non-convex matrix problems","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Sa","year":"2015"},{"key":"ref28","first-page":"797","article-title":"Escaping from saddle points-online stochastic gradient for tensor decomposition","volume-title":"Proc. Conf. Learn. Theory","author":"Ge","year":"2015"},{"key":"ref29","first-page":"1233","article-title":"No spurious local minima in nonconvex low rank problems: A unified geometric analysis","volume-title":"Proc. 34th Int. Conf. Mach. Learn.","volume":"70","author":"Ge","year":"2017"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-017-9365-9"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2020.3008876"},{"key":"ref32","article-title":"Geometry correspondence between empirical and population games","volume-title":"Proc. Smooth Games Optim. Mach. Learn. Workshop","author":"Li","year":"2019"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/s11590-018-1319-x"},{"key":"ref34","first-page":"1067","article-title":"Gradient descent can take exponential time to escape saddle points","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Du","year":"2017"},{"key":"ref35","first-page":"81","article-title":"Efficient approaches for escaping higher order saddle points in non-convex optimization","volume-title":"Proc. Conf. Learn. Theory","author":"Anandkumar","year":"2016"},{"key":"ref36","first-page":"1","article-title":"Accelerated gradient descent escapes saddle points faster than gradient descent","volume-title":"Proc. Mach. Learn. Res.","volume":"75","author":"Jin","year":"2018"},{"key":"ref37","first-page":"1233","article-title":"A generic approach for escaping saddle points","volume-title":"Proc. Int. Conf. Artif. Intell. Statist.","author":"Reddi","year":"2018"},{"key":"ref38","article-title":"When are nonconvex problems not scary?","volume-title":"Proc. NeurIPS Workshop Nonconvex Optim. Mach. Learn.","author":"Sun","year":"2015"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3049171"},{"article-title":"The leapfrog algorithm as nonlinear Gauss-Seidel","year":"2020","author":"Sutti","key":"ref40"},{"article-title":"Algorithms for data fitting on some common homogeneous spaces","year":"2013","author":"Rentmeesters","key":"ref41"},{"article-title":"A cubic regularized Newtons method over Riemannian manifolds","year":"2018","author":"Zhang","key":"ref42"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1093\/biomet\/asv008"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1561\/2200000079"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1137\/070697835"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2111771"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1016\/j.crma.2008.03.014"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-009-9045-5"},{"issue":"142","key":"ref49","first-page":"1","article-title":"Model-free nonconvex matrix completion: Local minima analysis and applications in memory-efficient Kernel PCA","volume":"20","author":"Chen","year":"2019","journal-title":"J. Mach. Learn. Res."}],"container-title":["IEEE Transactions on Signal Processing"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/78\/9675017\/9793581-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/78\/9675017\/09793581.pdf?arnumber=9793581","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,1]],"date-time":"2024-02-01T03:00:26Z","timestamp":1706756426000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9793581\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"references-count":49,"URL":"https:\/\/doi.org\/10.1109\/tsp.2022.3181333","relation":{},"ISSN":["1053-587X","1941-0476"],"issn-type":[{"type":"print","value":"1053-587X"},{"type":"electronic","value":"1941-0476"}],"subject":[],"published":{"date-parts":[[2022]]}}}