{"total":21,"rows":[{"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.06271","title":"Adaptive proximal gradient methods are universal without approximation","created":"2024-02-09","cited_by_count":4,"area":null},{"id":"2401.13971","title":"Stochastic Weakly Convex Optimization Beyond Lipschitz Continuity","created":"2024-01-25","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":"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":"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":"2510.11440","title":"Adaptive Conditional Gradient Descent","created":"2025-10-13","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":"2411.03925","title":"Quantum Algorithm for Sparse Online Learning with Truncated Gradient Descent","created":"2024-11-06","cited_by_count":0,"area":null},{"id":"2507.09380","title":"Robust Spatiotemporal Epidemic Modeling with Integrated Adaptive Outlier Detection","created":"2025-07-12","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":"2510.09923","title":"AutoGD: Automatic Learning Rate Selection for Gradient Descent","created":"2025-10-10","cited_by_count":0,"area":null},{"id":"2510.23362","title":"Robust Non-negative Proximal Gradient Algorithm for Inverse Problems","created":"2025-10-27","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},{"id":"2608.12009","title":"Adaptive Bregman Proximal Stochastic Gradient with a Stabilized Barzilai--Borwein Step Size","created":"2026-08-12","cited_by_count":0,"area":null}],"next_cursor":null}