{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T19:29:57Z","timestamp":1730230197751,"version":"3.28.0"},"reference-count":29,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T00:00:00Z","timestamp":1556668800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T00:00:00Z","timestamp":1556668800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T00:00:00Z","timestamp":1556668800000},"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":[],"published-print":{"date-parts":[[2019,5]]},"DOI":"10.1109\/icassp.2019.8682941","type":"proceedings-article","created":{"date-parts":[[2019,4,17]],"date-time":"2019-04-17T20:01:56Z","timestamp":1555531316000},"page":"2907-2911","source":"Crossref","is-referenced-by-count":1,"title":["Fast and Global Optimal Nonconvex Matrix Factorization via Perturbed Alternating Proximal Point"],"prefix":"10.1109","author":[{"given":"Songtao","family":"Lu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mingyi","family":"Hong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhengdao","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488693"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1023\/A:1017501703105"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719857"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-006-0706-8"},{"article-title":"Gradient descent efficiently finds the cubic-regularized non-convex Newton step","year":"2016","author":"carmon","key":"ref14"},{"key":"ref15","first-page":"12330","article-title":"A generic approach for escaping saddle points","author":"reddi","year":"2018","journal-title":"Proc Int Conf Artificial Intelligence and Statistics (AISTATS)"},{"article-title":"Saving gradient and negative curvature computations: Finding local minima more efficiently","year":"2017","author":"yu","key":"ref16"},{"key":"ref17","first-page":"1980","article-title":"A hitting time analysis of stochastic gradient langevin dynamics","author":"zhang","year":"2017","journal-title":"Proceedings of the Annual Conference on Learning Theory (COLT)"},{"key":"ref18","article-title":"First-order stochastic algorithms for escaping from saddle points in almost linear time","author":"xu","year":"2018","journal-title":"Proceedings of Neural Information Processing Systems (NIPS)"},{"key":"ref19","article-title":"NEON2: Finding local minima via first-order oracles","author":"allen-zhu","year":"2018","journal-title":"Proceedings of Neural Information Processing Systems (NIPS)"},{"article-title":"On the sublinear convergence of randomly perturbed alternating gradient descent to second order stationary solutions","year":"2018","author":"lu","key":"ref28"},{"key":"ref4","first-page":"1233","article-title":"No spurious local minima in nonconvex low rank problems: A unified geometric analysis","author":"ge","year":"2017","journal-title":"Proceedings of International Conference on Machine Learning (ICML)"},{"key":"ref27","volume":"1","author":"friedman","year":"2001","journal-title":"The Elements of Statistical Learning"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-017-9365-9"},{"key":"ref6","article-title":"Gradient primal-dual methods of solving linear constrained non-convex problems: Convergence, optimality, and applications","author":"lu","year":"0","journal-title":"2019 working paper"},{"key":"ref29","article-title":"First-order methods of solving nonconvex optimization problems: Algorithms, convergence, and optimality","author":"lu","year":"2018","journal-title":"Graduate Theses and Dissertations"},{"article-title":"The global optimization geometry of low-rank matrix optimization","year":"2018","author":"zhu","key":"ref5"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2017.2679687"},{"key":"ref7","first-page":"559","article-title":"A nonconvex optimization framework for low rank matrix estimation","author":"zhao","year":"2015","journal-title":"Proceedings of Neural Information Processing Systems (NIPS)"},{"key":"ref2","first-page":"797","article-title":"Escaping from saddle points — online stochastic gradient for tensor decomposition","author":"ge","year":"2015","journal-title":"Proceedings of the Annual Conference on Learning Theory (COLT)"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1137\/120887795"},{"key":"ref1","first-page":"586","article-title":"Deep learning without poor local minima","author":"kawaguchi","year":"2016","journal-title":"Proceedings of Neural Information Processing Systems (NIPS)"},{"key":"ref20","first-page":"1246","article-title":"Gradient descent only converges to minimizers","author":"lee","year":"2016","journal-title":"Proceedings of the Annual Conference on Learning Theory (COLT)"},{"key":"ref22","article-title":"Block coordinate descent almost surely converges to a stationary point satisfying the second-order necessary condition","author":"song","year":"2017","journal-title":"Optimization Online"},{"article-title":"First-order methods almost always avoid saddle points","year":"2017","author":"lee","key":"ref21"},{"key":"ref24","first-page":"1724","article-title":"How to escape saddle points efficiently","author":"jin","year":"2017","journal-title":"Proceedings of International Conference on Machine Learning (ICML)"},{"key":"ref23","article-title":"Gradient descent can take exponential time to escape saddle points","author":"du","year":"2017","journal-title":"Proceedings of Neural Information Processing Systems (NIPS)"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1137\/070697835"},{"article-title":"Nonconvex optimization meets low-rank matrix factorization: An overview","year":"2018","author":"chi","key":"ref25"}],"event":{"name":"ICASSP 2019 - 2019 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","start":{"date-parts":[[2019,5,12]]},"location":"Brighton, United Kingdom","end":{"date-parts":[[2019,5,17]]}},"container-title":["ICASSP 2019 - 2019 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8671773\/8682151\/08682941.pdf?arnumber=8682941","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,15]],"date-time":"2022-07-15T03:14:25Z","timestamp":1657854865000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8682941\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,5]]},"references-count":29,"URL":"https:\/\/doi.org\/10.1109\/icassp.2019.8682941","relation":{},"subject":[],"published":{"date-parts":[[2019,5]]}}}