{"total":11,"rows":[{"id":"2402.10898","title":"The Price of Adaptivity in Stochastic Convex Optimization","created":"2024-02-16","cited_by_count":11,"area":null},{"id":"2408.09074","title":"Gradient-Variation Online Learning under Generalized Smoothness","created":"2024-08-17","cited_by_count":11,"area":null},{"id":"2410.05140","title":"Tuning-Free Bilevel Optimization: New Algorithms and Convergence Analysis","created":"2024-10-07","cited_by_count":5,"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":"2505.21651","title":"AutoSGD: Automatic Learning Rate Selection for Stochastic Gradient Descent","created":"2025-05-27","cited_by_count":2,"area":null},{"id":"2408.07503","title":"Faster Stochastic Optimization with Arbitrary Delays via Asynchronous Mini-Batching","created":"2024-08-14","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":"2601.20076","title":"Randomized Feasibility Methods for Constrained Optimization with Adaptive Step Sizes","created":"2026-01-27","cited_by_count":1,"area":null},{"id":"2509.14969","title":"Stochastic Adaptive Gradient Descent Without Descent","created":"2025-09-18","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.38561","title":"Parameter-Free Zeroth-Order Optimization with Ellipsoidal Sampling","created":"2026-09-29","cited_by_count":0,"area":null}],"next_cursor":null}