{"total":57,"rows":[{"id":"1910.05821","title":"Policy Poisoning in Batch Reinforcement Learning and Control","created":"2019-10-13","cited_by_count":70,"area":"offlinerl"},{"id":"2106.02978","title":"Robust Stochastic Linear Contextual Bandits Under Adversarial Attacks","created":"2021-06-05","cited_by_count":33,"area":null},{"id":"2110.04471","title":"Provably Efficient Black-Box Action Poisoning Attacks Against Reinforcement Learning","created":"2021-10-09","cited_by_count":29,"area":null},{"id":"2102.08492","title":"Reward Poisoning in Reinforcement Learning: Attacks Against Unknown Learners in Unknown Environments","created":"2021-02-16","cited_by_count":26,"area":null},{"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":"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":"2305.18543","title":"Robust Lipschitz Bandits to Adversarial Corruptions","created":"2023-05-29","cited_by_count":15,"area":null},{"id":"2402.01096","title":"Trustworthy Distributed AI Systems: Robustness, Privacy, and Governance","created":"2024-02-02","cited_by_count":14,"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":"2312.15433","title":"Best-of-Both-Worlds Algorithms for Linear Contextual Bandits","created":"2023-12-24","cited_by_count":11,"area":null},{"id":"2106.09993","title":"Accumulative Poisoning Attacks on Real-time Data","created":"2021-06-18","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":"2205.14842","title":"Efficient Reward Poisoning Attacks on Online Deep Reinforcement Learning","created":"2022-05-30","cited_by_count":9,"area":null},{"id":"2102.05018","title":"Robust Bandit Learning with Imperfect Context","created":"2021-02-09","cited_by_count":8,"area":null},{"id":"2110.11763","title":"Game Redesign in No-regret Game Playing","created":"2021-10-18","cited_by_count":8,"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.17071","title":"Adversarial Attacks on Online Learning to Rank with Click Feedback","created":"2023-05-26","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":"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":"2209.03540","title":"Reward Delay Attacks on Deep Reinforcement Learning","created":"2022-09-08","cited_by_count":5,"area":null},{"id":"2305.10681","title":"Black-Box Targeted Reward Poisoning Attack Against Online Deep Reinforcement Learning","created":"2023-05-18","cited_by_count":5,"area":null},{"id":"2502.13457","title":"Provably Efficient Multi-Objective Bandit Algorithms under Preference-Centric Customization","created":"2025-02-19","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":"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.07320","title":"Byzantine-Resilient Decentralized Multi-Armed Bandits","created":"2023-10-11","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":"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":"2310.05308","title":"Adversarial Attacks on Combinatorial Multi-Armed Bandits","created":"2023-10-08","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":"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":"2503.04010","title":"Greedy Algorithm for Structured Bandits: A Sharp Characterization of Asymptotic Success / Failure","created":"2025-03-06","cited_by_count":2,"area":null},{"id":"2602.01658","title":"Efficient Adversarial Attacks on High-dimensional Offline Bandits","created":"2026-02-02","cited_by_count":2,"area":"alignment"},{"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":"2408.12581","title":"Identifying the Best Arm in the Presence of Global Environment Shifts","created":"2024-08-22","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":"2605.02495","title":"Efficient Preference Poisoning Attack on Offline RLHF","created":"2026-05-04","cited_by_count":1,"area":"alignment"},{"id":"2203.00076","title":"Robust Multi-Agent Bandits Over Undirected Graphs","created":"2022-02-28","cited_by_count":0,"area":null},{"id":"2209.05692","title":"Sample Complexity of an Adversarial Attack on UCB-based Best-arm Identification Policy","created":"2022-09-13","cited_by_count":0,"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.02441","title":"Reward Teaching for Federated Multi-armed Bandits","created":"2023-05-03","cited_by_count":0,"area":null},{"id":"2311.01698","title":"Adversarial Attacks on Cooperative Multi-agent Bandits","created":"2023-11-03","cited_by_count":0,"area":null},{"id":"2507.10567","title":"Protocols for Verifying Smooth Strategies in Bandits and Games","created":"2025-07-08","cited_by_count":0,"area":null},{"id":"2507.18975","title":"Secure Best Arm Identification in the Presence of a Copycat","created":"2025-07-25","cited_by_count":0,"area":null},{"id":"2509.22855","title":"Observation-Free Attacks on Online Learning to Rank","created":"2025-09-26","cited_by_count":0,"area":null},{"id":"2606.08410","title":"Provably Efficient Personalized Multi-Objective Bandits with Proactive Conversational Queries","created":"2026-06-07","cited_by_count":0,"area":null},{"id":"2610.15299","title":"WisdomNet: trustable machine learning toward error-free classification","created":"2026-10-11","cited_by_count":0,"area":null}],"next_cursor":null}