{"total":23,"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.08742","title":"Near-Optimal No-Regret Learning Dynamics for General Convex Games","created":"2022-06-17","cited_by_count":25,"area":null},{"id":"2305.00832","title":"First- and Second-Order Bounds for Adversarial Linear Contextual Bandits","created":"2023-05-01","cited_by_count":19,"area":null},{"id":"2201.11921","title":"Adaptive Best-of-Both-Worlds Algorithm for Heavy-Tailed Multi-Armed Bandits","created":"2022-01-28","cited_by_count":18,"area":null},{"id":"2111.08911","title":"Fast Rates for Nonparametric Online Learning: From Realizability to Learning in Games","created":"2021-11-17","cited_by_count":16,"area":null},{"id":"2303.01673","title":"Near Optimal Memory-Regret Tradeoff for Online Learning","created":"2023-03-03","cited_by_count":15,"area":null},{"id":"2305.17301","title":"Stability-penalty-adaptive follow-the-regularized-leader: Sparsity, game-dependency, and best-of-both-worlds","created":"2023-05-26","cited_by_count":15,"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":"2106.04700","title":"Scale Free Adversarial Multi Armed Bandits","created":"2021-06-08","cited_by_count":12,"area":null},{"id":"2111.05257","title":"Logarithmic Regret from Sublinear Hints","created":"2021-11-09","cited_by_count":12,"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":"2206.02344","title":"Decentralized, Communication- and Coordination-free Learning in Structured Matching Markets","created":"2022-06-06","cited_by_count":11,"area":null},{"id":"2211.06358","title":"Leveraging the Hints: Adaptive Bidding in Repeated First-Price Auctions","created":"2022-11-05","cited_by_count":11,"area":null},{"id":"2107.09572","title":"Best-of-All-Worlds Bounds for Online Learning with Feedback Graphs","created":"2021-07-20","cited_by_count":4,"area":null},{"id":"2310.01756","title":"Improved Algorithms for Adversarial Bandits with Unbounded Losses","created":"2023-10-03","cited_by_count":3,"area":null},{"id":"2202.06150","title":"Adaptive Bandit Convex Optimization with Heterogeneous Curvature","created":"2022-02-12","cited_by_count":2,"area":null},{"id":"2512.07770","title":"Distribution-informed Online Conformal Prediction","created":"2025-12-08","cited_by_count":2,"area":null},{"id":"2409.19092","title":"Federated Online Prediction from Experts with Differential Privacy: Separations and Regret Speed-ups","created":"2024-09-27","cited_by_count":1,"area":null},{"id":"2602.07418","title":"Achieving Optimal Static and Dynamic Regret Simultaneously in Bandits with Deterministic Losses","created":"2026-02-07","cited_by_count":1,"area":null},{"id":"2110.12544","title":"Online estimation and control with optimal pathlength regret","created":"2021-10-24","cited_by_count":0,"area":null},{"id":"2402.17720","title":"The SMART approach to instance-optimal online learning","created":"2024-02-27","cited_by_count":0,"area":null},{"id":"2608.15996","title":"Toward Optimal Second-Order Path-Length Guarantee for Adversarial Multi-Armed Bandits","created":"2026-08-17","cited_by_count":0,"area":null},{"id":"2610.17818","title":"Follow the Perturbed Leader for Linear Bandits: $\\sqrt{T}$ Regret over General Convex Sets","created":"2026-10-13","cited_by_count":0,"area":null}],"next_cursor":null}