{"total":36,"rows":[{"id":"2303.03108","title":"Gradient Norm Aware Minimization Seeks First-Order Flatness and Improves Generalization","created":"2023-03-03","cited_by_count":57,"area":null},{"id":"2307.11108","title":"Flatness-Aware Minimization for Domain Generalization","created":"2023-07-20","cited_by_count":27,"area":null},{"id":"2202.03684","title":"Efficiently Escaping Saddle Points in Bilevel Optimization","created":"2022-02-08","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":"2111.14069","title":"Escape saddle points by a simple gradient-descent based algorithm","created":"2021-11-28","cited_by_count":11,"area":null},{"id":"2209.14501","title":"On Quantum Speedups for Nonconvex Optimization via Quantum Tunneling Walks","created":"2022-09-29","cited_by_count":9,"area":null},{"id":"2106.02985","title":"Escaping Saddle Points Faster with Stochastic Momentum","created":"2021-06-05","cited_by_count":8,"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":"2208.10025","title":"Simple and Optimal Stochastic Gradient Methods for Nonsmooth Nonconvex Optimization","created":"2022-08-22","cited_by_count":5,"area":null},{"id":"2604.16620","title":"Lower Bounds and Proximally Anchored SGD for Non-Convex Minimization Under Unbounded Variance","created":"2026-04-17","cited_by_count":5,"area":null},{"id":"2406.03006","title":"Quantum Algorithms and Lower Bounds for Finite-Sum Optimization","created":"2024-06-05","cited_by_count":4,"area":null},{"id":"2103.09424","title":"Escaping Saddle Points in Distributed Newton's Method with Communication Efficiency and Byzantine Resilience","created":"2021-03-17","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":"2202.06083","title":"Escaping Saddle Points with Bias-Variance Reduced Local Perturbed SGD for Communication Efficient Nonconvex Distributed Learning","created":"2022-02-12","cited_by_count":2,"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":"2212.06283","title":"Variance-Reduced Conservative Policy Iteration","created":"2022-12-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":"2312.03807","title":"Achieving ${O}(\\epsilon^{-1.5})$ Complexity in Hessian/Jacobian-free Stochastic Bilevel Optimization","created":"2023-12-06","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":"2110.13144","title":"Faster Perturbed Stochastic Gradient Methods for Finding Local Minima","created":"2021-10-25","cited_by_count":1,"area":null},{"id":"2410.06878","title":"Noise is All You Need: Private Second-Order Convergence of Noisy SGD","created":"2024-10-09","cited_by_count":1,"area":null},{"id":"2509.02937","title":"Faster Gradient Methods for Highly-Smooth Stochastic Bilevel Optimization","created":"2025-09-03","cited_by_count":1,"area":null},{"id":"2604.09437","title":"AdaCubic: An Adaptive Cubic Regularization Optimizer for Deep Learning","created":"2026-04-10","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":"2101.02625","title":"Boundary Conditions for Linear Exit Time Gradient Trajectories Around Saddle Points: Analysis and Algorithm","created":"2021-01-07","cited_by_count":0,"area":null},{"id":"2102.03525","title":"Exclusive Topic Modeling","created":"2021-02-06","cited_by_count":0,"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":"2209.00361","title":"Versatile Single-Loop Method for Gradient Estimator: First and Second Order Optimality, and its Application to Federated Learning","created":"2022-09-01","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":"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":"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},{"id":"2609.30501","title":"To Solve Bilevel Optimization with Nonconvex Lower Levels, We Need Second-Order Stationarity","created":"2026-09-24","cited_by_count":0,"area":null}],"next_cursor":null}