{"total":42,"rows":[{"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":"2102.05858","title":"Achieving Near Instance-Optimality and Minimax-Optimality in Stochastic and Adversarial Linear Bandits Simultaneously","created":"2021-02-11","cited_by_count":48,"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":"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":"2206.14906","title":"A Best-of-Both-Worlds Algorithm for Bandits with Delayed Feedback","created":"2022-06-29","cited_by_count":23,"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.09864","title":"An Algorithm for Stochastic and Adversarial Bandits with Switching Costs","created":"2021-02-19","cited_by_count":19,"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":"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":"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":"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":"2302.09408","title":"Best of Both Worlds Policy Optimization","created":"2023-02-18","cited_by_count":17,"area":null},{"id":"2103.12487","title":"Improved Analysis of the Tsallis-INF Algorithm in Stochastically Constrained Adversarial Bandits and Stochastic Bandits with Adversarial Corruptions","created":"2021-03-23","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":"2206.03098","title":"Better Best of Both Worlds Bounds for Bandits with Switching Costs","created":"2022-06-07","cited_by_count":13,"area":null},{"id":"2212.00884","title":"Pareto Regret Analyses in Multi-objective Multi-armed Bandit","created":"2022-12-01","cited_by_count":13,"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":"2405.16118","title":"Beyond Primal-Dual Methods in Bandits with Stochastic and Adversarial Constraints","created":"2024-05-25","cited_by_count":10,"area":null},{"id":"2410.03284","title":"uniINF: Best-of-Both-Worlds Algorithm for Parameter-Free Heavy-Tailed MABs","created":"2024-10-04","cited_by_count":8,"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.06712","title":"Simple Combinatorial Algorithms for Combinatorial Bandits: Corruptions and Approximations","created":"2021-06-12","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":"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":"2309.16563","title":"CRIMED: Lower and Upper Bounds on Regret for Bandits with Unbounded Stochastic Corruption","created":"2023-09-28","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":"2407.21294","title":"Decentralized and Uncoordinated Learning of Stable Matchings: A Game-Theoretic Approach","created":"2024-07-31","cited_by_count":2,"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":"2211.03285","title":"SLOPT: Bandit Optimization Framework for Mutation-Based Fuzzing","created":"2022-11-07","cited_by_count":1,"area":null},{"id":"2408.08859","title":"Stochastic Bandits Robust to Adversarial Attacks","created":"2024-08-16","cited_by_count":1,"area":null},{"id":"2604.14860","title":"Best of both worlds: Stochastic & adversarial best-arm identification","created":"2026-04-16","cited_by_count":1,"area":null},{"id":"2606.06043","title":"Adaptive Learning Rates with Surrogate Probability for Follow-the-Perturbed-Leader","created":"2026-06-04","cited_by_count":1,"area":null},{"id":"2306.16578","title":"Allocating Divisible Resources on Arms with Unknown and Random Rewards","created":"2023-06-28","cited_by_count":0,"area":null},{"id":"2505.19061","title":"Hierarchical Adversarial Bandits for Online Configuration Optimization","created":"2025-05-25","cited_by_count":0,"area":null}],"next_cursor":null}