{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T13:16:22Z","timestamp":1730207782694,"version":"3.28.0"},"reference-count":23,"publisher":"IEEE","license":[{"start":{"date-parts":[[2020,3,1]],"date-time":"2020-03-01T00:00:00Z","timestamp":1583020800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,3,1]],"date-time":"2020-03-01T00:00:00Z","timestamp":1583020800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,3,1]],"date-time":"2020-03-01T00:00:00Z","timestamp":1583020800000},"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":[[2020,3]]},"DOI":"10.1109\/ciss48834.2020.1570627382","type":"proceedings-article","created":{"date-parts":[[2020,5,7]],"date-time":"2020-05-07T22:27:40Z","timestamp":1588890460000},"page":"1-6","source":"Crossref","is-referenced-by-count":1,"title":["Escaping Saddle Points for Zeroth-order Non-convex Optimization using Estimated Gradient Descent"],"prefix":"10.1109","author":[{"given":"Qinbo","family":"Bai","sequence":"first","affiliation":[]},{"given":"Mridul","family":"Agarwal","sequence":"additional","affiliation":[]},{"given":"Vaneet","family":"Aggarwal","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","first-page":"651","article-title":"Zeroth-order nonconvex stochastic optimization: Handling constraints, high-dimensionality, and saddle- points","author":"balasubramanian","year":"2019"},{"key":"ref11","article-title":"Global Convergence of Policy Gradient Methods for the Linear Quadratic Regulator","author":"fazel","year":"2018","journal-title":"ArXiv e-prints"},{"key":"ref12","article-title":"On nonconvex optimization for machine learning: Gradients, stochasticity, and saddle points","volume":"abs 1902 4811v2","author":"jin","year":"2019","journal-title":"CoRR"},{"key":"ref13","first-page":"1246","article-title":"Gradient descent only converges to minimizers","author":"lee","year":"2016","journal-title":"Conference on Learning Theory"},{"article-title":"Escaping saddle points with the successive convex approximation algorithm","year":"2019","author":"bedi","key":"ref14"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-006-0706-8"},{"key":"ref16","first-page":"2899","article-title":"Stochastic cubic regularization for fast nonconvex optimization","author":"tripuraneni","year":"2018","journal-title":"Advances in neural information processing systems"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055464"},{"article-title":"Evolution strategies as a scalable alternative to reinforcement learning","year":"2017","author":"salimans","key":"ref18"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718768"},{"article-title":"Low-tubal-rank tensor completion using alternating minimization","year":"2016","author":"liu","key":"ref4"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488693"},{"key":"ref6","first-page":"586","article-title":"Deep learning without poor local minima","author":"kawaguchi","year":"2016","journal-title":"Advances in neural information processing systems"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2632162"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3332288"},{"key":"ref7","first-page":"2933","article-title":"Identifying and attacking the saddle point problem in highdimensional non-convex optimization","author":"dauphin","year":"2014","journal-title":"Advances in neural information processing systems"},{"key":"ref2","first-page":"1724","article-title":"How to escape saddle points efficiently","volume":"70","author":"jin","year":"2017","journal-title":"Proceedings of the 34th International Conference on Machine Learning"},{"key":"ref1","first-page":"5","article-title":"Introductory lectures on convex programming volume i: Basic course","volume":"3","author":"nesterov","year":"1998","journal-title":"Lecture notes"},{"key":"ref9","first-page":"arxiv:1806.04458","article-title":"Sparse Stochastic Zeroth-Order Optimization with an Application to Bandit Structured Prediction","author":"sokolov","year":"2018","journal-title":"ArXiv e-prints"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-015-9296-2"},{"key":"ref22","first-page":"4896","article-title":"On the local minima of the empirical risk","author":"jin","year":"2018","journal-title":"Advances in neural information processing systems"},{"key":"ref21","first-page":"10066","article-title":"Efficiently avoiding saddle points with zero order methods: No gradients required","author":"vlatakis-gkaragkounis","year":"2019","journal-title":"Advances in neural information processing systems"},{"article-title":"Escaping saddle points for zeroth-order nonconvex optimization using estimated gradient descent","year":"2019","author":"bai","key":"ref23"}],"event":{"name":"2020 54th Annual Conference on Information Sciences and Systems (CISS)","start":{"date-parts":[[2020,3,18]]},"location":"Princeton, NJ, USA","end":{"date-parts":[[2020,3,20]]}},"container-title":["2020 54th Annual Conference on Information Sciences and Systems (CISS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9081570\/9086165\/09086277.pdf?arnumber=9086277","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,27]],"date-time":"2022-06-27T11:46:29Z","timestamp":1656330389000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9086277\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,3]]},"references-count":23,"URL":"https:\/\/doi.org\/10.1109\/ciss48834.2020.1570627382","relation":{},"subject":[],"published":{"date-parts":[[2020,3]]}}}