{"total":133,"rows":[{"id":"2306.06101","title":"Prodigy: An Expeditiously Adaptive Parameter-Free Learner","created":"2023-06-09","cited_by_count":133,"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":"2205.02160","title":"Making SGD Parameter-Free","created":"2022-05-04","cited_by_count":50,"area":null},{"id":"2107.00052","title":"Stochastic Gradient Descent-Ascent and Consensus Optimization for Smooth Games: Convergence Analysis under Expected Co-coercivity","created":"2021-06-30","cited_by_count":43,"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":"2402.05738","title":"Implicit Bias and Fast Convergence Rates for Self-attention","created":"2024-02-08","cited_by_count":31,"area":null},{"id":"2311.03252","title":"Parameter-Agnostic Optimization under Relaxed Smoothness","created":"2023-11-06","cited_by_count":29,"area":null},{"id":"2510.09827","title":"An Exploration of Non-Euclidean Gradient Descent: Muon and its Many Variants","created":"2025-10-10","cited_by_count":28,"area":null},{"id":"2102.05320","title":"An Adaptive Stochastic Sequential Quadratic Programming with Differentiable Exact Augmented Lagrangians","created":"2021-02-10","cited_by_count":25,"area":null},{"id":"2202.11632","title":"Mirror Descent Strikes Again: Optimal Stochastic Convex Optimization under Infinite Noise Variance","created":"2022-02-23","cited_by_count":24,"area":null},{"id":"2305.07583","title":"MoMo: Momentum Models for Adaptive Learning Rates","created":"2023-05-12","cited_by_count":24,"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":"2102.09393","title":"On the Convergence of Step Decay Step-Size for Stochastic Optimization","created":"2021-02-18","cited_by_count":21,"area":null},{"id":"2106.11851","title":"Stochastic Polyak Stepsize with a Moving Target","created":"2021-06-22","cited_by_count":19,"area":null},{"id":"2107.00464","title":"On the Convergence of Stochastic Extragradient for Bilinear Games using Restarted Iteration Averaging","created":"2021-06-30","cited_by_count":18,"area":null},{"id":"2202.12328","title":"Cutting Some Slack for SGD with Adaptive Polyak Stepsizes","created":"2022-02-24","cited_by_count":18,"area":null},{"id":"2307.07849","title":"Variational Inference with Gaussian Score Matching","created":"2023-07-15","cited_by_count":17,"area":null},{"id":"2109.05198","title":"Doubly Adaptive Scaled Algorithm for Machine Learning Using Second-Order Information","created":"2021-09-11","cited_by_count":16,"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":"2102.09700","title":"AI-SARAH: Adaptive and Implicit Stochastic Recursive Gradient Methods","created":"2021-02-19","cited_by_count":15,"area":null},{"id":"2301.04935","title":"A Stochastic Proximal Polyak Step Size","created":"2023-01-12","cited_by_count":15,"area":null},{"id":"2306.12747","title":"Don't be so Monotone: Relaxing Stochastic Line Search in Over-Parameterized Models","created":"2023-06-22","cited_by_count":15,"area":null},{"id":"2302.14043","title":"Single-Call Stochastic Extragradient Methods for Structured Non-monotone Variational Inequalities: Improved Analysis under Weaker Conditions","created":"2023-02-27","cited_by_count":14,"area":null},{"id":"2102.09645","title":"SVRG Meets AdaGrad: Painless Variance Reduction","created":"2021-02-18","cited_by_count":13,"area":null},{"id":"2207.08171","title":"SP2: A Second Order Stochastic Polyak Method","created":"2022-07-17","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":"2409.08770","title":"Increasing Both Batch Size and Learning Rate Accelerates Stochastic Gradient Descent","created":"2024-09-13","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":"2206.06900","title":"Grad-GradaGrad? A Non-Monotone Adaptive Stochastic Gradient Method","created":"2022-06-14","cited_by_count":9,"area":null},{"id":"2312.14567","title":"Accelerated Convergence of Stochastic Heavy Ball Method under Anisotropic Gradient Noise","created":"2023-12-22","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":"2403.02648","title":"Remove that Square Root: A New Efficient Scale-Invariant Version of AdaGrad","created":"2024-03-05","cited_by_count":8,"area":null},{"id":"2407.06183","title":"Stepping on the Edge: Curvature Aware Learning Rate Tuners","created":"2024-07-08","cited_by_count":8,"area":null},{"id":"2410.12455","title":"Loss Landscape Characterization of Neural Networks without Over-Parametrization","created":"2024-10-16","cited_by_count":8,"area":null},{"id":"2605.06884","title":"Muon with Nesterov Momentum: Heavy-Tailed Noise and (Randomized) Inexact Polar Decomposition","created":"2026-05-07","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":"2306.11922","title":"No Wrong Turns: The Simple Geometry Of Neural Networks Optimization Paths","created":"2023-06-20","cited_by_count":7,"area":null},{"id":"2307.06306","title":"Locally Adaptive Federated Learning","created":"2023-07-12","cited_by_count":7,"area":null},{"id":"2310.02093","title":"Stochastic Gradient Descent with Preconditioned Polyak Step-size","created":"2023-10-03","cited_by_count":7,"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":"2209.00771","title":"Optimizing the Performative Risk under Weak Convexity Assumptions","created":"2022-09-02","cited_by_count":5,"area":null},{"id":"2312.17369","title":"SANIA: Polyak-type Optimization Framework Leads to Scale Invariant Stochastic Algorithms","created":"2023-12-28","cited_by_count":5,"area":null},{"id":"2402.02342","title":"MetaOptimize: A Framework for Optimizing Step Sizes and Other Meta-parameters","created":"2024-02-04","cited_by_count":5,"area":null},{"id":"2402.15344","title":"Iteration and Stochastic First-order Oracle Complexities of Stochastic Gradient Descent using Constant and Decaying Learning Rates","created":"2024-02-23","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":"2206.13290","title":"Theoretical analysis of Adam using hyperparameters close to one without Lipschitz smoothness","created":"2022-06-27","cited_by_count":4,"area":null},{"id":"2305.18666","title":"BiSLS/SPS: Auto-tune Step Sizes for Stable Bi-level Optimization","created":"2023-05-30","cited_by_count":4,"area":null},{"id":"2312.00209","title":"On the Interplay Between Stepsize Tuning and Progressive Sharpening","created":"2023-11-30","cited_by_count":4,"area":null},{"id":"2111.13162","title":"Randomized Stochastic Gradient Descent Ascent","created":"2021-11-25","cited_by_count":3,"area":null},{"id":"2201.12678","title":"A Stochastic Bundle Method for Interpolating Networks","created":"2022-01-29","cited_by_count":3,"area":null},{"id":"2311.17539","title":"Critical Influence of Overparameterization on Sharpness-aware Minimization","created":"2023-11-29","cited_by_count":3,"area":null},{"id":"2402.05264","title":"AdaBatchGrad: Combining Adaptive Batch Size and Adaptive Step Size","created":"2024-02-07","cited_by_count":3,"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":"2503.00229","title":"Armijo Line-search Can Make (Stochastic) Gradient Descent Provably Faster","created":"2025-02-28","cited_by_count":3,"area":null},{"id":"2105.10011","title":"Comment on Stochastic Polyak Step-Size: Performance of ALI-G","created":"2021-05-20","cited_by_count":2,"area":null},{"id":"2206.05869","title":"On the Convergence to a Global Solution of Shuffling-Type Gradient Algorithms","created":"2022-06-13","cited_by_count":2,"area":null},{"id":"2307.15892","title":"A new Gradient TD Algorithm with only One Step-size: Convergence Rate Analysis using $L$-$\\lambda$ Smoothness","created":"2023-07-29","cited_by_count":2,"area":null},{"id":"2310.12969","title":"Demystifying the Myths and Legends of Nonconvex Convergence of SGD","created":"2023-10-19","cited_by_count":2,"area":null},{"id":"2311.08745","title":"Using Stochastic Gradient Descent to Smooth Nonconvex Functions: Analysis of Implicit Graduated Optimization","created":"2023-11-15","cited_by_count":2,"area":null},{"id":"2403.02347","title":"On the Convergence of Federated Learning Algorithms without Data Similarity","created":"2024-02-29","cited_by_count":2,"area":null},{"id":"2408.03199","title":"Convergence Conditions for Stochastic Line Search Based Optimization of Over-parametrized Models","created":"2024-08-06","cited_by_count":2,"area":null},{"id":"2408.13150","title":"Adaptive Backtracking Line Search","created":"2024-08-23","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":"2503.07687","title":"Personalized Convolutional Dictionary Learning of Physiological Time Series","created":"2025-03-10","cited_by_count":2,"area":null},{"id":"2505.21651","title":"AutoSGD: Automatic Learning Rate Selection for Stochastic Gradient Descent","created":"2025-05-27","cited_by_count":2,"area":null},{"id":"2505.24005","title":"How far away are truly hyperparameter-free learning algorithms?","created":"2025-05-29","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":"2103.03912","title":"Multi-modal anticipation of stochastic trajectories in a dynamic environment with Conditional Variational Autoencoders","created":"2021-03-05","cited_by_count":1,"area":null},{"id":"2108.11713","title":"The Number of Steps Needed for Nonconvex Optimization of a Deep Learning Optimizer is a Rational Function of Batch Size","created":"2021-08-26","cited_by_count":1,"area":null},{"id":"2208.09814","title":"Critical Bach Size Minimizes Stochastic First-Order Oracle Complexity of Deep Learning Optimizer using Hyperparameters Close to One","created":"2022-08-21","cited_by_count":1,"area":null},{"id":"2302.09440","title":"Online Continuous Hyperparameter Optimization for Generalized Linear Contextual Bandits","created":"2023-02-18","cited_by_count":1,"area":null},{"id":"2304.00459","title":"Fast Convergence of Random Reshuffling under Over-Parameterization and the Polyak-\\L ojasiewicz Condition","created":"2023-04-02","cited_by_count":1,"area":null},{"id":"2311.16956","title":"Adaptive Step Sizes for Preconditioned Stochastic Gradient Descent","created":"2023-11-28","cited_by_count":1,"area":null},{"id":"2312.13927","title":"On the Convergence of Loss and Uncertainty-based Active Learning Algorithms","created":"2023-12-21","cited_by_count":1,"area":null},{"id":"2401.06738","title":"(Accelerated) Noise-adaptive Stochastic Heavy-Ball Momentum","created":"2024-01-12","cited_by_count":1,"area":null},{"id":"2403.03362","title":"Level Set Teleportation: An Optimization Perspective","created":"2024-03-05","cited_by_count":1,"area":null},{"id":"2405.04376","title":"Towards Stability of Parameter-Free Optimization","created":"2024-05-07","cited_by_count":1,"area":null},{"id":"2406.05637","title":"A Generalized Version of Chung's Lemma and its Applications","created":"2024-06-09","cited_by_count":1,"area":null},{"id":"2408.05560","title":"Incremental Gauss-Newton Descent for Machine Learning","created":"2024-08-10","cited_by_count":1,"area":null},{"id":"2409.09984","title":"Convergence of Sharpness-Aware Minimization Algorithms using Increasing Batch Size and Decaying Learning Rate","created":"2024-09-16","cited_by_count":1,"area":null},{"id":"2411.07102","title":"Effectively Leveraging Momentum Terms in Stochastic Line Search Frameworks for Fast Optimization of Finite-Sum Problems","created":"2024-11-11","cited_by_count":1,"area":null},{"id":"2412.11400","title":"Scaled Conjugate Gradient Method for Nonconvex Optimization in Deep Neural Networks","created":"2024-12-16","cited_by_count":1,"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":"2502.03701","title":"First-ish Order Methods: Hessian-aware Scalings of Gradient Descent","created":"2025-02-06","cited_by_count":1,"area":null},{"id":"2510.04988","title":"Adaptive Memory Momentum via a Model-Based Framework for Deep Learning Optimization","created":"2025-10-06","cited_by_count":1,"area":null},{"id":"2603.04133","title":"Exploiting Subgradient Sparsity in Max-Plus Neural Networks","created":"2026-03-04","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":"2606.09154","title":"Improved Convergence Analysis of Topology Dependence in Decentralized SGD","created":"2026-06-08","cited_by_count":1,"area":null},{"id":"2606.14259","title":"Beyond a Single Explanation of the Adam--SGD Gap","created":"2026-06-12","cited_by_count":1,"area":null}],"next_cursor":"100"}