{"total":56,"rows":[{"id":"2405.15682","title":"The Road Less Scheduled","created":"2024-05-24","cited_by_count":163,"area":null},{"id":"2306.06101","title":"Prodigy: An Expeditiously Adaptive Parameter-Free Learner","created":"2023-06-09","cited_by_count":133,"area":null},{"id":"2202.05791","title":"The Power of Adaptivity in SGD: Self-Tuning Step Sizes with Unbounded Gradients and Affine Variance","created":"2022-02-11","cited_by_count":61,"area":null},{"id":"2205.02160","title":"Making SGD Parameter-Free","created":"2022-05-04","cited_by_count":50,"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":"2305.16284","title":"DoWG Unleashed: An Efficient Universal Parameter-Free Gradient Descent Method","created":"2023-05-25","cited_by_count":35,"area":null},{"id":"2311.03252","title":"Parameter-Agnostic Optimization under Relaxed Smoothness","created":"2023-11-06","cited_by_count":29,"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":"2111.11309","title":"No-Regret Dynamics in the Fenchel Game: A Unified Framework for Algorithmic Convex Optimization","created":"2021-11-22","cited_by_count":20,"area":null},{"id":"2206.06015","title":"No-Regret Learning in Games with Noisy Feedback: Faster Rates and Adaptivity via Learning Rate Separation","created":"2022-06-13","cited_by_count":17,"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":"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":"2103.06263","title":"Semi-Discrete Optimal Transport: Hardness, Regularization and Numerical Solution","created":"2021-03-10","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":"2402.03126","title":"How Free is Parameter-Free Stochastic Optimization?","created":"2024-02-05","cited_by_count":12,"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":"2402.10898","title":"The Price of Adaptivity in Stochastic Convex Optimization","created":"2024-02-16","cited_by_count":11,"area":null},{"id":"2405.20540","title":"Fully Unconstrained Online Learning","created":"2024-05-30","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":"2106.12261","title":"Learning Under Delayed Feedback: Implicitly Adapting to Gradient Delays","created":"2021-06-23","cited_by_count":7,"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":"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":"2511.20584","title":"A Tale of Two Geometries: Adaptive Optimizers and Non-Euclidean Descent","created":"2025-11-25","cited_by_count":5,"area":null},{"id":"2602.04761","title":"Improved Dimension Dependence for Bandit Convex Optimization with Gradient Variations","created":"2026-02-04","cited_by_count":5,"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":"2201.12302","title":"Adaptive Accelerated (Extra-)Gradient Methods with Variance Reduction","created":"2022-01-28","cited_by_count":4,"area":null},{"id":"2304.04169","title":"SLowcal-SGD: Slow Query Points Improve Local-SGD for Stochastic Convex Optimization","created":"2023-04-09","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.14759","title":"Fault Tolerant ML: Efficient Meta-Aggregation and Synchronous Training","created":"2024-05-23","cited_by_count":3,"area":null},{"id":"2407.12396","title":"Private and Federated Stochastic Convex Optimization: Efficient Strategies for Centralized Systems","created":"2024-07-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":"2510.04685","title":"Parameter-free Algorithms for the Stochastically Extended Adversarial Model","created":"2025-10-06","cited_by_count":3,"area":null},{"id":"2605.11172","title":"Optimistic Dual Averaging Unifies Modern Optimizers","created":"2026-05-11","cited_by_count":3,"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":"2412.19444","title":"Towards Simple and Provable Parameter-Free Adaptive Gradient Methods","created":"2024-12-27","cited_by_count":2,"area":null},{"id":"2501.09621","title":"Weight for Robustness: A Comprehensive Approach towards Optimal Fault-Tolerant Asynchronous ML","created":"2025-01-16","cited_by_count":2,"area":null},{"id":"2606.03831","title":"Online Learning with Gradient-Variation Interval Regret","created":"2026-06-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":"2506.00961","title":"Enhancing Parallelism in Decentralized Stochastic Convex Optimization","created":"2025-06-01","cited_by_count":1,"area":null},{"id":"2506.02563","title":"Privacy-Preserving Federated Convex Optimization: Balancing Partial-Participation and Efficiency via Noise Cancellation","created":"2025-06-03","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":"2511.06597","title":"Optimistic Online-to-Batch Conversions for Accelerated Convergence and Universality","created":"2025-11-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":"2604.02505","title":"Optimal Projection-Free Adaptive SGD for Matrix Optimization","created":"2026-04-02","cited_by_count":1,"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":"2509.21653","title":"A regret minimization approach to fixed-point iterations","created":"2025-09-25","cited_by_count":0,"area":null},{"id":"2604.06525","title":"Stochastic Auto-conditioned Fast Gradient Methods with Optimal Rates","created":"2026-04-07","cited_by_count":0,"area":null},{"id":"2606.12763","title":"Adaptive Weighted Averaging","created":"2026-06-11","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}],"next_cursor":null}