{"total":44,"rows":[{"id":"2402.01567","title":"Understanding Adam Optimizer via Online Learning of Updates: Adam is FTRL in Disguise","created":"2024-02-02","cited_by_count":26,"area":null},{"id":"2307.04504","title":"An Algorithm with Optimal Dimension-Dependence for Zero-Order Nonsmooth Nonconvex Stochastic Optimization","created":"2023-07-10","cited_by_count":23,"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":"2405.09742","title":"Random Scaling and Momentum for Non-smooth Non-convex Optimization","created":"2024-05-16","cited_by_count":19,"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":"2602.08232","title":"Adaptive Matrix Online Learning through Smoothing with Guarantees for Nonsmooth Nonconvex Optimization","created":"2026-02-09","cited_by_count":14,"area":null},{"id":"2402.02720","title":"Discounted Adaptive Online Learning: Towards Better Regularization","created":"2024-02-05","cited_by_count":12,"area":null},{"id":"2405.20540","title":"Fully Unconstrained Online Learning","created":"2024-05-30","cited_by_count":10,"area":null},{"id":"2406.12771","title":"First-Order Methods for Linearly Constrained Bilevel Optimization","created":"2024-06-18","cited_by_count":10,"area":null},{"id":"2406.19579","title":"Private Zeroth-Order Nonsmooth Nonconvex Optimization","created":"2024-06-27","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":"2511.02276","title":"Gradient-Variation Online Adaptivity for Accelerated Optimization with H\\\"older Smoothness","created":"2025-11-04","cited_by_count":5,"area":null},{"id":"2604.15416","title":"StoSignSGD: Unbiased Structural Stochasticity Fixes SignSGD for Training Large Language Models","created":"2026-04-16","cited_by_count":5,"area":null},{"id":"2608.26288","title":"Muon with Finite Newton-Schulz: The Smoothing Benefit in Nonsmooth Nonconvex Optimization","created":"2026-08-26","cited_by_count":5,"area":null},{"id":"2306.11121","title":"Projection-Free Online Convex Optimization via Efficient Newton Iterations","created":"2023-06-19","cited_by_count":4,"area":null},{"id":"2406.01484","title":"Online Optimization Perspective on First-Order and Zero-Order Decentralized Nonsmooth Nonconvex Stochastic Optimization","created":"2024-06-03","cited_by_count":4,"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":"2505.13564","title":"Online Decision-Focused Learning","created":"2025-05-19","cited_by_count":4,"area":null},{"id":"2602.08372","title":"Dynamic Regret via Discounted-to-Dynamic Reduction with Applications to Curved Losses and Adam Optimizer","created":"2026-02-09","cited_by_count":4,"area":null},{"id":"2602.24207","title":"The Stability of Online Algorithms in Performative Prediction","created":"2026-02-27","cited_by_count":4,"area":null},{"id":"2310.10006","title":"Soft ascent-descent as a stable and flexible alternative to flooding","created":"2023-10-16","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":"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":"2505.19491","title":"Discounted Online Convex Optimization: Uniform Regret Across a Continuous Interval","created":"2025-05-26","cited_by_count":2,"area":null},{"id":"2510.03478","title":"How to Set $\\beta_1, \\beta_2$ in Adam: An Online Learning Perspective","created":"2025-10-03","cited_by_count":2,"area":null},{"id":"2510.21468","title":"Finite-Time Analysis of Stochastic Nonconvex Nonsmooth Optimization on the Riemannian Manifolds","created":"2025-10-24","cited_by_count":2,"area":null},{"id":"2606.02365","title":"FOAM: Frequency and Operator Error-Based Adaptive Damping Method for Reducing Staleness-Oriented Error for Shampoo","created":"2026-06-01","cited_by_count":2,"area":null},{"id":"2607.27383","title":"The Convergence Behavior of Adam under Heavy-Tailed Noise","created":"2026-07-29","cited_by_count":2,"area":null},{"id":"2609.11655","title":"Musec: MomentUm SpEctral Clipping for Stable Muon-type Training","created":"2026-09-10","cited_by_count":2,"area":null},{"id":"2403.16317","title":"Optimization on a Finer Scale: Bounded Local Subgradient Variation Perspective","created":"2024-03-24","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":"2405.00914","title":"Accelerated Fully First-Order Methods for Bilevel and Minimax Optimization","created":"2024-05-01","cited_by_count":0,"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":"2509.21653","title":"A regret minimization approach to fixed-point iterations","created":"2025-09-25","cited_by_count":0,"area":null},{"id":"2601.19730","title":"Stability and Generalization of Stochastic Nonconvex Optimization under Heavy-Tailed Noise: From Gradient Norm to Goldstein Stationarity","created":"2026-01-27","cited_by_count":0,"area":null},{"id":"2605.15522","title":"Stochastic Non-Smooth Convex Optimization with Unbounded Gradients","created":"2026-05-15","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":"2607.17607","title":"Optimizing the Preconditioner: A Black-box Online-to-Nonconvex Conversion with Static Regret Minimization Oracles","created":"2026-07-20","cited_by_count":0,"area":null},{"id":"2609.06064","title":"The Role of Gradient Modification in Heavy-Tailed Nonconvex Stochastic Min-Max Optimization","created":"2026-09-05","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},{"id":"2610.13787","title":"Optimal Algorithms for Nonsmooth Nonconvex Stochastic Optimization with Constraints","created":"2026-10-09","cited_by_count":0,"area":null}],"next_cursor":null}