Robust Proximal Adversarial Reinforcement Learning Under Model Mismatch

Reinforcement learning (RL) can generate high-performance control policies for complex tasks in simulation through an end-to-end approach. However, the RL policy is not robust to uncertainties caused by modeling mismatch between simulation and real environments, making it difficult to transfer to the real world. In response to the above challenge, this letter introduces a lightweight and efficient robust RL algorithm. The algorithm transforms the optimization objective of the adversary from a long-term cumulative reward to a short-term reward, making the adversary focus on the performance in the near future. Additionally, the adversarial actions are projected onto a finite subset within the perturbation space using projected gradient descent, effectively constraining the adversary's strength and obtaining more robust policies. Extensive experiments in both simulated and real environments show that our algorithm improves the generalization ability of the policy for the modeling mismatch, outperforming the next best prior methods across almost all environments.

Authors

Institutions

Publication Details

Journal
IEEE Robotics and Automation Letters
Published
2024-10-03
DOI
https://doi.org/10.1109/lra.2024.3472348
Citations
1
Primary Topic
Adversarial Robustness in Machine Learning
Type
article
Field-Weighted Citation Impact
0.35

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Robust Proximal Adversarial Reinforcement Learning Under Model Mismatch

Taixian Hou, Peng Zhai, Zhiyan Dong, Xiaopeng Ji et al.
1 citations
IEEE Robotics and Automation Letters
Adversarial Robustness in Machine Learning
0.35
article

Robust Proximal Adversarial Reinforcement Learning Under Model Mismatch

Taixian Hou, Peng Zhai, Zhiyan Dong, Xiaopeng Ji, Lihua Zhang, Xiaoyi Wei, Jiafu Yi
article en
1 citations

Abstract

Reinforcement learning (RL) can generate high-performance control policies for complex tasks in simulation through an end-to-end approach. However, the RL policy is not robust to uncertainties caused by modeling mismatch between simulation and real environments, making it difficult to transfer to the real world. In response to the above challenge, this letter introduces a lightweight and efficient robust RL algorithm. The algorithm transforms the optimization objective of the adversary from a long-term cumulative reward to a short-term reward, making the adversary focus on the performance in the near future. Additionally, the adversarial actions are projected onto a finite subset within the perturbation space using projected gradient descent, effectively constraining the adversary's strength and obtaining more robust policies. Extensive experiments in both simulated and real environments show that our algorithm improves the generalization ability of the policy for the modeling mismatch, outperforming the next best prior methods across almost all environments.

IEEE Robotics and Automation LettersVol. 9(11)
Hainan University (CN), Fudan University (CN), Ji Hua Laboratory (CN), Zhejiang University (CN)
China Postdoctoral Science Foundation
Reduced inequalities
Openalex Percentile: Top 33%
Adversarial Robustness in Machine Learning
0.35
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Robust Proximal Adversarial Reinforcement Learning Under Model Mismatch — Taixian Hou, Peng Zhai, et al. · IEEE Robotics and Automation Letters (2024) | TGRS Research Map | TGRS