{"total":45,"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":"2209.05045","title":"Gradient-Free Methods for Deterministic and Stochastic Nonsmooth Nonconvex Optimization","created":"2022-09-12","cited_by_count":43,"area":null},{"id":"2206.00846","title":"Faster Rates of Convergence to Stationary Points in Differentially Private Optimization","created":"2022-06-02","cited_by_count":32,"area":null},{"id":"2405.09742","title":"Random Scaling and Momentum for Non-smooth Non-convex Optimization","created":"2024-05-16","cited_by_count":19,"area":null},{"id":"2201.11411","title":"Restarted Nonconvex Accelerated Gradient Descent: No More Polylogarithmic Factor in the $O(\\epsilon^{-7/4})$ Complexity","created":"2022-01-27","cited_by_count":17,"area":null},{"id":"2306.14853","title":"Near-Optimal Nonconvex-Strongly-Convex Bilevel Optimization with Fully First-Order Oracles","created":"2023-06-26","cited_by_count":17,"area":null},{"id":"2307.00126","title":"Accelerating Inexact HyperGradient Descent for Bilevel Optimization","created":"2023-06-30","cited_by_count":15,"area":null},{"id":"2203.13225","title":"Distributionally Robust Optimization via Ball Oracle Acceleration","created":"2022-03-24","cited_by_count":14,"area":null},{"id":"2506.11214","title":"Complexity of normalized stochastic first-order methods with momentum under heavy-tailed noise","created":"2025-06-12","cited_by_count":11,"area":null},{"id":"2302.11147","title":"Stochastic Approximation Beyond Gradient for Signal Processing and Machine Learning","created":"2023-02-22","cited_by_count":10,"area":null},{"id":"2107.01832","title":"Provable Convergence of Nesterov's Accelerated Gradient Method for Over-Parameterized Neural Networks","created":"2021-07-05","cited_by_count":7,"area":null},{"id":"2109.00534","title":"The Minimax Complexity of Distributed Optimization","created":"2021-09-01","cited_by_count":7,"area":null},{"id":"2412.02175","title":"Improved Complexity for Smooth Nonconvex Optimization: A Two-Level Online Learning Approach with Quasi-Newton Methods","created":"2024-12-03","cited_by_count":7,"area":null},{"id":"2210.01496","title":"Zeroth-Order Negative Curvature Finding: Escaping Saddle Points without Gradients","created":"2022-10-04","cited_by_count":6,"area":null},{"id":"2301.03139","title":"A Newton-CG based augmented Lagrangian method for finding a second-order stationary point of nonconvex equality constrained optimization with complexity guarantees","created":"2023-01-09","cited_by_count":6,"area":null},{"id":"2208.10025","title":"Simple and Optimal Stochastic Gradient Methods for Nonsmooth Nonconvex Optimization","created":"2022-08-22","cited_by_count":5,"area":null},{"id":"2102.02837","title":"Escaping Saddle Points for Nonsmooth Weakly Convex Functions via Perturbed Proximal Algorithms","created":"2021-02-04","cited_by_count":4,"area":null},{"id":"2204.08306","title":"A Convergence Analysis of Nesterov's Accelerated Gradient Method in Training Deep Linear Neural Networks","created":"2022-04-18","cited_by_count":4,"area":null},{"id":"2211.14645","title":"Accelerated Riemannian Optimization: Handling Constraints with a Prox to Bound Geometric Penalties","created":"2022-11-26","cited_by_count":4,"area":null},{"id":"2305.16186","title":"Accelerated Methods for Riemannian Min-Max Optimization Ensuring Bounded Geometric Penalties","created":"2023-05-25","cited_by_count":4,"area":null},{"id":"2310.14616","title":"Rethinking SIGN Training: Provable Nonconvex Acceleration without First- and Second-Order Gradient Lipschitz","created":"2023-10-23","cited_by_count":4,"area":null},{"id":"2311.13447","title":"Differentially Private Non-Convex Optimization under the KL Condition with Optimal Rates","created":"2023-11-22","cited_by_count":4,"area":null},{"id":"2103.03570","title":"Second-order step-size tuning of SGD for non-convex optimization","created":"2021-03-05","cited_by_count":3,"area":null},{"id":"2407.01825","title":"Reevaluating Theoretical Analysis Methods for Optimization in Deep Learning","created":"2024-07-01","cited_by_count":3,"area":null},{"id":"2506.06606","title":"Stacey: Promoting Stochastic Steepest Descent via Accelerated $\\ell_p$-Smooth Nonconvex Optimization","created":"2025-06-07","cited_by_count":3,"area":null},{"id":"2510.03167","title":"Improving Online-to-Nonconvex Conversion for Smooth Optimization via Double Optimism","created":"2025-10-03","cited_by_count":3,"area":null},{"id":"2511.22331","title":"On the Condition Number Dependency in Bilevel Optimization","created":"2025-11-27","cited_by_count":3,"area":null},{"id":"2202.09052","title":"Tackling benign nonconvexity with smoothing and stochastic gradients","created":"2022-02-18","cited_by_count":2,"area":null},{"id":"2207.05697","title":"A Newton-CG based barrier method for finding a second-order stationary point of nonconvex conic optimization with complexity guarantees","created":"2022-07-12","cited_by_count":2,"area":null},{"id":"2301.04204","title":"A Newton-CG based barrier-augmented Lagrangian method for general nonconvex conic optimization","created":"2023-01-10","cited_by_count":2,"area":null},{"id":"2105.10090","title":"Escaping Saddle Points with Compressed SGD","created":"2021-05-21","cited_by_count":1,"area":null},{"id":"2304.08389","title":"Beyond first-order methods for non-convex non-concave min-max optimization","created":"2023-04-17","cited_by_count":1,"area":null},{"id":"2310.14901","title":"Series of Hessian-Vector Products for Tractable Saddle-Free Newton Optimisation of Neural Networks","created":"2023-10-23","cited_by_count":1,"area":null},{"id":"2412.12987","title":"Stochastic interior-point methods for smooth conic optimization with applications","created":"2024-12-17","cited_by_count":1,"area":null},{"id":"2606.05438","title":"Sharp First-Order Lower Bounds for Higher-Order Smooth Nonconvex Optimization","created":"2026-06-03","cited_by_count":1,"area":null},{"id":"2103.04413","title":"Escaping Saddle Points with Stochastically Controlled Stochastic Gradient Methods","created":"2021-03-07","cited_by_count":0,"area":null},{"id":"2205.13753","title":"HOUDINI: Escaping from Moderately Constrained Saddles","created":"2022-05-27","cited_by_count":0,"area":null},{"id":"2208.00208","title":"DRSOM: A Dimension Reduced Second-Order Method","created":"2022-07-30","cited_by_count":0,"area":null},{"id":"2210.10430","title":"Convexity Certificates from Hessians","created":"2022-10-19","cited_by_count":0,"area":null},{"id":"2311.13094","title":"Newton-CG methods for nonconvex unconstrained optimization with H\\\"older continuous Hessian","created":"2023-11-22","cited_by_count":0,"area":null},{"id":"2405.00914","title":"Accelerated Fully First-Order Methods for Bilevel and Minimax Optimization","created":"2024-05-01","cited_by_count":0,"area":null},{"id":"2412.14488","title":"A stochastic first-order method with multi-extrapolated momentum for highly smooth unconstrained optimization","created":"2024-12-19","cited_by_count":0,"area":null},{"id":"2511.17399","title":"Stable Coresets via Posterior Sampling: Aligning Induced and Full Loss Landscapes","created":"2025-11-21","cited_by_count":0,"area":null},{"id":"2602.11665","title":"Fully First-Order Algorithms for Online Bilevel Optimization","created":"2026-02-12","cited_by_count":0,"area":null},{"id":"2605.02127","title":"A Parameter-Free First-Order Algorithm for Non-Convex Optimization with $\\tilde{\\mkern1mu O}(\\epsilon^{-5/3})$ Global Rate","created":"2026-05-04","cited_by_count":0,"area":null}],"next_cursor":null}