{"total":37,"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.03921","title":"Online Algorithms with Multiple Predictions","created":"2022-05-08","cited_by_count":22,"area":null},{"id":"2202.08549","title":"Oracle-Efficient Online Learning for Beyond Worst-Case Adversaries","created":"2022-02-17","cited_by_count":21,"area":null},{"id":"2110.13052","title":"Can Q-Learning be Improved with Advice?","created":"2021-10-25","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":"2205.08717","title":"A Regression Approach to Learning-Augmented Online Algorithms","created":"2022-05-18","cited_by_count":12,"area":null},{"id":"2110.11439","title":"(Optimal) Online Bipartite Matching with Degree Information","created":"2021-10-21","cited_by_count":11,"area":null},{"id":"2306.13119","title":"Adversarial Resilience in Sequential Prediction via Abstention","created":"2023-06-22","cited_by_count":11,"area":null},{"id":"2412.08060","title":"An Optimistic Algorithm for Online Convex Optimization with Adversarial Constraints","created":"2024-12-11","cited_by_count":11,"area":null},{"id":"2112.05422","title":"Robustification of Online Graph Exploration Methods","created":"2021-12-10","cited_by_count":10,"area":null},{"id":"2208.06414","title":"Optimistic No-regret Algorithms for Discrete Caching","created":"2022-08-15","cited_by_count":10,"area":null},{"id":"2303.06396","title":"No-regret Algorithms for Fair Resource Allocation","created":"2023-03-11","cited_by_count":9,"area":null},{"id":"2310.11558","title":"Online Algorithms with Uncertainty-Quantified Predictions","created":"2023-10-17","cited_by_count":9,"area":null},{"id":"2202.10590","title":"Online Caching with Optimistic Learning","created":"2022-02-22","cited_by_count":7,"area":null},{"id":"2103.05907","title":"Linear Bandits on Uniformly Convex Sets","created":"2021-03-10","cited_by_count":6,"area":null},{"id":"2112.05353","title":"Learning-Augmented Algorithms for Online Steiner Tree","created":"2021-12-10","cited_by_count":6,"area":null},{"id":"2205.00446","title":"Adaptive Composite Online Optimization: Predictions in Static and Dynamic Environments","created":"2022-05-01","cited_by_count":6,"area":null},{"id":"2211.02703","title":"Online Learning and Bandits with Queried Hints","created":"2022-11-04","cited_by_count":6,"area":null},{"id":"2102.05134","title":"Local and Global Uniform Convexity Conditions","created":"2021-02-09","cited_by_count":4,"area":null},{"id":"2201.02890","title":"Lazy Lagrangians with Predictions for Online Learning","created":"2022-01-08","cited_by_count":4,"area":null},{"id":"2204.09345","title":"Online Caching with no Regret: Optimistic Learning via Recommendations","created":"2022-04-20","cited_by_count":4,"area":null},{"id":"2210.16735","title":"Online Convex Optimization with Long Term Constraints for Predictable Sequences","created":"2022-10-30","cited_by_count":2,"area":null},{"id":"2212.12989","title":"Improved Kernel Alignment Regret Bound for Online Kernel Learning","created":"2022-12-26","cited_by_count":2,"area":null},{"id":"2407.16355","title":"Online Learning with Sublinear Best-Action Queries","created":"2024-07-23","cited_by_count":2,"area":null},{"id":"2605.08287","title":"Multi-Armed Bandits With Best-Action Queries","created":"2026-05-08","cited_by_count":2,"area":null},{"id":"2402.12868","title":"Fast Rates in Stochastic Online Convex Optimization by Exploiting the Curvature of Feasible Sets","created":"2024-02-20","cited_by_count":1,"area":null},{"id":"2506.19752","title":"On the necessity of adaptive regularisation:Optimal anytime online learning on $\\boldsymbol{\\ell_p}$-balls","created":"2025-06-24","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.22191","title":"Bandit Convex Optimization with Gradient Prediction Adaptivity","created":"2026-05-21","cited_by_count":1,"area":null},{"id":"2202.02406","title":"Parameter-free Online Linear Optimization with Side Information via Universal Coin Betting","created":"2022-02-04","cited_by_count":0,"area":null},{"id":"2209.14222","title":"Online Subset Selection using $\\alpha$-Core with no Augmented Regret","created":"2022-09-28","cited_by_count":0,"area":null},{"id":"2301.07530","title":"Online (Non-)Convex Learning via Tempered Optimism","created":"2023-01-18","cited_by_count":0,"area":null},{"id":"2504.03499","title":"Optimistic Learning for Communication Networks","created":"2025-04-04","cited_by_count":0,"area":null},{"id":"2510.07760","title":"VAO: Validation-Aligned Optimization for Cross-Task Generative Auto-Bidding","created":"2025-10-09","cited_by_count":0,"area":null},{"id":"2606.14640","title":"Online Convex Optimization with Sublinear Noisy Probes","created":"2026-06-12","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.04787","title":"Learning-Augmented Algorithms: Guarantees, Construction Mechanisms, and System-Level Implications","created":"2026-09-04","cited_by_count":0,"area":null}],"next_cursor":null}