Adversarial Cheap Talk
Chris Lu, Timon Willi, Alistair Letcher, Jakob Nicolaus Foerster
Abstract
Adversarial attacks in reinforcement learning (RL) often assume highly-privileged access to the victim's parameters, environment, or data. Instead, this paper proposes a novel adversarial setting called a Cheap Talk MDP in which an Adversary can merely append deterministic messages to the Victim's observation, resulting in a minimal range of influence. The Adversary cannot occlude ground truth, influence underlying environment dynamics or reward signals, introduce non-stationarity, add stochasticity, see the Victim's actions, or access their parameters. Additionally, we present a simple meta-learning algorithm called Adversarial Cheap Talk (ACT) to train Adversaries in this setting. We demonstrate that an Adversary trained with ACT still significantly influences the Victim's training and testing performance, despite the highly constrained setting. Affecting train-time performance reveals a new attack vector and provides insight into the success and failure modes of existing RL algorithms. More specifically, we show that an ACT Adversary is capable of harming performance by interfering with the learner's function approximation, or instead helping the Victim's performance by outputting useful features. Finally, we show that an ACT Adversary can manipulate messages during train-time to directly and arbitrarily control the Victim at test-time. Project video and code are available at https://sites.google.com/ view/adversarial-cheap-talk .
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Cited by top-tier papers6
- SleeperNets: Universal Backdoor Poisoning Attacks Against Reinforcement Learning AgentsEthan Rathbun, Christopher Amato, Alina OpreaNeurIPS 2024 · 27 citations
- EvIL: Evolution Strategies for Generalisable Imitation LearningSilvia Sapora, Gokul Swamy, Chris Lu, Yee Whye Teh et al.ICML 2024 · 10 citations
- Towards Optimal Adversarial Robust Q-learning with Bellman Infinity-errorHaoran Li, Zicheng Zhang, Wang Luo, Congying Han et al.ICML 2024 · 4 citations
- Selective Response Strategies for GenAIBoaz Taitler, Omer Ben-PoratICML 2025
- Learning mirror maps in policy mirror descentCarlo Alfano, Sebastian Rene Towers, Silvia Sapora, Chris Lu et al.ICLR 2025
Builds on14
- Robust Deep Reinforcement Learning against Adversarial Perturbations on State ObservationsHuan Zhang, Hongge Chen, Chaowei Xiao, Bo Li et al.NeurIPS 2020 · 437 citations
- Adversarial Policies: Attacking Deep Reinforcement LearningAdam Gleave, Michael Dennis, Cody Wild, Neel Kant et al.ICLR 2020 · 415 citations
- The Primacy Bias in Deep Reinforcement LearningEvgenii Nikishin, Max Schwarzer, Pierluca D'Oro, Pierre-Luc Bacon et al.ICML 2022 · 269 citations
- Robust Reinforcement Learning on State Observations with Learned Optimal AdversaryHuan Zhang, Hongge Chen, Duane S. Boning, Cho-Jui HsiehICLR 2021 · 212 citations
- Understanding and Preventing Capacity Loss in Reinforcement LearningClare Lyle, Mark Rowland, Will DabneyICLR 2022 · 151 citations
Related papers
- Optimal Attack and Defense for Reinforcement LearningJeremy McMahan, Young Wu, Xiaojin Zhu, Qiaomin XieAAAI 2024 · 25 citations
- Cheap Talk Discovery and Utilization in Multi-Agent Reinforcement LearningYat Long Lo, Christian Schröder de Witt, Samuel Sokota, Jakob Nicolaus Foerster et al.ICLR 2023
- Robust Deep Reinforcement Learning against Adversarial Behavior ManipulationShojiro Yamabe, Kazuto Fukuchi, Jun SakumaICLR 2026 · 1 citation
- When Can You Poison Rewards? A Tight Characterization of Reward Poisoning in Linear MDPsJose Aguilar Escamilla, Haoyang Hong, Jiawei Li, Haoyu Zhao et al.ICML 2026
- Provably Efficient Black-Box Action Poisoning Attacks Against Reinforcement LearningGuanlin Liu, Lifeng LaiNeurIPS 2021 · 55 citations
