{"total":16,"rows":[{"id":"2302.03775","title":"Optimal Stochastic Non-smooth Non-convex Optimization through Online-to-Non-convex Conversion","created":"2023-02-07","cited_by_count":45,"area":null},{"id":"2302.08300","title":"Deterministic Nonsmooth Nonconvex Optimization","created":"2023-02-16","cited_by_count":26,"area":null},{"id":"2405.18199","title":"Adam with model exponential moving average is effective for nonconvex optimization","created":"2024-05-28","cited_by_count":23,"area":null},{"id":"2301.06428","title":"Faster Gradient-Free Algorithms for Nonsmooth Nonconvex Stochastic Optimization","created":"2023-01-16","cited_by_count":17,"area":null},{"id":"2508.07473","title":"Online Convex Optimization with Heavy Tails: Old Algorithms, New Regrets, and Applications","created":"2025-08-10","cited_by_count":17,"area":null},{"id":"2411.07061","title":"General framework for online-to-nonconvex conversion: Schedule-free SGD is also effective for nonconvex optimization","created":"2024-11-11","cited_by_count":15,"area":null},{"id":"2410.05880","title":"Improved Sample Complexity for Private Nonsmooth Nonconvex Optimization","created":"2024-10-08","cited_by_count":4,"area":null},{"id":"2302.12261","title":"Testing Stationarity Concepts for ReLU Networks: Hardness, Regularity, and Robust Algorithms","created":"2023-02-23","cited_by_count":2,"area":null},{"id":"2409.10323","title":"On the Hardness of Meaningful Local Guarantees in Nonsmooth Nonconvex Optimization","created":"2024-09-16","cited_by_count":0,"area":null},{"id":"2410.05022","title":"On subdifferential chain rule of matrix factorization and beyond","created":"2024-10-07","cited_by_count":0,"area":null},{"id":"2410.05025","title":"$\\ell_1$-norm rank-one symmetric matrix factorization has no spurious second-order stationary points","created":"2024-10-07","cited_by_count":0,"area":null},{"id":"2605.10219","title":"Parameterized Complexity of Stationarity Testing for Piecewise-Affine Functions and Shallow CNN Losses","created":"2026-05-11","cited_by_count":0,"area":null},{"id":"2605.24513","title":"Zeroth-Order Nonconvex Nonsmooth Optimization with Heavy-Tailed Noise","created":"2026-05-23","cited_by_count":0,"area":null},{"id":"2606.22326","title":"Adam Converges in Nonsmooth Nonconvex Optimization","created":"2026-06-21","cited_by_count":0,"area":null},{"id":"2609.23837","title":"The Exponential Price of Determinism in Nonsmooth Nonconvex Optimization","created":"2026-09-20","cited_by_count":0,"area":null},{"id":"2610.05789","title":"Dimension-Free Decentralized Nonsmooth Nonconvex Stochastic Optimization","created":"2026-10-05","cited_by_count":0,"area":null}],"next_cursor":null}