{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T10:14:05Z","timestamp":1740132845949,"version":"3.37.3"},"reference-count":43,"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":"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":[{"DOI":"10.13039\/100006754","name":"Army Research Laboratory","doi-asserted-by":"publisher","award":["W911NF-16-2-0008"],"award-info":[{"award-number":["W911NF-16-2-0008"]}],"id":[{"id":"10.13039\/100006754","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Signal Process."],"published-print":{"date-parts":[[2022]]},"DOI":"10.1109\/tsp.2021.3138242","type":"journal-article","created":{"date-parts":[[2021,12,24]],"date-time":"2021-12-24T20:26:22Z","timestamp":1640377582000},"page":"307-321","source":"Crossref","is-referenced-by-count":2,"title":["Escaping Saddle Points for Successive Convex Approximation"],"prefix":"10.1109","volume":"70","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8807-2695","authenticated-orcid":false,"given":"Amrit Singh","family":"Bedi","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4508-0062","authenticated-orcid":false,"given":"Ketan","family":"Rajawat","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9131-4723","authenticated-orcid":false,"given":"Vaneet","family":"Aggarwal","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2447-2873","authenticated-orcid":false,"given":"Alec","family":"Koppel","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"volume-title":"Neural Networks and Learning Machines\/Simon Haykin","year":"2009","author":"Haykin","key":"ref1"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2598574"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-017-9365-9"},{"key":"ref4","first-page":"797","article-title":"Escaping from saddle points - online stochastic gradient for tensor decomposition","volume-title":"Proc. 28th Conf. Learn. Theory","author":"Ge","year":"2015"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2959980"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2017.607"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2018.2816568"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2007.911828"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2006.1593335"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/78.978386"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1561\/2200000058"},{"issue":"5888\/10","key":"ref12","article-title":"Semidefinite relaxation of quadratic optimization problems and applications","volume":"1053","author":"Ma","year":"2010","journal-title":"IEEE Signal Process. Mag."},{"key":"ref13","article-title":"Geometric analysis of nonconvex optimization landscapes for overcomplete learning","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Qu","year":"2020"},{"issue":"5","key":"ref14","doi-asserted-by":"crossref","first-page":"999","DOI":"10.1137\/0329055","volume":"29","author":"Gelfand","year":"1991","journal-title":"SIAM J. Control Opt."},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1214\/aop\/1176990853"},{"key":"ref16","first-page":"1163","article-title":"Escaping saddles with stochastic gradients","volume-title":"Proc. Int. Conf. Mach. Learn","author":"Daneshmand","year":"2018"},{"key":"ref17","volume-title":"Stochastic Approximation and Recursive Algorithms and Applications","volume":"35","author":"Kushner","year":"2003"},{"key":"ref18","first-page":"1674","article-title":"Non-convex learning via stochastic gradient langevin dynamics: A nonasymptotic analysis","volume-title":"Proc. COLT","volume":"65","author":"Raginsky","year":"2017"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2019.2937282"},{"key":"ref20","first-page":"1724","article-title":"How to escape saddle points efficiently","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Jin","year":"2017"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2016.2601299"},{"key":"ref22","first-page":"2283","article-title":"Stochastic majorization-minimization algorithms for large-scale optimization","volume-title":"Proc. Adv. Neural Inf. Process. Syst","author":"J","year":"2013"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2016.2637317"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2020.3033354"},{"volume-title":"Numerical Optimization","year":"2006","author":"Nocedal","key":"ref25"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1137\/140954362"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2019.2925601"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2013.2293126"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.4324\/9781315371474-14"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-019-01363-6"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1098\/rsta.2015.0202"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1214\/21-AOS2066"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/s00034-019-01310-y"},{"article-title":"Nonconvex statistical optimization: Minimax-optimal sparse PCA in polynomial time","year":"2014","author":"Wang","key":"ref34"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2598574"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-016-1026-2"},{"author":"Levy","key":"ref37","article-title":"The power of normalization: Faster evasion of saddle points"},{"key":"ref38","first-page":"1458","article-title":"Convergence rates of inexact proximal-gradient methods for convex optimization","volume-title":"Proc. Adv. Neural Inf. Process. Syst","author":"Schmidt","year":"2011"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/GlobalSIP.2016.7905841"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-011-0841-3"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2105-9-179"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1111\/j.1745-3984.2003.tb01108.x"},{"key":"ref43","volume-title":"Introductory Lectures on Convex Optimization: A Basic Course","volume":"87","author":"Nesterov","year":"2013"}],"container-title":["IEEE Transactions on Signal Processing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/78\/9675017\/09662974.pdf?arnumber=9662974","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,10]],"date-time":"2024-01-10T00:34:31Z","timestamp":1704846871000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9662974\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"references-count":43,"URL":"https:\/\/doi.org\/10.1109\/tsp.2021.3138242","relation":{},"ISSN":["1053-587X","1941-0476"],"issn-type":[{"type":"print","value":"1053-587X"},{"type":"electronic","value":"1941-0476"}],"subject":[],"published":{"date-parts":[[2022]]}}}