{"total":54,"rows":[{"id":"2306.06101","title":"Prodigy: An Expeditiously Adaptive Parameter-Free Learner","created":"2023-06-09","cited_by_count":133,"area":null},{"id":"2301.07733","title":"Learning-Rate-Free Learning by D-Adaptation","created":"2023-01-18","cited_by_count":113,"area":null},{"id":"2302.12022","title":"DoG is SGD's Best Friend: A Parameter-Free Dynamic Step Size Schedule","created":"2023-02-08","cited_by_count":85,"area":null},{"id":"2301.09604","title":"FedExP: Speeding Up Federated Averaging via Extrapolation","created":"2023-01-23","cited_by_count":69,"area":null},{"id":"2310.05898","title":"Lion Secretly Solves Constrained Optimization: As Lyapunov Predicts","created":"2023-10-09","cited_by_count":51,"area":null},{"id":"2205.02160","title":"Making SGD Parameter-Free","created":"2022-05-04","cited_by_count":50,"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":"2308.06058","title":"Adaptive SGD with Polyak stepsize and Line-search: Robust Convergence and Variance Reduction","created":"2023-08-11","cited_by_count":23,"area":null},{"id":"2110.15412","title":"Stochastic Mirror Descent: Convergence Analysis and Adaptive Variants via the Mirror Stochastic Polyak Stepsize","created":"2021-10-28","cited_by_count":22,"area":null},{"id":"2403.04081","title":"Directional Smoothness and Gradient Methods: Convergence and Adaptivity","created":"2024-03-06","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":"2301.04935","title":"A Stochastic Proximal Polyak Step Size","created":"2023-01-12","cited_by_count":15,"area":null},{"id":"2103.01338","title":"Acceleration via Fractal Learning Rate Schedules","created":"2021-03-01","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":"2406.04142","title":"Stochastic Polyak Step-sizes and Momentum: Convergence Guarantees and Practical Performance","created":"2024-06-06","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":"2311.18718","title":"The Feature Speed Formula: a flexible approach to scale hyper-parameters of deep neural networks","created":"2023-11-30","cited_by_count":11,"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":"2408.09074","title":"Gradient-Variation Online Learning under Generalized Smoothness","created":"2024-08-17","cited_by_count":11,"area":null},{"id":"2407.04358","title":"An Adaptive Stochastic Gradient Method with Non-negative Gauss-Newton Stepsizes","created":"2024-07-05","cited_by_count":10,"area":null},{"id":"2203.00089","title":"Amortized Proximal Optimization","created":"2022-02-28","cited_by_count":9,"area":null},{"id":"2307.14528","title":"Function Value Learning: Adaptive Learning Rates Based on the Polyak Stepsize and Function Splitting in ERM","created":"2023-07-26","cited_by_count":8,"area":null},{"id":"2208.05287","title":"Adaptive Learning Rates for Faster Stochastic Gradient Methods","created":"2022-08-10","cited_by_count":7,"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":"2505.20219","title":"New Perspectives on the Polyak Stepsize: Surrogate Functions and Negative Results","created":"2025-05-26","cited_by_count":6,"area":null},{"id":"2110.07810","title":"Towards Statistical and Computational Complexities of Polyak Step Size Gradient Descent","created":"2021-10-15","cited_by_count":5,"area":null},{"id":"2410.05140","title":"Tuning-Free Bilevel Optimization: New Algorithms and Convergence Analysis","created":"2024-10-07","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":"2602.05813","title":"Where Does Warm-Up Come From? Adaptive Scheduling for Norm-Constrained Optimizers","created":"2026-02-05","cited_by_count":5,"area":null},{"id":"2405.15010","title":"Parameter-free Clipped Gradient Descent Meets Polyak","created":"2024-05-23","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":"2502.14096","title":"Aligned Multi Objective Optimization","created":"2025-02-19","cited_by_count":3,"area":null},{"id":"2505.23081","title":"Gradient Methods with Online Scaling Part I. Theoretical Foundations","created":"2025-05-29","cited_by_count":3,"area":null},{"id":"2503.07687","title":"Personalized Convolutional Dictionary Learning of Physiological Time Series","created":"2025-03-10","cited_by_count":2,"area":null},{"id":"2506.12648","title":"Glocal Smoothness: Line search and adaptive step sizes can help in theory too!","created":"2025-06-14","cited_by_count":2,"area":null},{"id":"2509.09802","title":"Sparse Polyak: an adaptive step size rule for high-dimensional M-estimation","created":"2025-09-11","cited_by_count":2,"area":null},{"id":"2511.07767","title":"Taking the Road Less Scheduled with Adaptive Polyak Steps","created":"2025-11-11","cited_by_count":2,"area":null},{"id":"2512.02342","title":"Safeguarded Stochastic Polyak Step Sizes for Non-smooth Optimization: Robust Performance Without Small (Sub)Gradients","created":"2025-12-02","cited_by_count":2,"area":null},{"id":"2412.17082","title":"MARINA-P: Superior Performance in Non-smooth Federated Optimization with Adaptive Stepsizes","created":"2024-12-22","cited_by_count":1,"area":null},{"id":"2507.05482","title":"Stein Diffusion Guidance: Training-Free Posterior Correction for Sampling Beyond High-Density Regions","created":"2025-07-07","cited_by_count":1,"area":null},{"id":"2509.05811","title":"Simple Optimizers for Convex Aligned Multi-Objective Optimization","created":"2025-09-06","cited_by_count":1,"area":null},{"id":"2509.11007","title":"Gradient Methods with Online Scaling Part II. Practical Aspects","created":"2025-09-13","cited_by_count":1,"area":null},{"id":"2605.10183","title":"Fix the Loss, Not the Radius: Rethinking the Adversarial Perturbation of Sharpness-Aware Minimization","created":"2026-05-11","cited_by_count":1,"area":null},{"id":"2606.01827","title":"Adaptive Sharpness-Aware Minimization with a Polyak-type Step size: A Theory-Grounded Scheduler","created":"2026-06-01","cited_by_count":1,"area":null},{"id":"2402.08818","title":"Corridor Geometry in Gradient-Based Optimization","created":"2024-02-13","cited_by_count":0,"area":null},{"id":"2505.02614","title":"Entropic Mirror Descent for Linear Systems: Polyak's Stepsize and Implicit Bias","created":"2025-05-05","cited_by_count":0,"area":null},{"id":"2509.14969","title":"Stochastic Adaptive Gradient Descent Without Descent","created":"2025-09-18","cited_by_count":0,"area":null},{"id":"2604.01279","title":"Sven: Singular Value Descent as a Computationally Efficient Natural Gradient Method","created":"2026-04-01","cited_by_count":0,"area":null},{"id":"2604.13393","title":"A short proof of near-linear convergence of adaptive gradient descent under fourth-order growth and convexity","created":"2026-04-15","cited_by_count":0,"area":null},{"id":"2606.07841","title":"Large-scale empirical tuning and comparison of default optimizers for variational inference","created":"2026-06-05","cited_by_count":0,"area":null},{"id":"2609.26581","title":"Polyak-Type Extragradient Methods for Monotone Root-Finding Problems","created":"2026-09-22","cited_by_count":0,"area":null},{"id":"2609.33383","title":"Local LMO is Secretly a Projection Method!","created":"2026-09-27","cited_by_count":0,"area":null}],"next_cursor":null}