{"total":19,"rows":[{"id":"2306.06101","title":"Prodigy: An Expeditiously Adaptive Parameter-Free Learner","created":"2023-06-09","cited_by_count":133,"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":"2308.02261","title":"Adaptive Proximal Gradient Method for Convex Optimization","created":"2023-08-04","cited_by_count":21,"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":"2306.11201","title":"Adaptive Federated Learning with Auto-Tuned Clients","created":"2023-06-19","cited_by_count":7,"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":"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":"2402.06271","title":"Adaptive proximal gradient methods are universal without approximation","created":"2024-02-09","cited_by_count":4,"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":"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":"2405.04376","title":"Towards Stability of Parameter-Free Optimization","created":"2024-05-07","cited_by_count":1,"area":null},{"id":"2410.20153","title":"The inexact power augmented Lagrangian method for constrained nonconvex optimization","created":"2024-10-26","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":"2404.09617","title":"Safeguarding adaptive methods: global convergence of Barzilai-Borwein and other stepsize choices","created":"2024-04-15","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":"2511.18167","title":"Sparse Polyak with optimal thresholding operators for high-dimensional M-estimation","created":"2025-11-22","cited_by_count":0,"area":null},{"id":"2602.17545","title":"Adaptive Decentralized Composite Optimization via Three-Operator Splitting","created":"2026-02-19","cited_by_count":0,"area":null},{"id":"2603.29128","title":"Adaptive Delayed-Update Cyclic Algorithm for Variational Inequalities","created":"2026-03-31","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}],"next_cursor":null}