English

Policy Teaching in Reinforcement Learning via Environment Poisoning Attacks

Machine Learning 2020-11-24 v1 Artificial Intelligence Cryptography and Security

Abstract

We study a security threat to reinforcement learning where an attacker poisons the learning environment to force the agent into executing a target policy chosen by the attacker. As a victim, we consider RL agents whose objective is to find a policy that maximizes reward in infinite-horizon problem settings. The attacker can manipulate the rewards and the transition dynamics in the learning environment at training-time, and is interested in doing so in a stealthy manner. We propose an optimization framework for finding an optimal stealthy attack for different measures of attack cost. We provide lower/upper bounds on the attack cost, and instantiate our attacks in two settings: (i) an offline setting where the agent is doing planning in the poisoned environment, and (ii) an online setting where the agent is learning a policy with poisoned feedback. Our results show that the attacker can easily succeed in teaching any target policy to the victim under mild conditions and highlight a significant security threat to reinforcement learning agents in practice.

Keywords

Cite

@article{arxiv.2011.10824,
  title  = {Policy Teaching in Reinforcement Learning via Environment Poisoning Attacks},
  author = {Amin Rakhsha and Goran Radanovic and Rati Devidze and Xiaojin Zhu and Adish Singla},
  journal= {arXiv preprint arXiv:2011.10824},
  year   = {2020}
}

Comments

Journal version of ICML'20 paper. New theoretical results for jointly poisoning rewards and transitions

R2 v1 2026-06-23T20:24:52.530Z