{"total":57,"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":"2102.01046","title":"Impossible Tuning Made Possible: A New Expert Algorithm and Its Applications","created":"2021-02-01","cited_by_count":52,"area":null},{"id":"2205.02160","title":"Making SGD Parameter-Free","created":"2022-05-04","cited_by_count":50,"area":null},{"id":"2203.00444","title":"Parameter-free Mirror Descent","created":"2022-02-26","cited_by_count":45,"area":null},{"id":"2302.03775","title":"Optimal Stochastic Non-smooth Non-convex Optimization through Online-to-Non-convex Conversion","created":"2023-02-07","cited_by_count":45,"area":null},{"id":"2110.14099","title":"Tight Concentrations and Confidence Sequences from the Regret of Universal Portfolio","created":"2021-10-27","cited_by_count":43,"area":null},{"id":"2310.07831","title":"Optimal Linear Decay Learning Rate Schedules and Further Refinements","created":"2023-10-11","cited_by_count":43,"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":"2302.08783","title":"SGD with AdaGrad Stepsizes: Full Adaptivity with High Probability to Unknown Parameters, Unbounded Gradients and Affine Variance","created":"2023-02-17","cited_by_count":30,"area":null},{"id":"2210.14355","title":"Parameter-free Regret in High Probability with Heavy Tails","created":"2022-10-25","cited_by_count":28,"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":"2102.06622","title":"MetaGrad: Adaptation using Multiple Learning Rates in Online Learning","created":"2021-02-12","cited_by_count":26,"area":null},{"id":"2306.04923","title":"Unconstrained Online Learning with Unbounded Losses","created":"2023-06-08","cited_by_count":25,"area":null},{"id":"2306.00144","title":"Mechanic: A Learning Rate Tuner","created":"2023-05-31","cited_by_count":20,"area":null},{"id":"2308.05621","title":"Normalized Gradients for All","created":"2023-08-10","cited_by_count":20,"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":"2405.16642","title":"Fast TRAC: A Parameter-Free Optimizer for Lifelong Reinforcement Learning","created":"2024-05-26","cited_by_count":17,"area":"deeprl"},{"id":"2402.13903","title":"Dealing with unbounded gradients in stochastic saddle-point optimization","created":"2024-02-21","cited_by_count":16,"area":null},{"id":"2102.01623","title":"Adversarial Tracking Control via Strongly Adaptive Online Learning with Memory","created":"2021-02-02","cited_by_count":14,"area":null},{"id":"2202.05630","title":"Scale-free Unconstrained Online Learning for Curved Losses","created":"2022-02-11","cited_by_count":13,"area":null},{"id":"2402.07793","title":"Tuning-Free Stochastic Optimization","created":"2024-02-12","cited_by_count":13,"area":null},{"id":"2111.05257","title":"Logarithmic Regret from Sublinear Hints","created":"2021-11-09","cited_by_count":12,"area":null},{"id":"2402.02720","title":"Discounted Adaptive Online Learning: Towards Better Regularization","created":"2024-02-05","cited_by_count":12,"area":null},{"id":"2402.03126","title":"How Free is Parameter-Free Stochastic Optimization?","created":"2024-02-05","cited_by_count":12,"area":null},{"id":"2301.13349","title":"Unconstrained Dynamic Regret via Sparse Coding","created":"2023-01-31","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.11470","title":"Exploiting the Curvature of Feasible Sets for Faster Projection-Free Online Learning","created":"2022-05-23","cited_by_count":10,"area":null},{"id":"2211.01357","title":"Quasi-Newton Steps for Efficient Online Exp-Concave Optimization","created":"2022-11-02","cited_by_count":10,"area":null},{"id":"2405.19175","title":"Online Linear Regression in Dynamic Environments via Discounting","created":"2024-05-29","cited_by_count":10,"area":null},{"id":"2405.20540","title":"Fully Unconstrained Online Learning","created":"2024-05-30","cited_by_count":10,"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":"2406.01577","title":"An Equivalence Between Static and Dynamic Regret Minimization","created":"2024-06-03","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":"2309.16044","title":"Improving Adaptive Online Learning Using Refined Discretization","created":"2023-09-27","cited_by_count":8,"area":null},{"id":"2102.07521","title":"Distributed Online Learning for Joint Regret with Communication Constraints","created":"2021-02-15","cited_by_count":5,"area":null},{"id":"2210.06593","title":"Differentially Private Online-to-Batch for Smooth Losses","created":"2022-10-12","cited_by_count":5,"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":"2507.05478","title":"Dynamic Regret Reduces to Kernelized Static Regret","created":"2025-07-07","cited_by_count":5,"area":null},{"id":"2105.03681","title":"Universal Online Convex Optimization Meets Second-order Bounds","created":"2021-05-08","cited_by_count":4,"area":null},{"id":"2112.14586","title":"Isotuning With Applications To Scale-Free Online Learning","created":"2021-12-29","cited_by_count":4,"area":null},{"id":"2204.04964","title":"Projection-free Online Learning with Arbitrary Delays","created":"2022-04-11","cited_by_count":3,"area":null},{"id":"2402.13530","title":"Best of Many in Both Worlds: Online Resource Allocation with Predictions under Unknown Arrival Model","created":"2024-02-21","cited_by_count":3,"area":null},{"id":"2502.04543","title":"Sparsity-Based Interpolation of External, Internal and Swap Regret","created":"2025-02-06","cited_by_count":3,"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":"2305.19605","title":"Parameter-free projected gradient descent","created":"2023-05-31","cited_by_count":2,"area":null},{"id":"2602.06902","title":"Parameter-free Dynamic Regret: Time-varying Movement Costs, Delayed Feedback, and Memory","created":"2026-02-06","cited_by_count":2,"area":null},{"id":"2603.25916","title":"Parameter-Free Dynamic Regret for Unconstrained Linear Bandits","created":"2026-03-26","cited_by_count":2,"area":null},{"id":"2606.03831","title":"Online Learning with Gradient-Variation Interval Regret","created":"2026-06-02","cited_by_count":2,"area":null},{"id":"2105.04129","title":"Parameter-free Gradient Temporal Difference Learning","created":"2021-05-10","cited_by_count":1,"area":null},{"id":"2410.03363","title":"Minimax-optimal and Locally-adaptive Online Nonparametric Regression","created":"2024-10-04","cited_by_count":1,"area":null},{"id":"2505.19741","title":"Minimax Adaptive Online Nonparametric Regression over Besov Spaces","created":"2025-05-26","cited_by_count":1,"area":null},{"id":"2509.08911","title":"Instance-Optimal Matrix Multiplicative Weight Update and Its Quantum Applications","created":"2025-09-10","cited_by_count":1,"area":null},{"id":"2604.11151","title":"Gradient-Variation Regret Bounds for Unconstrained Online Learning","created":"2026-04-13","cited_by_count":1,"area":null},{"id":"2605.18999","title":"Distance-Aware Muon: Adaptive Step Scaling for Normalized Optimization","created":"2026-05-18","cited_by_count":1,"area":null},{"id":"2602.11747","title":"High-Probability Minimax Adaptive Estimation in Besov Spaces via Online-to-Batch","created":"2026-02-12","cited_by_count":0,"area":null},{"id":"2603.28201","title":"A Perturbation Approach to Unconstrained Linear Bandits","created":"2026-03-30","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}