{"total":18,"rows":[{"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":"2205.02160","title":"Making SGD Parameter-Free","created":"2022-05-04","cited_by_count":50,"area":null},{"id":"2201.07877","title":"PDE-Based Optimal Strategy for Unconstrained Online Learning","created":"2022-01-19","cited_by_count":27,"area":null},{"id":"2305.17570","title":"Auditing Fairness by Betting","created":"2023-05-27","cited_by_count":25,"area":null},{"id":"2402.03126","title":"How Free is Parameter-Free Stochastic Optimization?","created":"2024-02-05","cited_by_count":12,"area":null},{"id":"2305.14916","title":"Tuning-Free Maximum Likelihood Training of Latent Variable Models via Coin Betting","created":"2023-05-24","cited_by_count":11,"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":"2205.06846","title":"Optimal Comparator Adaptive Online Learning with Switching Cost","created":"2022-05-13","cited_by_count":9,"area":null},{"id":"2203.10327","title":"Implicit Parameter-free Online Learning with Truncated Linear Models","created":"2022-03-19","cited_by_count":8,"area":null},{"id":"2301.11294","title":"Coin Sampling: Gradient-Based Bayesian Inference without Learning Rates","created":"2023-01-26","cited_by_count":8,"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":"2306.00201","title":"Generalized Implicit Follow-The-Regularized-Leader","created":"2023-05-31","cited_by_count":3,"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":"2405.04376","title":"Towards Stability of Parameter-Free Optimization","created":"2024-05-07","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":"2204.01705","title":"Learning to Accelerate by the Methods of Step-size Planning","created":"2022-04-01","cited_by_count":0,"area":null},{"id":"2311.13877","title":"Locally Optimal Descent for Dynamic Stepsize Scheduling","created":"2023-11-23","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}],"next_cursor":null}