{"total":30,"rows":[{"id":"2304.13972","title":"Convergence of Adam Under Relaxed Assumptions","created":"2023-04-27","cited_by_count":99,"area":null},{"id":"2306.01264","title":"Convex and Non-convex Optimization Under Generalized Smoothness","created":"2023-06-02","cited_by_count":44,"area":null},{"id":"2310.17998","title":"Closing the Gap Between the Upper Bound and the Lower Bound of Adam's Iteration Complexity","created":"2023-10-27","cited_by_count":38,"area":null},{"id":"2305.12475","title":"Two Sides of One Coin: the Limits of Untuned SGD and the Power of Adaptive Methods","created":"2023-05-21","cited_by_count":23,"area":null},{"id":"2305.03938","title":"Adam-family Methods for Nonsmooth Optimization with Convergence Guarantees","created":"2023-05-06","cited_by_count":22,"area":null},{"id":"2402.07114","title":"Towards Quantifying the Preconditioning Effect of Adam","created":"2024-02-11","cited_by_count":19,"area":null},{"id":"2401.09587","title":"Bilevel Optimization under Unbounded Smoothness: A New Algorithm and Convergence Analysis","created":"2024-01-17","cited_by_count":15,"area":null},{"id":"2307.11782","title":"Convergence of Adam for Non-convex Objectives: Relaxed Hyperparameters and Non-ergodic Case","created":"2023-07-20","cited_by_count":14,"area":null},{"id":"2404.01436","title":"Convergence Guarantees for RMSProp and Adam in Generalized-smooth Non-convex Optimization with Affine Noise Variance","created":"2024-04-01","cited_by_count":14,"area":null},{"id":"2502.07923","title":"Sign Operator for Coping with Heavy-Tailed Noise in Non-Convex Optimization: High Probability Bounds Under $(L_0, L_1)$-Smoothness","created":"2025-02-11","cited_by_count":13,"area":null},{"id":"2410.04458","title":"A Comprehensive Framework for Analyzing the Convergence of Adam: Bridging the Gap with SGD","created":"2024-10-06","cited_by_count":9,"area":null},{"id":"2311.02000","title":"High Probability Convergence of Adam Under Unbounded Gradients and Affine Variance Noise","created":"2023-11-03","cited_by_count":8,"area":null},{"id":"2505.11840","title":"On the $O(\\frac{\\sqrt{d}}{K^{1/4}})$ Convergence Rate of AdamW Measured by $\\ell_1$ Norm","created":"2025-05-17","cited_by_count":8,"area":null},{"id":"2310.08858","title":"Adam-family Methods with Decoupled Weight Decay in Deep Learning","created":"2023-10-13","cited_by_count":5,"area":null},{"id":"2410.14054","title":"Adaptive Gradient Normalization and Independent Sampling for (Stochastic) Generalized-Smooth Optimization","created":"2024-10-17","cited_by_count":4,"area":null},{"id":"2410.16871","title":"Error Feedback under $(L_0,L_1)$-Smoothness: Normalization and Momentum","created":"2024-10-22","cited_by_count":4,"area":null},{"id":"2507.05966","title":"Simple Convergence Proof of Adam From a Sign-like Descent Perspective","created":"2025-07-08","cited_by_count":4,"area":null},{"id":"2602.01105","title":"OLion: Approaching the Hadamard Ideal by Intersecting Spectral and $\\ell_{\\infty}$ Implicit Biases","created":"2026-02-01","cited_by_count":3,"area":null},{"id":"2603.18899","title":"Uniform a priori bounds and error analysis for the Adam stochastic gradient descent optimization method","created":"2026-03-19","cited_by_count":3,"area":null},{"id":"2605.18694","title":"Can Adaptive Gradient Methods Converge under Heavy-Tailed Noise? A Case Study of AdaGrad","created":"2026-05-18","cited_by_count":3,"area":null},{"id":"2305.05675","title":"UAdam: Unified Adam-Type Algorithmic Framework for Non-Convex Stochastic Optimization","created":"2023-05-09","cited_by_count":2,"area":null},{"id":"2311.02818","title":"Signal Processing Meets SGD: From Momentum to Filter","created":"2023-11-06","cited_by_count":1,"area":null},{"id":"2402.01621","title":"Stochastic Two Points Method for Deep Model Zeroth-order Optimization","created":"2024-02-02","cited_by_count":1,"area":null},{"id":"2606.28879","title":"Analysis of Adam Algorithms for Stochastic Dynamic Systems","created":"2026-06-27","cited_by_count":1,"area":null},{"id":"2507.08913","title":"Revisiting Convergence: Shuffling Complexity Beyond Lipschitz Smoothness","created":"2025-07-11","cited_by_count":0,"area":null},{"id":"2603.07122","title":"Combining Adam and its Inverse Counterpart to Enhance Generalization of Deep Learning Optimizers","created":"2026-03-07","cited_by_count":0,"area":null},{"id":"2605.19392","title":"Understanding Dynamics of Adam in Zero-Sum Games: An ODE Approach","created":"2026-05-19","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.30276","title":"Why Clipping Matters in AdaGrad? Toward a High-Probability Theory under Generalized Smoothness","created":"2026-08-12","cited_by_count":0,"area":null},{"id":"2609.37787","title":"Adam under Generalized Smoothness with Second-Moment-Type Stochastic Gradients","created":"2026-09-29","cited_by_count":0,"area":null}],"next_cursor":null}