{"total":22,"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":"2305.08629","title":"A Unified Analysis of Nonstochastic Delayed Feedback for Combinatorial Semi-Bandits, Linear Bandits, and MDPs","created":"2023-05-15","cited_by_count":15,"area":null},{"id":"2308.10675","title":"A Best-of-both-worlds Algorithm for Bandits with Delayed Feedback with Robustness to Excessive Delays","created":"2023-08-21","cited_by_count":11,"area":null},{"id":"2403.00715","title":"Adaptive Learning Rate for Follow-the-Regularized-Leader: Competitive Analysis and Best-of-Both-Worlds","created":"2024-03-01","cited_by_count":11,"area":null},{"id":"2502.17625","title":"Instance-Dependent Regret Bounds for Learning Two-Player Zero-Sum Games with Bandit Feedback","created":"2025-02-24","cited_by_count":10,"area":null},{"id":"2305.19036","title":"Delayed Bandits: When Do Intermediate Observations Help?","created":"2023-05-30","cited_by_count":8,"area":null},{"id":"2305.07911","title":"Delay-Adapted Policy Optimization and Improved Regret for Adversarial MDP with Delayed Bandit Feedback","created":"2023-05-13","cited_by_count":6,"area":null},{"id":"2408.15158","title":"Delay as Payoff in MAB","created":"2024-08-27","cited_by_count":6,"area":null},{"id":"2503.19856","title":"Capacity-Constrained Online Learning with Delays: Scheduling Frameworks and Regret Trade-offs","created":"2025-03-25","cited_by_count":6,"area":null},{"id":"2506.07595","title":"Exploiting Curvature in Online Convex Optimization with Delayed Feedback","created":"2025-06-09","cited_by_count":6,"area":null},{"id":"2405.16843","title":"Non-stochastic Bandits With Evolving Observations","created":"2024-05-27","cited_by_count":4,"area":null},{"id":"2408.14603","title":"Biased Dueling Bandits with Stochastic Delayed Feedback","created":"2024-08-26","cited_by_count":3,"area":null},{"id":"2602.02634","title":"A Reduction from Delayed to Immediate Feedback for Online Convex Optimization with Improved Guarantees","created":"2026-02-02","cited_by_count":3,"area":null},{"id":"2505.24193","title":"Improved Best-of-Both-Worlds Regret for Bandits with Delayed Feedback","created":"2025-05-30","cited_by_count":2,"area":null},{"id":"2510.02820","title":"Online Learning in the Random Order Model","created":"2025-10-03","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":"2310.11188","title":"Adversarial Bandits with Multi-User Delayed Feedback: Theory and Application","created":"2023-10-17","cited_by_count":1,"area":null},{"id":"2502.18709","title":"Bandit and Delayed Feedback in Online Structured Prediction","created":"2025-02-26","cited_by_count":1,"area":null},{"id":"2606.11711","title":"Capacity-Constrained Online Convex Optimization with Delayed Feedback","created":"2026-06-10","cited_by_count":1,"area":null},{"id":"2602.06404","title":"Near-Optimal Regret for Distributed Adversarial Bandits: A Black-Box Approach","created":"2026-02-06","cited_by_count":0,"area":null},{"id":"2606.16656","title":"Near-Optimal Stochastic Linear Bandits with Delay","created":"2026-06-15","cited_by_count":0,"area":null},{"id":"2608.15036","title":"Lipschitz Bandits with Arbitrary Feedback Delays","created":"2026-08-15","cited_by_count":0,"area":null}],"next_cursor":null}