{"total":44,"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":"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":"2207.02121","title":"Adapting to Online Label Shift with Provable Guarantees","created":"2022-07-05","cited_by_count":26,"area":null},{"id":"2402.01567","title":"Understanding Adam Optimizer via Online Learning of Updates: Adam is FTRL in Disguise","created":"2024-02-02","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":"2302.04552","title":"Optimistic Online Mirror Descent for Bridging Stochastic and Adversarial Online Convex Optimization","created":"2023-02-09","cited_by_count":22,"area":null},{"id":"2306.00144","title":"Mechanic: A Learning Rate Tuner","created":"2023-05-31","cited_by_count":20,"area":null},{"id":"2405.09742","title":"Random Scaling and Momentum for Non-smooth Non-convex Optimization","created":"2024-05-16","cited_by_count":19,"area":null},{"id":"2309.08911","title":"Efficient Methods for Non-stationary Online Learning","created":"2023-09-16","cited_by_count":15,"area":null},{"id":"2402.02720","title":"Discounted Adaptive Online Learning: Towards Better Regularization","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":"2305.19570","title":"Online Label Shift: Optimal Dynamic Regret meets Practical Algorithms","created":"2023-05-31","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":"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":"2309.16044","title":"Improving Adaptive Online Learning Using Refined Discretization","created":"2023-09-27","cited_by_count":8,"area":null},{"id":"2205.01921","title":"Second Order Path Variationals in Non-Stationary Online Learning","created":"2022-05-04","cited_by_count":7,"area":null},{"id":"2206.09257","title":"Optimal Dynamic Regret in LQR Control","created":"2022-06-18","cited_by_count":6,"area":null},{"id":"2405.19705","title":"Universal Online Convex Optimization with $1$ Projection per Round","created":"2024-05-30","cited_by_count":6,"area":null},{"id":"2503.00419","title":"Heavy-Tailed Linear Bandits: Huber Regression with One-Pass Update","created":"2025-03-01","cited_by_count":5,"area":null},{"id":"2505.22899","title":"On the Dynamic Regret of Following the Regularized Leader: Optimism with History Pruning","created":"2025-05-28","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":"2304.04172","title":"$\\mu^2$-SGD: Stable Stochastic Optimization via a Double Momentum Mechanism","created":"2023-04-09","cited_by_count":4,"area":null},{"id":"2510.01867","title":"Universal Dynamic Regret and Constraint Violation Bounds for Constrained Online Convex Optimization","created":"2025-10-02","cited_by_count":4,"area":null},{"id":"2602.08372","title":"Dynamic Regret via Discounted-to-Dynamic Reduction with Applications to Curved Losses and Adam Optimizer","created":"2026-02-09","cited_by_count":4,"area":null},{"id":"2506.06606","title":"Stacey: Promoting Stochastic Steepest Descent via Accelerated $\\ell_p$-Smooth Nonconvex Optimization","created":"2025-06-07","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":"2601.15984","title":"Partially Lazy Gradient Descent for Smoothed Online Learning","created":"2026-01-22","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":"2506.11336","title":"The Sample Complexity of Parameter-Free Stochastic Convex Optimization","created":"2025-06-12","cited_by_count":1,"area":null},{"id":"2511.00637","title":"Stochastic Shortest Path with Sparse Adversarial Costs","created":"2025-11-01","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":"2607.27073","title":"Parameter-Free Dynamic Regret under Heavy-Tailed Noise","created":"2026-07-29","cited_by_count":1,"area":null},{"id":"2306.17470","title":"Oblivious Stochastic Composite Optimization","created":"2023-06-30","cited_by_count":0,"area":null},{"id":"2509.21653","title":"A regret minimization approach to fixed-point iterations","created":"2025-09-25","cited_by_count":0,"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},{"id":"2609.30556","title":"Dynamic Regret in Online Convex Optimization with Indicator Switching Costs","created":"2026-09-24","cited_by_count":0,"area":null}],"next_cursor":null}