Skip to content
NewA calmer, faster ZeroHour

Robust Policy Optimization via Adversarial Importance Sampling

arXiv cs.AI / cs.LG / cs.CLby Amine Andam ()1 min read3 · 2 reads
AI summary · glm-5.3Summaries by Vani AI

Adversarial Importance Sampling estimates worst-case RL returns without extra interactions; authors also release the advrl PyTorch library.

The paper introduces Advis, which uses importance sampling over trajectories from standard training to estimate and optimize verifiable worst-case returns, requiring no additional environment interactions or auxiliary networks. It also releases advrl, a modular PyTorch library of single-file robustness methods and adversarial attacks for reproducible evaluation. The authors show adversarial hyperparameters do not transfer across agents, so they evaluate with 6-14x more attacker configurations than prior work. Effectiveness is demonstrated on continuous control environments.

Key facts
  • Advis estimates verifiable worst-case returns without extra environment interactions
  • advrl library offers single-file implementations of robustness methods and attacks
  • Attacker hyperparameters do not transfer across agents, risking robustness overestimation
  • Evaluation uses 6-14x more attacker configurations than prior work
Explain this AI news with Vani AIWhat was announced, what is new and why it matters, in a new chat

From the original article

1 min read at arxiv.org

Significant progress has been made in safeguarding deep reinforcement learning (DRL) policies against input perturbations. Developing robust DRL involves three main stages: algorithm design, implementation, and evaluation. In this work, we identify and address a key limitation at each stage.

arXiv cs.AI / cs.LG / cs.CL

By Amine Andam · arxiv.org

Read the full article at arXiv cs.AI / cs.LG / cs.CL

A short excerpt; the article and its images belong to the publisher. Summary, key facts and assessment above are AI-written from the article and can be wrong.