{"total":43,"rows":[{"id":"2105.05806","title":"High-Dimensional Experimental Design and Kernel Bandits","created":"2021-05-12","cited_by_count":56,"area":null},{"id":"2205.06811","title":"Nearly Optimal Algorithms for Linear Contextual Bandits with Adversarial Corruptions","created":"2022-05-13","cited_by_count":51,"area":null},{"id":"2110.03580","title":"A Model Selection Approach for Corruption Robust Reinforcement Learning","created":"2021-10-07","cited_by_count":45,"area":null},{"id":"2106.04117","title":"The best of both worlds: stochastic and adversarial episodic MDPs with unknown transition","created":"2021-06-08","cited_by_count":40,"area":null},{"id":"2112.03432","title":"First-Order Regret in Reinforcement Learning with Linear Function Approximation: A Robust Estimation Approach","created":"2021-12-07","cited_by_count":38,"area":null},{"id":"2212.05949","title":"Corruption-Robust Algorithms with Uncertainty Weighting for Nonlinear Contextual Bandits and Markov Decision Processes","created":"2022-12-12","cited_by_count":33,"area":null},{"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":"2109.10963","title":"On Optimal Robustness to Adversarial Corruption in Online Decision Problems","created":"2021-09-22","cited_by_count":21,"area":null},{"id":"2110.12615","title":"Linear Contextual Bandits with Adversarial Corruptions","created":"2021-10-25","cited_by_count":21,"area":null},{"id":"2102.06875","title":"Improved Corruption Robust Algorithms for Episodic Reinforcement Learning","created":"2021-02-13","cited_by_count":20,"area":null},{"id":"2207.14550","title":"Best-of-Both-Worlds Algorithms for Partial Monitoring","created":"2022-07-29","cited_by_count":19,"area":null},{"id":"2211.05632","title":"Contexts can be Cheap: Solving Stochastic Contextual Bandits with Linear Bandit Algorithms","created":"2022-11-08","cited_by_count":19,"area":null},{"id":"2302.13534","title":"Improved Best-of-Both-Worlds Guarantees for Multi-Armed Bandits: FTRL with General Regularizers and Multiple Optimal Arms","created":"2023-02-27","cited_by_count":18,"area":null},{"id":"2205.14775","title":"An Optimization-based Algorithm for Non-stationary Kernel Bandits without Prior Knowledge","created":"2022-05-29","cited_by_count":17,"area":null},{"id":"2206.00557","title":"A Near-Optimal Best-of-Both-Worlds Algorithm for Online Learning with Feedback Graphs","created":"2022-06-01","cited_by_count":17,"area":null},{"id":"2305.18543","title":"Robust Lipschitz Bandits to Adversarial Corruptions","created":"2023-05-29","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":"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":"2206.14912","title":"Best of Both Worlds Model Selection","created":"2022-06-29","cited_by_count":11,"area":null},{"id":"2312.15433","title":"Best-of-Both-Worlds Algorithms for Linear Contextual Bandits","created":"2023-12-24","cited_by_count":11,"area":null},{"id":"2403.05134","title":"Follow-the-Perturbed-Leader with Fr\\'{e}chet-type Tail Distributions: Optimality in Adversarial Bandits and Best-of-Both-Worlds","created":"2024-03-08","cited_by_count":10,"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":"2410.07533","title":"Corruption-Robust Linear Bandits: Minimax Optimality and Gap-Dependent Misspecification","created":"2024-10-10","cited_by_count":7,"area":null},{"id":"2206.07908","title":"Simultaneously Learning Stochastic and Adversarial Bandits with General Graph Feedback","created":"2022-06-16","cited_by_count":6,"area":null},{"id":"2106.04207","title":"Cooperative Stochastic Multi-agent Multi-armed Bandits Robust to Adversarial Corruptions","created":"2021-06-08","cited_by_count":5,"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":"2302.04374","title":"Near-Optimal Adversarial Reinforcement Learning with Switching Costs","created":"2023-02-08","cited_by_count":4,"area":null},{"id":"2310.19794","title":"Robust Causal Bandits for Linear Models","created":"2023-10-30","cited_by_count":4,"area":null},{"id":"2403.03219","title":"LC-Tsallis-INF: Generalized Best-of-Both-Worlds Linear Contextual Bandits","created":"2024-03-05","cited_by_count":4,"area":null},{"id":"2106.11220","title":"Corruption Robust Active Learning","created":"2021-06-21","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":"2207.05437","title":"Simultaneously Learning Stochastic and Adversarial Bandits under the Position-Based Model","created":"2022-07-12","cited_by_count":2,"area":null},{"id":"2307.15154","title":"A/B Testing and Best-arm Identification for Linear Bandits with Robustness to Non-stationarity","created":"2023-07-27","cited_by_count":2,"area":null},{"id":"2312.16489","title":"Best-of-Both-Worlds Linear Contextual Bandits","created":"2023-12-27","cited_by_count":2,"area":null},{"id":"2405.07795","title":"Improved Bound for Robust Causal Bandits with Linear Models","created":"2024-05-13","cited_by_count":2,"area":null},{"id":"2508.18768","title":"Efficient Best-of-Both-Worlds Algorithms for Contextual Combinatorial Semi-Bandits","created":"2025-08-26","cited_by_count":2,"area":null},{"id":"2510.17103","title":"Adapting to Stochastic and Adversarial Losses in Episodic MDPs with Aggregate Bandit Feedback","created":"2025-10-20","cited_by_count":2,"area":null},{"id":"2502.14379","title":"Achieving adaptivity and optimality for multi-armed bandits using Exponential-Kullback Leibler Maillard Sampling","created":"2025-02-20","cited_by_count":1,"area":null},{"id":"2605.10299","title":"Nearly-Optimal Algorithm for Adversarial Kernelized Bandits","created":"2026-05-11","cited_by_count":1,"area":null},{"id":"2509.09933","title":"Multi-Play Combinatorial Semi-Bandit Problem","created":"2025-09-12","cited_by_count":0,"area":null},{"id":"2603.18972","title":"Best-of-Both-Worlds Multi-Dueling Bandits: Unified Algorithms for Stochastic and Adversarial Preferences under Condorcet and Borda Objectives","created":"2026-03-19","cited_by_count":0,"area":null}],"next_cursor":null}