{"total":19,"rows":[{"id":"2409.20325","title":"Old Optimizer, New Norm: An Anthology","created":"2024-09-30","cited_by_count":193,"area":null},{"id":"2502.07529","title":"Training Deep Learning Models with Norm-Constrained LMOs","created":"2025-02-11","cited_by_count":192,"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":"2503.20762","title":"ASGO: Adaptive Structured Gradient Optimization","created":"2025-03-26","cited_by_count":57,"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":"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":"2511.11466","title":"Non-Euclidean SGD for Structured Optimization: Unified Analysis and Improved Rates","created":"2025-11-14","cited_by_count":8,"area":null},{"id":"2102.07927","title":"Structured Dropout Variational Inference for Bayesian Neural Networks","created":"2021-02-16","cited_by_count":7,"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":"2604.17423","title":"A unified convergence theory for adaptive first-order methods in the nonconvex case, including AdaNorm, full and diagonal AdaGrad and Muon","created":"2026-04-19","cited_by_count":2,"area":null},{"id":"2606.02365","title":"FOAM: Frequency and Operator Error-Based Adaptive Damping Method for Reducing Staleness-Oriented Error for Shampoo","created":"2026-06-01","cited_by_count":2,"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":"2604.02505","title":"Optimal Projection-Free Adaptive SGD for Matrix Optimization","created":"2026-04-02","cited_by_count":1,"area":null},{"id":"2104.05447","title":"Meta-Regularization: An Approach to Adaptive Choice of the Learning Rate in Gradient Descent","created":"2021-04-12","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.22669","title":"Clipping the Price of Adaptivity at the Tail","created":"2026-06-21","cited_by_count":0,"area":null},{"id":"2608.01997","title":"AOS: Adaptive Optimizer Switching via Training-State Signals for Faster Convergence and Better Generalization","created":"2026-08-03","cited_by_count":0,"area":null}],"next_cursor":null}