{"total":21,"rows":[{"id":"2302.09739","title":"A Blackbox Approach to Best of Both Worlds in Bandits and Beyond","created":"2023-02-20","cited_by_count":30,"area":null},{"id":"2206.00873","title":"Nearly Optimal Best-of-Both-Worlds Algorithms for Online Learning with Feedback Graphs","created":"2022-06-02","cited_by_count":26,"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":"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":"2302.12370","title":"Best-of-Three-Worlds Linear Bandit Algorithm with Variance-Adaptive Regret Bounds","created":"2023-02-24","cited_by_count":14,"area":null},{"id":"2206.06810","title":"Adversarially Robust Multi-Armed Bandit Algorithm with Variance-Dependent Regret Bounds","created":"2022-06-14","cited_by_count":12,"area":null},{"id":"2303.06825","title":"Best-of-three-worlds Analysis for Linear Bandits with Follow-the-regularized-leader Algorithm","created":"2023-03-13","cited_by_count":12,"area":null},{"id":"2202.01850","title":"A Robust Phased Elimination Algorithm for Corruption-Tolerant Gaussian Process Bandits","created":"2022-02-03","cited_by_count":11,"area":null},{"id":"2110.09008","title":"When Are Linear Stochastic Bandits Attackable?","created":"2021-10-18","cited_by_count":10,"area":null},{"id":"2206.02656","title":"A Regret-Variance Trade-Off in Online Learning","created":"2022-06-06","cited_by_count":7,"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":"2301.12595","title":"Adversarial Attacks on Adversarial Bandits","created":"2023-01-30","cited_by_count":6,"area":null},{"id":"2209.12429","title":"Online Submodular Coordination with Bounded Tracking Regret: Theory, Algorithm, and Applications to Multi-Robot Coordination","created":"2022-09-26","cited_by_count":5,"area":null},{"id":"2405.16843","title":"Non-stochastic Bandits With Evolving Observations","created":"2024-05-27","cited_by_count":4,"area":null},{"id":"2504.12606","title":"Robo-SGG: Exploiting Layout-Oriented Normalization and Restitution Can Improve Robust Scene Graph Generation","created":"2025-04-17","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":"2201.01628","title":"Bridging Adversarial and Nonstationary Multi-armed Bandit","created":"2022-01-05","cited_by_count":2,"area":null},{"id":"2407.14111","title":"A Mirror Descent-Based Algorithm for Corruption-Tolerant Distributed Gradient Descent","created":"2024-07-19","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":"2601.11924","title":"Communication-Corruption Coupling and Verification in Cooperative Multi-Objective Bandits","created":"2026-01-17","cited_by_count":1,"area":null},{"id":"2610.14904","title":"Prediction with Expert Advice under Heavy-Tailed Losses","created":"2026-10-10","cited_by_count":0,"area":null}],"next_cursor":null}