{"total":85,"rows":[{"id":"2409.20325","title":"Old Optimizer, New Norm: An Anthology","created":"2024-09-30","cited_by_count":193,"area":null},{"id":"2309.14322","title":"Small-scale proxies for large-scale Transformer training instabilities","created":"2023-09-25","cited_by_count":183,"area":null},{"id":"2306.06101","title":"Prodigy: An Expeditiously Adaptive Parameter-Free Learner","created":"2023-06-09","cited_by_count":133,"area":null},{"id":"2405.14813","title":"Scalable Optimization in the Modular Norm","created":"2024-05-23","cited_by_count":68,"area":null},{"id":"2310.07831","title":"Optimal Linear Decay Learning Rate Schedules and Further Refinements","created":"2023-10-11","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":"2410.22086","title":"Unlearning as multi-task optimization: A normalized gradient difference approach with an adaptive learning rate","created":"2024-10-29","cited_by_count":31,"area":"safety"},{"id":"2308.02261","title":"Adaptive Proximal Gradient Method for Convex Optimization","created":"2023-08-04","cited_by_count":21,"area":null},{"id":"2303.12277","title":"Stochastic Nonsmooth Convex Optimization with Heavy-Tailed Noises: High-Probability Bound, In-Expectation Rate and Initial Distance Adaptation","created":"2023-03-22","cited_by_count":20,"area":null},{"id":"2306.00144","title":"Mechanic: A Learning Rate Tuner","created":"2023-05-31","cited_by_count":20,"area":null},{"id":"2308.05621","title":"Normalized Gradients for All","created":"2023-08-10","cited_by_count":20,"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":"2402.07793","title":"Tuning-Free Stochastic Optimization","created":"2024-02-12","cited_by_count":13,"area":null},{"id":"2402.02720","title":"Discounted Adaptive Online Learning: Towards Better Regularization","created":"2024-02-05","cited_by_count":12,"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":"2403.07723","title":"On the Last-Iterate Convergence of Shuffling Gradient Methods","created":"2024-03-12","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":"2407.02772","title":"Gradient descent with generalized Newton's method","created":"2024-07-03","cited_by_count":9,"area":null},{"id":"2509.10439","title":"Understanding Outer Optimizers in Local SGD: Learning Rates, Momentum, and Acceleration","created":"2025-09-12","cited_by_count":9,"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":"2503.00703","title":"Towards hyperparameter-free optimization with differential privacy","created":"2025-03-02","cited_by_count":7,"area":null},{"id":"2605.19095","title":"ScheduleFree+: Scaling Learning-Rate-Free & Schedule-Free Learning to Large Language Models","created":"2026-05-18","cited_by_count":7,"area":null},{"id":"2406.01959","title":"Adaptive Variance Reduction for Stochastic Optimization under Weaker Assumptions","created":"2024-06-04","cited_by_count":6,"area":null},{"id":"2412.14291","title":"Projected gradient methods for nonconvex and stochastic smooth optimization: new complexities and auto-conditioned stepsizes","created":"2024-12-18","cited_by_count":6,"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":"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":"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":"2406.02549","title":"Dreamguider: Improved Training free Diffusion-based Conditional Generation","created":"2024-06-04","cited_by_count":4,"area":"diffusion"},{"id":"2311.10886","title":"A Whole New Ball Game: A Primal Accelerated Method for Matrix Games and Minimizing the Maximum of Smooth Functions","created":"2023-11-17","cited_by_count":3,"area":null},{"id":"2401.13971","title":"Stochastic Weakly Convex Optimization Beyond Lipschitz Continuity","created":"2024-01-25","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":"2501.10258","title":"DADA: Dual Averaging with Distance Adaptation","created":"2025-01-17","cited_by_count":3,"area":null},{"id":"2505.24399","title":"LightSAM: Parameter-Agnostic Sharpness-Aware Minimization","created":"2025-05-30","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":"2510.14009","title":"Noise-Adaptive Layerwise Learning Rates: Accelerating Geometry-Aware Optimization for Deep Neural Network Training","created":"2025-10-15","cited_by_count":3,"area":null},{"id":"2602.07145","title":"Convex Dominance in Deep Learning I: A Scaling Law of Loss and Learning Rate","created":"2026-02-06","cited_by_count":3,"area":null},{"id":"2311.18431","title":"On the convergence of adaptive first order methods: proximal gradient and alternating minimization algorithms","created":"2023-11-30","cited_by_count":2,"area":null},{"id":"2405.12521","title":"Unleash Graph Neural Networks from Heavy Tuning","created":"2024-05-21","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":"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":"2506.01052","title":"A Robust $\\widetilde{\\mathcal{O}}(1/\\sqrt{T})$ Rate for Unprojected TD Learning with Linear Function Approximation","created":"2025-06-01","cited_by_count":2,"area":"deeprl"},{"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":"2509.18396","title":"Development of Deep Learning Optimizers: Approaches, Concepts, and Update Rules","created":"2025-09-22","cited_by_count":2,"area":null},{"id":"2510.17067","title":"Convergence of Regret Matching in Potential Games and Constrained Optimization","created":"2025-10-20","cited_by_count":2,"area":null},{"id":"2309.06274","title":"ELRA: Exponential learning rate adaption gradient descent optimization method","created":"2023-09-12","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.02296","title":"Learning-Rate-Free Stochastic Optimization over Riemannian Manifolds","created":"2024-06-04","cited_by_count":1,"area":null},{"id":"2410.05697","title":"Diffusing to the Top: Boost Graph Neural Networks with Minimal Hyperparameter Tuning","created":"2024-10-08","cited_by_count":1,"area":null},{"id":"2501.06954","title":"A Hessian-informed hyperparameter optimization for differential learning rate","created":"2025-01-12","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":"2506.08419","title":"Online Learning-guided Learning Rate Adaptation via Gradient Alignment","created":"2025-06-10","cited_by_count":1,"area":null},{"id":"2506.11336","title":"The Sample Complexity of Parameter-Free Stochastic Convex Optimization","created":"2025-06-12","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":"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":"2602.13112","title":"AdaGrad-Diff: A New Version of the Adaptive Gradient Algorithm","created":"2026-02-13","cited_by_count":1,"area":null},{"id":"2605.18999","title":"Distance-Aware Muon: Adaptive Step Scaling for Normalized Optimization","created":"2026-05-18","cited_by_count":1,"area":null},{"id":"2311.13877","title":"Locally Optimal Descent for Dynamic Stepsize Scheduling","created":"2023-11-23","cited_by_count":0,"area":null},{"id":"2401.03240","title":"Interpreting Adaptive Gradient Methods by Parameter Scaling for Learning-Rate-Free Optimization","created":"2024-01-06","cited_by_count":0,"area":null},{"id":"2402.08818","title":"Corridor Geometry in Gradient-Based Optimization","created":"2024-02-13","cited_by_count":0,"area":null},{"id":"2402.09598","title":"MCMC-driven learning","created":"2024-02-14","cited_by_count":0,"area":null},{"id":"2409.18439","title":"State-free Reinforcement Learning","created":"2024-09-27","cited_by_count":0,"area":"deeprl"},{"id":"2410.18973","title":"Tuning-Free Coreset Markov Chain Monte Carlo via Hot DoG","created":"2024-10-24","cited_by_count":0,"area":null},{"id":"2411.16975","title":"ExpTest: Loss-Curve Hypothesis Testing for Autonomous Learning-Rate Selection in Deep Neural Networks","created":"2024-11-25","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":"2504.09777","title":"Reasoning without Regret","created":"2025-04-14","cited_by_count":0,"area":"lr"},{"id":"2509.14969","title":"Stochastic Adaptive Gradient Descent Without Descent","created":"2025-09-18","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":"2601.15212","title":"ZENITH: Automated Gradient Norm Informed Stochastic Optimization","created":"2026-01-21","cited_by_count":0,"area":null},{"id":"2602.09842","title":"Step-Size Stability in Stochastic Optimization: A Theoretical Perspective","created":"2026-02-10","cited_by_count":0,"area":null},{"id":"2603.09923","title":"OptEMA: Adaptive Exponential Moving Average for Stochastic Optimization with Zero-Noise Optimality","created":"2026-03-10","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":"2604.24708","title":"Scalable Hyperparameter-Divergent Ensemble Training with Automatic Learning Rate Exploration for Large Models","created":"2026-04-27","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":"2606.14970","title":"Zero-order Parameter-free Optimization for LMO-based Methods: Novel Approach for Efficient Fine-tuning","created":"2026-06-12","cited_by_count":0,"area":null},{"id":"2606.22669","title":"Clipping the Price of Adaptivity at the Tail","created":"2026-06-21","cited_by_count":0,"area":null},{"id":"2609.00870","title":"Stochastic Optimization of Tree Tensor Networks","created":"2026-09-01","cited_by_count":0,"area":null},{"id":"2609.38561","title":"Parameter-Free Zeroth-Order Optimization with Ellipsoidal Sampling","created":"2026-09-29","cited_by_count":0,"area":null}],"next_cursor":null}