{"total":22,"rows":[{"id":"2405.15682","title":"The Road Less Scheduled","created":"2024-05-24","cited_by_count":163,"area":null},{"id":"2106.06885","title":"Online Learning with Optimism and Delay","created":"2021-06-13","cited_by_count":33,"area":null},{"id":"2102.00236","title":"Parameter-free Stochastic Optimization of Variationally Coherent Functions","created":"2021-01-30","cited_by_count":27,"area":null},{"id":"2202.07554","title":"Between Stochastic and Adversarial Online Convex Optimization: Improved Regret Bounds via Smoothness","created":"2022-02-15","cited_by_count":21,"area":null},{"id":"2508.07473","title":"Online Convex Optimization with Heavy Tails: Old Algorithms, New Regrets, and Applications","created":"2025-08-10","cited_by_count":17,"area":null},{"id":"2106.04700","title":"Scale Free Adversarial Multi Armed Bandits","created":"2021-06-08","cited_by_count":12,"area":null},{"id":"2305.13946","title":"Data-Dependent Bounds for Online Portfolio Selection Without Lipschitzness and Smoothness","created":"2023-05-23","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":"2303.03272","title":"Accelerated Rates between Stochastic and Adversarial Online Convex Optimization","created":"2023-03-06","cited_by_count":7,"area":null},{"id":"2502.07774","title":"Optimistic Interior Point Methods for Sequential Hypothesis Testing by Betting","created":"2025-02-11","cited_by_count":4,"area":null},{"id":"2101.09603","title":"Optimistic and Adaptive Lagrangian Hedging","created":"2021-01-23","cited_by_count":3,"area":null},{"id":"2204.04964","title":"Projection-free Online Learning with Arbitrary Delays","created":"2022-04-11","cited_by_count":3,"area":null},{"id":"2208.04065","title":"Optimistic Optimisation of Composite Objective with Exponentiated Update","created":"2022-08-08","cited_by_count":3,"area":null},{"id":"2305.12131","title":"Non-stationary Delayed Online Convex Optimization: From Full-information to Bandit Setting","created":"2023-05-20","cited_by_count":3,"area":null},{"id":"2306.00201","title":"Generalized Implicit Follow-The-Regularized-Leader","created":"2023-05-31","cited_by_count":3,"area":null},{"id":"2301.03236","title":"Optimistic Meta-Gradients","created":"2023-01-09","cited_by_count":2,"area":null},{"id":"2309.00656","title":"Local and adaptive mirror descents in extensive-form games","created":"2023-09-01","cited_by_count":2,"area":null},{"id":"2502.15345","title":"Efficiently Solving Discounted MDPs with Predictions on Transition Matrices","created":"2025-02-21","cited_by_count":2,"area":null},{"id":"2203.05920","title":"Generalized Bandit Regret Minimizer Framework in Imperfect Information Extensive-Form Game","created":"2022-03-11","cited_by_count":1,"area":null},{"id":"2405.02188","title":"Optimistic Regret Bounds for Online Learning in Adversarial Markov Decision Processes","created":"2024-05-03","cited_by_count":1,"area":null},{"id":"2502.14790","title":"Bayesian Algorithms for Adversarial Online Learning: from Finite to Infinite Action Spaces","created":"2025-02-20","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}],"next_cursor":null}