Representation-Based Robustness in Goal-Conditioned Reinforcement Learning

4Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

Abstract

While Goal-Conditioned Reinforcement Learning (GCRL) has gained attention, its algorithmic robustness against adversarial perturbations remains unexplored. The attacks and robust representation training methods that are designed for traditional RL become less effective when applied to GCRL. To address this challenge, we first propose the Semi-Contrastive Representation attack, a novel approach inspired by the adversarial contrastive attack. Unlike existing attacks in RL, it only necessitates information from the policy function and can be seamlessly implemented during deployment. Then, to mitigate the vulnerability of existing GCRL algorithms, we introduce Adversarial Representation Tactics, which combines Semi-Contrastive Adversarial Augmentation with Sensitivity-Aware Regularizer to improve the adversarial robustness of the underlying RL agent against various types of perturbations. Extensive experiments validate the superior performance of our attack and defence methods across multiple state-of-the-art GCRL algorithms. Our code is available at https://github.com/TrustAI/ReRoGCRL.

Cite

CITATION STYLE

APA

Yin, X., Wu, S., Liu, J., Fang, M., Zhao, X., Huang, X., & Ruan, W. (2024). Representation-Based Robustness in Goal-Conditioned Reinforcement Learning. In Proceedings of the AAAI Conference on Artificial Intelligence (Vol. 38, pp. 21761–21769). Association for the Advancement of Artificial Intelligence. https://doi.org/10.1609/aaai.v38i19.30176

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free