{"total":65,"rows":[{"id":"2110.14177","title":"Federated Linear Contextual Bandits","created":"2021-10-27","cited_by_count":61,"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":"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.02978","title":"Robust Stochastic Linear Contextual Bandits Under Adversarial Attacks","created":"2021-06-05","cited_by_count":33,"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":"2310.14550","title":"Corruption-Robust Offline Reinforcement Learning with General Function Approximation","created":"2023-10-23","cited_by_count":31,"area":"offlinerl"},{"id":"2102.05776","title":"Defense Against Reward Poisoning Attacks in Reinforcement Learning","created":"2021-02-10","cited_by_count":21,"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":"2208.13663","title":"Understanding the Limits of Poisoning Attacks in Episodic Reinforcement Learning","created":"2022-08-29","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":"2109.05700","title":"Exploiting Heterogeneity in Robust Federated Best-Arm Identification","created":"2021-09-13","cited_by_count":20,"area":null},{"id":"2206.01888","title":"Reward Poisoning Attacks on Offline Multi-Agent Reinforcement Learning","created":"2022-06-04","cited_by_count":20,"area":"offlinerl"},{"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":"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":"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":"2402.08991","title":"Towards Robust Model-Based Reinforcement Learning Against Adversarial Corruption","created":"2024-02-14","cited_by_count":12,"area":"deeprl"},{"id":"2105.11802","title":"Bias-Robust Bayesian Optimization via Dueling Bandits","created":"2021-05-25","cited_by_count":11,"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":"2312.15433","title":"Best-of-Both-Worlds Algorithms for Linear Contextual Bandits","created":"2023-12-24","cited_by_count":11,"area":null},{"id":"2106.02979","title":"Syndicated Bandits: A Framework for Auto Tuning Hyper-parameters in Contextual Bandit Algorithms","created":"2021-06-05","cited_by_count":10,"area":null},{"id":"2110.09008","title":"When Are Linear Stochastic Bandits Attackable?","created":"2021-10-18","cited_by_count":10,"area":null},{"id":"2102.07711","title":"Saving Stochastic Bandits from Poisoning Attacks via Limited Data Verification","created":"2021-02-15","cited_by_count":9,"area":"safety"},{"id":"2404.10776","title":"Nearly Optimal Algorithms for Contextual Dueling Bandits from Adversarial Feedback","created":"2024-04-16","cited_by_count":9,"area":"alignment"},{"id":"2110.11763","title":"Game Redesign in No-regret Game Playing","created":"2021-10-18","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":"2102.12722","title":"Combinatorial Bandits under Strategic Manipulations","created":"2021-02-25","cited_by_count":6,"area":null},{"id":"2205.04134","title":"Federated Multi-Armed Bandits Under Byzantine Attacks","created":"2022-05-09","cited_by_count":6,"area":null},{"id":"2301.12595","title":"Adversarial Attacks on Adversarial Bandits","created":"2023-01-30","cited_by_count":6,"area":null},{"id":"2305.19218","title":"Adversarial Attacks on Online Learning to Rank with Stochastic Click Models","created":"2023-05-30","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":"2110.08449","title":"Adversarial Attacks on Gaussian Process Bandits","created":"2021-10-16","cited_by_count":5,"area":null},{"id":"2206.02834","title":"Collaborative Linear Bandits with Adversarial Agents: Near-Optimal Regret Bounds","created":"2022-06-06","cited_by_count":5,"area":null},{"id":"2406.00551","title":"Strategic Linear Contextual Bandits","created":"2024-06-01","cited_by_count":5,"area":null},{"id":"2602.23116","title":"Provably Efficient Regularized Online RLHF with Generalized Bilinear Preferences","created":"2026-02-26","cited_by_count":5,"area":"alignment"},{"id":"2210.14483","title":"Robust Contextual Linear Bandits","created":"2022-10-26","cited_by_count":4,"area":null},{"id":"2309.02476","title":"Optimal Sample Selection Through Uncertainty Estimation and Its Application in Deep Learning","created":"2023-09-05","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":"2502.06142","title":"Linear Bandits with Partially Observable Features","created":"2025-02-10","cited_by_count":4,"area":null},{"id":"2112.05367","title":"Efficient Action Poisoning Attacks on Linear Contextual Bandits","created":"2021-12-10","cited_by_count":3,"area":null},{"id":"2310.04768","title":"Online Corrupted User Detection and Regret Minimization","created":"2023-10-07","cited_by_count":3,"area":null},{"id":"2310.15932","title":"Online Robust Mean Estimation","created":"2023-10-24","cited_by_count":3,"area":null},{"id":"2505.13768","title":"Augmenting Online RL with Offline Data is All You Need: A Unified Hybrid RL Algorithm Design and Analysis","created":"2025-05-19","cited_by_count":3,"area":null},{"id":"2505.21938","title":"Practical Adversarial Attacks on Stochastic Bandits via Fake Data Injection","created":"2025-05-28","cited_by_count":3,"area":null},{"id":"2207.14391","title":"Distributed Stochastic Bandit Learning with Delayed Context Observation","created":"2022-07-28","cited_by_count":2,"area":null},{"id":"2402.13487","title":"Stealthy Adversarial Attacks on Stochastic Multi-Armed Bandits","created":"2024-02-21","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":"2405.11204","title":"Learning from Imperfect Human Feedback: a Tale from Corruption-Robust Dueling","created":"2024-05-18","cited_by_count":2,"area":"alignment"},{"id":"2409.03237","title":"Robust Q-Learning under Corrupted Rewards","created":"2024-09-05","cited_by_count":2,"area":"deeprl"},{"id":"2410.19705","title":"Robust Thompson Sampling Algorithms Against Reward Poisoning Attacks","created":"2024-10-25","cited_by_count":2,"area":null},{"id":"2307.13903","title":"Corruption-Robust Lipschitz Contextual Search","created":"2023-07-26","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":"2509.08933","title":"Corruption-Tolerant Asynchronous Q-Learning with Near-Optimal Rates","created":"2025-09-10","cited_by_count":1,"area":"deeprl"},{"id":"2602.10971","title":"A Jointly Efficient and Optimal Algorithm for Heteroskedastic Generalized Linear Bandits with Adversarial Corruptions","created":"2026-02-11","cited_by_count":1,"area":null},{"id":"2605.30976","title":"Batched Stochastic Linear Bandits with 1-Bit Communication Constraints","created":"2026-05-29","cited_by_count":1,"area":null},{"id":"2304.11741","title":"Robust and differentially private stochastic linear bandits","created":"2023-04-23","cited_by_count":0,"area":null},{"id":"2305.00154","title":"Learning to Seek: Multi-Agent Online Source Seeking Against Non-Stochastic Disturbances","created":"2023-04-29","cited_by_count":0,"area":null},{"id":"2311.04731","title":"Robust Best-arm Identification in Linear Bandits","created":"2023-11-08","cited_by_count":0,"area":null},{"id":"2602.14543","title":"Truly Adapting to Adversarial Constraints in Constrained MABs","created":"2026-02-16","cited_by_count":0,"area":null},{"id":"2603.12530","title":"Mixing Makes Markovian Contexts Cheap for Linear Bandits","created":"2026-03-13","cited_by_count":0,"area":null},{"id":"2603.13356","title":"Learning When to Trust in Contextual Social Bandits","created":"2026-03-09","cited_by_count":0,"area":null},{"id":"2603.15596","title":"Robust and Computationally Efficient Linear Contextual Bandits under Adversarial Corruption and Heavy-Tailed Noise","created":"2026-03-16","cited_by_count":0,"area":null},{"id":"2609.38659","title":"Bandits with Multiple Optimal Arms: Minimax Regret and Non-Adaptivity","created":"2026-09-29","cited_by_count":0,"area":null}],"next_cursor":null}