{"total":50,"rows":[{"id":"2306.06101","title":"Prodigy: An Expeditiously Adaptive Parameter-Free Learner","created":"2023-06-09","cited_by_count":133,"area":null},{"id":"2503.20762","title":"ASGO: Adaptive Structured Gradient Optimization","created":"2025-03-26","cited_by_count":57,"area":null},{"id":"2204.02833","title":"High Probability Bounds for a Class of Nonconvex Algorithms with AdaGrad Stepsize","created":"2022-04-06","cited_by_count":40,"area":null},{"id":"2202.04428","title":"Adapting to Mixing Time in Stochastic Optimization with Markovian Data","created":"2022-02-09","cited_by_count":36,"area":null},{"id":"2305.16284","title":"DoWG Unleashed: An Efficient Universal Parameter-Free Gradient Descent Method","created":"2023-05-25","cited_by_count":35,"area":null},{"id":"2503.10537","title":"Structured Preconditioners in Adaptive Optimization: A Unified Analysis","created":"2025-03-13","cited_by_count":33,"area":null},{"id":"2311.03252","title":"Parameter-Agnostic Optimization under Relaxed Smoothness","created":"2023-11-06","cited_by_count":29,"area":null},{"id":"2101.11075","title":"Adaptivity without Compromise: A Momentumized, Adaptive, Dual Averaged Gradient Method for Stochastic Optimization","created":"2021-01-26","cited_by_count":28,"area":null},{"id":"2406.15244","title":"AdaGrad under Anisotropic Smoothness","created":"2024-06-21","cited_by_count":22,"area":null},{"id":"2212.00309","title":"Differentially Private Adaptive Optimization with Delayed Preconditioners","created":"2022-12-01","cited_by_count":18,"area":null},{"id":"2310.10082","title":"A simple uniformly optimal method without line search for convex optimization","created":"2023-10-16","cited_by_count":18,"area":null},{"id":"2110.11442","title":"Towards Noise-adaptive, Problem-adaptive (Accelerated) Stochastic Gradient Descent","created":"2021-10-21","cited_by_count":16,"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":"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":"2102.09645","title":"SVRG Meets AdaGrad: Painless Variance Reduction","created":"2021-02-18","cited_by_count":13,"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":"2506.23803","title":"SGD with Adaptive Preconditioning: Unified Analysis and Momentum Acceleration","created":"2025-06-30","cited_by_count":12,"area":null},{"id":"2205.11470","title":"Exploiting the Curvature of Feasible Sets for Faster Projection-Free Online Learning","created":"2022-05-23","cited_by_count":10,"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":"2406.02016","title":"Adaptive and Optimal Second-order Optimistic Methods for Minimax Optimization","created":"2024-06-04","cited_by_count":8,"area":null},{"id":"2306.11201","title":"Adaptive Federated Learning with Auto-Tuned Clients","created":"2023-06-19","cited_by_count":7,"area":null},{"id":"2310.14085","title":"Adaptive, Doubly Optimal No-Regret Learning in Strongly Monotone and Exp-Concave Games with Gradient Feedback","created":"2023-10-21","cited_by_count":6,"area":null},{"id":"2110.07435","title":"Adaptive Differentially Private Empirical Risk Minimization","created":"2021-10-14","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":"2504.01898","title":"Analysis of an Idealized Stochastic Polyak Method and its Application to Black-Box Model Distillation","created":"2025-04-02","cited_by_count":5,"area":null},{"id":"2507.09823","title":"Nesterov Finds GRAAL: Optimal and Adaptive Gradient Method for Convex Optimization","created":"2025-07-13","cited_by_count":5,"area":null},{"id":"2101.00935","title":"First-Order Methods for Convex Optimization","created":"2021-01-04","cited_by_count":4,"area":null},{"id":"2107.08011","title":"Adaptive first-order methods revisited: Convex optimization without Lipschitz requirements","created":"2021-07-16","cited_by_count":4,"area":null},{"id":"2109.08282","title":"AdaLoss: A computationally-efficient and provably convergent adaptive gradient method","created":"2021-09-17","cited_by_count":4,"area":null},{"id":"2201.12302","title":"Adaptive Accelerated (Extra-)Gradient Methods with Variance Reduction","created":"2022-01-28","cited_by_count":4,"area":null},{"id":"2304.04172","title":"$\\mu^2$-SGD: Stable Stochastic Optimization via a Double Momentum Mechanism","created":"2023-04-09","cited_by_count":4,"area":null},{"id":"2208.04065","title":"Optimistic Optimisation of Composite Objective with Exponentiated Update","created":"2022-08-08","cited_by_count":3,"area":null},{"id":"2405.19585","title":"The High Line: Exact Risk and Learning Rate Curves of Stochastic Adaptive Learning Rate Algorithms","created":"2024-05-30","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.03524","title":"Finite-Sum Optimization: A New Perspective for Convergence to a Global Solution","created":"2022-02-07","cited_by_count":2,"area":null},{"id":"2308.09187","title":"Distributed Extra-gradient with Optimal Complexity and Communication Guarantees","created":"2023-08-17","cited_by_count":2,"area":null},{"id":"2510.01943","title":"Smooth Quasar-Convex Optimization with Constraints","created":"2025-10-02","cited_by_count":2,"area":null},{"id":"2606.15268","title":"When to use what Schatten-$p$ norm in deep learning?","created":"2026-06-13","cited_by_count":2,"area":null},{"id":"2406.14059","title":"Tracking solutions of time-varying variational inequalities","created":"2024-06-20","cited_by_count":1,"area":null},{"id":"2505.14371","title":"Layer-wise Quantization for Quantized Optimistic Dual Averaging","created":"2025-05-20","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":"2601.20076","title":"Randomized Feasibility Methods for Constrained Optimization with Adaptive Step Sizes","created":"2026-01-27","cited_by_count":1,"area":null},{"id":"2306.17470","title":"Oblivious Stochastic Composite Optimization","created":"2023-06-30","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":"2606.29893","title":"AdaGrad does not adapt to H\\\"older-smoothness for composite objectives","created":"2026-06-29","cited_by_count":0,"area":null},{"id":"2608.12009","title":"Adaptive Bregman Proximal Stochastic Gradient with a Stabilized Barzilai--Borwein Step Size","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}