{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,15]],"date-time":"2026-06-15T20:49:01Z","timestamp":1781556541449,"version":"3.54.5"},"reference-count":40,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"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 Signal Process. Mag."],"published-print":{"date-parts":[[2026,5]]},"DOI":"10.1109\/msp.2026.3662660","type":"journal-article","created":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T19:44:54Z","timestamp":1781293494000},"page":"102-114","source":"Crossref","is-referenced-by-count":0,"title":["Computational Nonsmooth Analysis: Modern applications and recent developments [Special Issue on the Mathematics of Deep Learning]"],"prefix":"10.1109","volume":"43","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0328-2651","authenticated-orcid":false,"given":"Lai","family":"Tian","sequence":"first","affiliation":[{"name":"University of Southern California, Los Angeles, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2588-7851","authenticated-orcid":false,"given":"Anthony Man-Cho","family":"So","sequence":"additional","affiliation":[{"name":"Department of Systems Engineering and Engineering, Management of the Chinese University of Hong Kong (CUHK), Hong Kong, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","volume-title":"Learning Theory From First Principles","author":"Bach","year":"2024"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611971309"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1515\/9781400873173"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02431-3"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1137\/100788458"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-91578-4"},{"key":"ref7","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898717761","volume-title":"Evaluating Derivatives: Principles and Techniques of Algorithmic Differentiation","author":"Griewank","year":"2008"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/msp.2020.3003845"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/0362-546x(85)90012-4"},{"key":"ref10","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611976595","volume-title":"Lectures on Stochastic Programming: Modeling and Theory","author":"Shapiro","year":"2021"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976748"},{"key":"ref12","first-page":"7125","article-title":"Provably correct automatic subdifferentiation for qualified programs","volume-title":"Proc. 32nd Annu. Conf. Neural Inf. Process. Syst. (NeurIPS)","author":"Kakade","year":"2018"},{"key":"ref13","first-page":"6719","article-title":"On correctness of automatic differentiation for non-differentiable functions","volume-title":"Proc. 34th Annu. Conf. Neural Inf. Process. Syst. (NeurIPS)","author":"Lee","year":"2020"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-020-01501-5"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-018-1311-3"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611978322.72"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-005-0633-0"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1080\/10556788.2015.1025400"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-90653-4_18"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1080\/10556788.2013.796683"},{"key":"ref21","article-title":"Generalized abs-linear learning","volume-title":"Proc. Program Transformations ML Workshop NeurIPS","author":"Griewank","year":"2019"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-34910-3_10"},{"key":"ref23","volume-title":"Problem Complexity and Method Efficiency in Optimization","author":"Nemirovski","year":"1983"},{"key":"ref24","first-page":"11173","article-title":"Complexity of finding stationary points of nonsmooth nonconvex functions","volume-title":"Proc. 37th Int. Conf. Mach. Learn.","author":"Zhang","year":"2020"},{"issue":"314","key":"ref25","first-page":"1","article-title":"Oracle complexity in nonsmooth nonconvex optimization","volume":"23","author":"Kornowski","year":"2022","journal-title":"J. Mach. Learn. Res."},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1137\/18m1178244"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/bf01584320"},{"key":"ref28","first-page":"21360","article-title":"On the finite-time complexity and practical computation of approximate stationarity concepts of Lipschitz functions","volume-title":"Proc. 39th Int. Conf. Mach. Learn.","author":"Tian","year":"2022"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.52202\/068431-0485"},{"key":"ref30","first-page":"6643","article-title":"Optimal stochastic, non-smooth, non-convex optimization through online-to-non-convex conversion","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Cutkosky","year":"2023"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-023-02031-6"},{"key":"ref32","first-page":"4570","article-title":"Deterministic nonsmooth nonconvex optimization","volume-title":"Proc. 36th Annu. Conf. Learn. Theory","author":"Jordan","year":"2023"},{"key":"ref33","first-page":"26160","article-title":"Gradient-free methods for deterministic and stochastic nonsmooth nonconvex optimization","volume-title":"Proc. 36th Annu. Conf. Neural Inf. Process. Syst. (NeurIPS)","author":"Lin","year":"2022"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0121142"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/bf02592948"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1016\/j.aim.2021.108119"},{"key":"ref37","article-title":"Convergence to second-order stationarity for constrained non-convex optimization","author":"Nouiehed","year":"2018"},{"key":"ref38","article-title":"Efficiently testing local optimality and escaping saddles for ReLU networks","volume-title":"Proc. 7th Int. Conf. Learn. Representations","author":"Yun","year":"2019"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-018-1286-0"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-018-09409-5"}],"container-title":["IEEE Signal Processing Magazine"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/79\/11561017\/11561048.pdf?arnumber=11561048","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,15]],"date-time":"2026-06-15T19:50:09Z","timestamp":1781553009000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11561048\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5]]},"references-count":40,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/msp.2026.3662660","relation":{},"ISSN":["1053-5888","1558-0792"],"issn-type":[{"value":"1053-5888","type":"print"},{"value":"1558-0792","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,5]]}}}