{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T18:42:51Z","timestamp":1778092971709,"version":"3.51.4"},"reference-count":50,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":["IEEE Trans. Neural Netw. Learning Syst."],"published-print":{"date-parts":[[2025,1]]},"DOI":"10.1109\/tnnls.2023.3326177","type":"journal-article","created":{"date-parts":[[2023,12,1]],"date-time":"2023-12-01T18:42:04Z","timestamp":1701456124000},"page":"1651-1663","source":"Crossref","is-referenced-by-count":3,"title":["Stochastic Optimization for Nonconvex Problem With Inexact Hessian Matrix, Gradient, and Function"],"prefix":"10.1109","volume":"36","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8128-2788","authenticated-orcid":false,"given":"Liu","family":"Liu","sequence":"first","affiliation":[{"name":"Institute of Artificial Intelligence and the State Key Laboratory of Software Development Environment, Beihang University, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xuanqing","family":"Liu","sequence":"additional","affiliation":[{"name":"Amazon Web Services (AWS), Seattle, WA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cho-Jui","family":"Hsieh","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of California at Los Angeles, Los Angeles, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7225-5449","authenticated-orcid":false,"given":"Dacheng","family":"Tao","sequence":"additional","affiliation":[{"name":"School of Computer Science, Sydney AI Centre, Faculty of Engineering, The University of Sydney, Sydney, NSW, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","article-title":"No spurious local minima in nonconvex low rank problems: A unified geometric analysis","author":"Ge","year":"2017","journal-title":"arXiv:1704.00708"},{"key":"ref2","article-title":"How to escape saddle points efficiently","author":"Jin","year":"2017","journal-title":"arXiv:1703.00887"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719857"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-009-0286-5"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-009-0337-y"},{"key":"ref6","article-title":"Accelerating adaptive cubic regularization of Newton\u2019s method via random sampling","author":"Chen","year":"2018","journal-title":"arXiv:1802.05426"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1093\/imanum\/drz076"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976236.23"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-019-01405-z"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1137\/100812276"},{"key":"ref11","first-page":"1895","article-title":"Sub-sampled cubic regularization for non-convex optimization","volume-title":"Proc. ICML","author":"Kohler"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-017-1137-4"},{"key":"ref13","first-page":"2899","article-title":"Stochastic cubic regularization for fast nonconvex optimization","volume-title":"Proc. NeurIPS","author":"Tripuraneni"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1287\/ijoo.2022.0072"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1137\/18M1226282"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/1015330.1015332"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2021.3098222"},{"key":"ref18","first-page":"315","article-title":"Accelerating stochastic gradient descent using predictive variance reduction","volume-title":"Proc. NeurIPS","author":"Johnson"},{"key":"ref19","first-page":"1646","article-title":"SAGA: A fast incremental gradient method with support for non-strongly convex composite objectives","volume-title":"Proc. NeurIPS","author":"Defazio"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2018.2866699"},{"key":"ref21","first-page":"314","article-title":"Stochastic variance reduction for nonconvex optimization","volume-title":"ICML","author":"Reddi"},{"key":"ref22","first-page":"2348","article-title":"Non-convex finite-sum optimization via SCSG methods","volume-title":"Proc. NeurIPS","author":"Lei"},{"key":"ref23","first-page":"7636","article-title":"Globally convergent Newton methods for ill-conditioned generalized self-concordant losses","volume-title":"Proc. NeurIPS","author":"Marteau-Ferey"},{"key":"ref24","first-page":"9498","article-title":"DINGO: Distributed Newton-type method for gradient-norm optimization","volume-title":"Proc. NeurIPS","author":"Crane"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/tnnls.2022.3158085"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2021.3132658"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2021.3130173"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-1980-0572855-7"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1137\/10079923X"},{"key":"ref30","first-page":"3052","article-title":"Convergence rates of sub-sampled Newton methods","volume-title":"Proc. NeurIPS","author":"Erdogdu"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1287\/ijoo.2019.0043"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/j.jco.2021.101591"},{"key":"ref33","first-page":"1","article-title":"First- and second-order high probability complexity bounds for trust-region methods with noisy oracles","author":"Cao","year":"2023","journal-title":"Math. Program."},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1287\/ijoo.2018.0010"},{"key":"ref35","article-title":"A trust region method for the optimization of noisy functions","author":"Sun","year":"2022","journal-title":"arXiv:2201.00973"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-8853-9"},{"key":"ref37","first-page":"2626","article-title":"Faster eigenvector computation via shift-and-invert preconditioning","volume-title":"Proc. ICML","author":"Garber"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1137\/0613066"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1137\/17M1114296"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1287\/ijoo.2019.0016"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1093\/imanum\/drx043"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-017-1141-8"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539704442684"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1561\/2200000035"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2161794"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2104999"},{"key":"ref47","article-title":"Note on sampling without replacing from a finite collection of matrices","author":"Gross","year":"2010","journal-title":"arXiv:1001.2738"},{"key":"ref48","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1007\/978-3-642-35289-8_27","article-title":"Training deep and recurrent networks with hessian-free optimization","volume-title":"Neural Networks: Tricks Trade","author":"Martens","year":"2012"},{"key":"ref49","volume-title":"Numerical Optimization","author":"Nocedal","year":"2006"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-006-0706-8"}],"container-title":["IEEE Transactions on Neural Networks and Learning Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/5962385\/10832116\/10337766.pdf?arnumber=10337766","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,14]],"date-time":"2025-01-14T20:00:55Z","timestamp":1736884855000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10337766\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1]]},"references-count":50,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tnnls.2023.3326177","relation":{},"ISSN":["2162-237X","2162-2388"],"issn-type":[{"value":"2162-237X","type":"print"},{"value":"2162-2388","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,1]]}}}