{"total":40,"rows":[{"id":"2305.18471","title":"Convergence of AdaGrad for Non-convex Objectives: Simple Proofs and Relaxed Assumptions","created":"2023-05-29","cited_by_count":57,"area":null},{"id":"2302.14843","title":"High Probability Convergence of Stochastic Gradient Methods","created":"2023-02-28","cited_by_count":49,"area":null},{"id":"2302.06570","title":"Beyond Uniform Smoothness: A Stopped Analysis of Adaptive SGD","created":"2023-02-13","cited_by_count":41,"area":null},{"id":"2302.08783","title":"SGD with AdaGrad Stepsizes: Full Adaptivity with High Probability to Unknown Parameters, Unbounded Gradients and Affine Variance","created":"2023-02-17","cited_by_count":30,"area":null},{"id":"2210.14355","title":"Parameter-free Regret in High Probability with Heavy Tails","created":"2022-10-25","cited_by_count":28,"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":"2406.15244","title":"AdaGrad under Anisotropic Smoothness","created":"2024-06-21","cited_by_count":22,"area":null},{"id":"2402.03982","title":"On Convergence of Adam for Stochastic Optimization under Relaxed Assumptions","created":"2024-02-06","cited_by_count":21,"area":null},{"id":"2206.00743","title":"Nest Your Adaptive Algorithm for Parameter-Agnostic Nonconvex Minimax Optimization","created":"2022-06-01","cited_by_count":16,"area":null},{"id":"2406.04592","title":"Provable Complexity Improvement of AdaGrad over SGD: Upper and Lower Bounds in Stochastic Non-Convex Optimization","created":"2024-06-07","cited_by_count":16,"area":null},{"id":"2211.01851","title":"Adaptive Stochastic Variance Reduction for Non-convex Finite-Sum Minimization","created":"2022-11-03","cited_by_count":15,"area":null},{"id":"2402.13794","title":"Revisiting Convergence of AdaGrad with Relaxed Assumptions","created":"2024-02-21","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":"2209.14827","title":"On the Convergence of AdaGrad(Norm) on $\\R^{d}$: Beyond Convexity, Non-Asymptotic Rate and Acceleration","created":"2022-09-29","cited_by_count":13,"area":null},{"id":"2402.07793","title":"Tuning-Free Stochastic Optimization","created":"2024-02-12","cited_by_count":13,"area":null},{"id":"2402.03126","title":"How Free is Parameter-Free Stochastic Optimization?","created":"2024-02-05","cited_by_count":12,"area":null},{"id":"2210.17478","title":"TiAda: A Time-scale Adaptive Algorithm for Nonconvex Minimax Optimization","created":"2022-10-31","cited_by_count":8,"area":null},{"id":"2211.01832","title":"Extra-Newton: A First Approach to Noise-Adaptive Accelerated Second-Order Methods","created":"2022-11-03","cited_by_count":8,"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":"2402.11215","title":"AdAdaGrad: Adaptive Batch Size Schemes for Adaptive Gradient Methods","created":"2024-02-17","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":"2209.14853","title":"META-STORM: Generalized Fully-Adaptive Variance Reduced SGD for Unbounded Functions","created":"2022-09-29","cited_by_count":5,"area":null},{"id":"2307.13680","title":"High Probability Analysis for Non-Convex Stochastic Optimization with Clipping","created":"2023-07-25","cited_by_count":5,"area":null},{"id":"2402.02951","title":"Dynamic Byzantine-Robust Learning: Adapting to Switching Byzantine Workers","created":"2024-02-05","cited_by_count":5,"area":null},{"id":"2210.11113","title":"PAC-Bayesian Learning of Optimization Algorithms","created":"2022-10-20","cited_by_count":4,"area":null},{"id":"2512.13123","title":"Stopping Rules for Stochastic Gradient Descent via Anytime-Valid Confidence Sequences","created":"2025-12-15","cited_by_count":4,"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":"2505.19087","title":"Temperature is All You Need for Generalization in Langevin Dynamics and other Markov Processes","created":"2025-05-25","cited_by_count":2,"area":null},{"id":"2509.15399","title":"Adaptive Algorithms with Sharp Convergence Rates for Stochastic Hierarchical Optimization","created":"2025-09-18","cited_by_count":2,"area":null},{"id":"2604.17423","title":"A unified convergence theory for adaptive first-order methods in the nonconvex case, including AdaNorm, full and diagonal AdaGrad and Muon","created":"2026-04-19","cited_by_count":2,"area":null},{"id":"2403.02873","title":"A General Reduction for High-Probability Analysis with General Light-Tailed Distributions","created":"2024-03-05","cited_by_count":1,"area":null},{"id":"2406.02939","title":"Achieving Near-Optimal Convergence for Distributed Minimax Optimization with Adaptive Stepsizes","created":"2024-06-05","cited_by_count":1,"area":null},{"id":"2502.21099","title":"Adaptive Lipschitz-Free Proximal Gradient Methods for Stochastic Composite Nonconvex Optimization","created":"2025-02-28","cited_by_count":1,"area":null},{"id":"2506.08419","title":"Online Learning-guided Learning Rate Adaptation via Gradient Alignment","created":"2025-06-10","cited_by_count":1,"area":null},{"id":"2402.00389","title":"On the $O(\\frac{\\sqrt{d}}{T^{1/4}})$ Convergence Rate of RMSProp and Its Momentum Extension Measured by $\\ell_1$ Norm","created":"2024-02-01","cited_by_count":0,"area":null},{"id":"2411.06573","title":"An Energy-Based Self-Adaptive Learning Rate for Stochastic Gradient Descent: Enhancing Unconstrained Optimization with VAV method","created":"2024-11-10","cited_by_count":0,"area":null},{"id":"2503.09411","title":"Learning Rate Annealing Improves Tuning Robustness in Stochastic Optimization","created":"2025-03-12","cited_by_count":0,"area":null},{"id":"2609.12765","title":"High-Probability Convergence of SGD via Batched Updates","created":"2026-09-11","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.32729","title":"Revisiting AdaGrad in Stochastic Convex Optimization: Last Iterates, High Probability, and Lower Bounds","created":"2026-09-26","cited_by_count":0,"area":null}],"next_cursor":null}