{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T03:47:36Z","timestamp":1775101656631,"version":"3.50.1"},"reference-count":57,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2023,4,1]],"date-time":"2023-04-01T00:00:00Z","timestamp":1680307200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,4,1]],"date-time":"2023-04-01T00:00:00Z","timestamp":1680307200000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,4,1]],"date-time":"2023-04-01T00:00:00Z","timestamp":1680307200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,4,1]],"date-time":"2023-04-01T00:00:00Z","timestamp":1680307200000},"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-1453073"],"award-info":[{"award-number":["CCF-1453073"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1907658"],"award-info":[{"award-number":["CCF-1907658"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1814888"],"award-info":[{"award-number":["CCF-1814888"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DMS-2053485"],"award-info":[{"award-number":["DMS-2053485"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1910110"],"award-info":[{"award-number":["CCF-1910110"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000183","name":"Army Research Office","doi-asserted-by":"publisher","award":["W911NF-17-1-0546"],"award-info":[{"award-number":["W911NF-17-1-0546"]}],"id":[{"id":"10.13039\/100000183","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000183","name":"Army Research Office","doi-asserted-by":"publisher","award":["W911NF-21-1-0301"],"award-info":[{"award-number":["W911NF-21-1-0301"]}],"id":[{"id":"10.13039\/100000183","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["N00014-21-1-2244"],"award-info":[{"award-number":["N00014-21-1-2244"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000185","name":"Defense Advanced Research Projects Agency (DARPA) Lagrange Program through the Office of Naval Research (ONR)\/Naval Information Warfare Systems Command","doi-asserted-by":"publisher","award":["N660011824020"],"award-info":[{"award-number":["N660011824020"]}],"id":[{"id":"10.13039\/100000185","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2023,4]]},"DOI":"10.1109\/tit.2022.3213607","type":"journal-article","created":{"date-parts":[[2022,10,10]],"date-time":"2022-10-10T20:20:36Z","timestamp":1665433236000},"page":"2556-2602","source":"Crossref","is-referenced-by-count":1,"title":["Boundary Conditions for Linear Exit Time Gradient Trajectories Around Saddle Points: Analysis and Algorithm"],"prefix":"10.1109","volume":"69","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2649-7524","authenticated-orcid":false,"given":"Rishabh","family":"Dixit","sequence":"first","affiliation":[{"name":"Department of Electrical and Computer Engineering, Rutgers University, New Brunswick, NJ, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0575-2450","authenticated-orcid":false,"given":"Mert","family":"G\u00fcrb\u00fczbalaban","sequence":"additional","affiliation":[{"name":"Departments of Electrical & Computer Engineering, Management Science and Information Systems, and Statistics, Rutgers University, New Brunswick, NJ, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4406-5263","authenticated-orcid":false,"given":"Waheed U.","family":"Bajwa","sequence":"additional","affiliation":[{"name":"Departments of Electrical & Computer Engineering and Statistics, Rutgers University, New Brunswick, NJ, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1090\/qam\/10667"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1090\/psapm\/006\/0084178"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/3.3.175"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/800057.808695"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1137\/0802028"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970791"},{"key":"ref7","first-page":"556","article-title":"Algorithms for non-negative matrix factorization","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Lee"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/0893-6080(89)90044-0"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1093\/imamat\/6.1.76"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1093\/imaiai\/iaac025"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-019-01374-3"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0396(67)90016-2"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/0041-5553(64)90137-5"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-006-0706-8"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-46128-1_50"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.4064\/sm-18-1-87-136"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-011-0484-9"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1137\/050644641"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/BF02761819"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.3233\/ASY-201622"},{"key":"ref21","article-title":"On learning rates and Schr\u00f6dinger operators","author":"Shi","year":"2020","journal-title":"arXiv:2004.06977"},{"key":"ref22","first-page":"797","article-title":"Escaping from saddle points\u2014Online stochastic gradient for tensor decomposition","volume-title":"Proc. 28th Conf. Learn. Theory","author":"Ge"},{"key":"ref23","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"},{"key":"ref24","first-page":"1724","article-title":"How to escape saddle points efficiently","volume-title":"Proc. 34th Int. Conf. Mach. Learning","volume":"70","author":"Jin"},{"key":"ref25","first-page":"7040","article-title":"Stochastic mirror descent in variationally coherent optimization problems","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Zhou"},{"key":"ref26","first-page":"1155","article-title":"Escaping saddles with stochastic gradients","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Daneshmand"},{"key":"ref27","first-page":"1233","article-title":"A generic approach for escaping saddle points","volume-title":"Proc. Int. Conf. Artif. Intell. Statist.","author":"Reddi"},{"key":"ref28","first-page":"1042","article-title":"Accelerated gradient descent escapes saddle points faster than gradient descent","volume-title":"Proc. Conf. Learn. Theory","author":"Jin"},{"key":"ref29","first-page":"5530","article-title":"First-order stochastic algorithms for escaping from saddle points in almost linear time","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Xu"},{"key":"ref30","first-page":"2675","article-title":"Natasha 2: Faster non-convex optimization than SGD","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Allen-Zhu"},{"key":"ref31","first-page":"3716","article-title":"NEON2: Finding local minima via first-order oracles","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Allen-Zhu"},{"key":"ref32","first-page":"1192","article-title":"Sharp analysis for nonconvex SGD escaping from saddle points","volume-title":"Proc. Conf. Learn. Theory","author":"Fang"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1137\/17M1150116"},{"key":"ref34","first-page":"3629","article-title":"Escaping saddle points in constrained optimization","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Mokhtari"},{"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"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1137\/17M1114296"},{"key":"ref37","first-page":"4853","article-title":"Adaptive negative curvature descent with applications in non-convex optimization","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"31","author":"Liu"},{"key":"ref38","first-page":"1","article-title":"Escape saddle points by a simple gradient-descent based algorithm","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"34","author":"Zhang"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-18842-3"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1007\/bf02124750"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-019-09429-9"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1090\/mmono\/208"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1063\/1.1681123"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.4171\/lem\/64-3\/4-1"},{"key":"ref45","first-page":"1246","article-title":"Gradient descent only converges to minimizers","volume-title":"Proc. Conf. Learn. Theory","author":"Lee"},{"key":"ref46","volume-title":"Nonlinear Functional Analysis","volume":"4","author":"Schwartz","year":"1969"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.4064\/fm-22-1-77-108"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1002\/zamm.19290090105"},{"issue":"2","key":"ref49","first-page":"1","article-title":"Generalized power method for sparse principal component analysis","volume":"11","author":"Journ\u00e9e","year":"2010","journal-title":"J. Mach. Learn. Res."},{"issue":"4","key":"ref50","first-page":"1","article-title":"Truncated power method for sparse eigenvalue problems","volume":"14","author":"Yuan","year":"2013","journal-title":"J. Mach. Learn. Res."},{"key":"ref51","article-title":"Systems of extremal control","volume-title":"Nauka","author":"Rastrigin","year":"1974"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8191(05)80052-3"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1007\/bfb0029787"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1016\/0022-2496(85)90006-9"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719451"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-9982-5_1"},{"key":"ref57","volume-title":"Principles of Mathematical Analysis","volume":"3","author":"Rudin","year":"1976"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/18\/10073961\/9915618-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/10073961\/09915618.pdf?arnumber=9915618","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,24]],"date-time":"2024-01-24T02:32:38Z","timestamp":1706063558000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9915618\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,4]]},"references-count":57,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/tit.2022.3213607","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,4]]}}}