Regret-based defense in adversarial reinforcement learning

• Main Authors: BELAIRE, Roman, VARAKANTHAM, Pradeep, NGUYEN, Thanh Hong, LO, David
• Format: text
• Language: English
• Published: Institutional Knowledge at Singapore Management University 2024
• Subjects: Robust Reinforcement Learning; Adversarial Robustness; Regret; Software Engineering
• Online Access: https://ink.library.smu.edu.sg/sis_research/9243; https://ink.library.smu.edu.sg/context/sis_research/article/10243/viewcontent/p2633.pdf
• Institution: Singapore Management University

Deep Reinforcement Learning (DRL) policies are vulnerable to adversarial noise in observations, which can have disastrous consequences in safety-critical environments. For instance, a self-driving car receiving adversarially perturbed sensory observations about traffic signs (e.g., a stop sign physically altered to be perceived as a speed limit sign) can be fatal. Leading existing approaches for making RL algorithms robust to an observation-perturbing adversary have focused on (a) regularization approaches that make expected value objectives robust by adding adversarial loss terms; or (b) employing "maximin'' (i.e., maximizing the minimum value) notions of robustness. While regularization approaches are adept at reducing the probability of successful attacks, their performance drops significantly when an attack is successful. On the other hand, maximin objectives, while robust, can be extremely conservative. To this end, we focus on optimizing a well-studied robustness objective, namely regret. To ensure the solutions provided are not too conservative, we optimize an approximation of regret using three different methods. We demonstrate that our methods outperform existing best approaches for adversarial RL problems across a variety of standard benchmarks from literature.