mlsanityData to 14 Oct 2026

Robust Policy Optimization via Adversarial Importance Sampling

arXiv 2609.13044 ↗First posted 11 Sep 2026cs.LGcited by 0

On the map: Deep reinforcement learning methods → Adversarial robustness and RL in finance

Abstract (arXiv)

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. First, we introduce Adversarial Importance Sampling (Advis), a method that uses importance sampling over trajectories from standard training to estimate and optimize verifiable worst-case returns. Advis satisfies three desirable criteria not jointly achieved by prior work: it requires no additional environment interactions, no auxiliary networks, and captures long-term robustness. Second, we introduce advrl, a modular PyTorch library that provides clean, single-file implementations of existing robustness methods and adversarial attacks, facilitating rapid prototyping and enabling reproducible and traceable evaluations. Third, we revisit evaluation under learned adversaries and show that optimal adversarial hyperparameters do not transfer across agents, which can lead to an overestimation of robustness when using a limited set of attacker configurations. Accordingly, we evaluate policies against a large and diverse set of attackers, using 6-14x more configurations than prior work. Finally, we evaluate our approach on continuous control environments, demonstrating its effectiveness relative to existing baselines. The code is available at: https://github.com/AmineAndam04/advrl

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Placed in Adversarial robustness and RL in finance, one of 15 directions in Deep reinforcement learning methods. Builds on 27 of its 36 references that are in the map. First posted on arXiv 11 Sep 2026.

Builds on

27 of 36 references.

Closest ancestors · 1

Same direction, newest first

  1. 2024On Minimizing Adversarial Counterfactual Error in Adversarial RL7 Jun

Other references · 26

  1. 2017Proximal Policy Optimization Algorithmscited by 15,215
  2. 2017Virtual Adversarial Training: A Regularization Method for Supervised and Semi-Supervised Learningcited by 920
  3. 2021Deep Reinforcement Learning at the Edge of the Statistical Precipicecited by 807
  4. 2017Reluplex: An Efficient SMT Solver for Verifying Deep Neural Networkscited by 744
  5. 2018Efficient Neural Network Robustness Certification with General Activation Functionscited by 445
  6. 2018On the Effectiveness of Interval Bound Propagation for Training Verifiably Robust Modelscited by 328
  7. 2017Adversarial Attacks on Neural Network Policiescited by 320
  8. 2020Robust Deep Reinforcement Learning against Adversarial Perturbations on State Observationscited by 238
  9. 2018Breaking the Curse of Horizon: Infinite-Horizon Off-Policy Estimationcited by 227
  10. 2015Risk-Sensitive and Robust Decision-Making: a CVaR Optimization Approachcited by 170
  11. 2017Tactics of Adversarial Attack on Deep Reinforcement Learning Agentscited by 166
  12. 2017Robust Deep Reinforcement Learning with Adversarial Attackscited by 154
14 more
  1. 2021Robust Reinforcement Learning on State Observations with Learned Optimal Adversarycited by 135
  2. 2019Empirical Study of Off-Policy Policy Evaluation for Reinforcement Learningcited by 121
  3. 2017Delving into adversarial attacks on deep policiescited by 104
  4. 2014Algorithms for CVaR Optimization in MDPscited by 99
  5. 2020Robust Deep Reinforcement Learning through Adversarial Losscited by 75
  6. 2021Who Is the Strongest Enemy? Towards Optimal and Efficient Evasion Attacks in Deep RLcited by 55
  7. 2018Policy Optimization via Importance Samplingcited by 47
  8. 2022Efficient Adversarial Training without Attacking: Worst-Case-Aware Robust Reinforcement Learningcited by 43
  9. 2020Projected Stochastic Gradient Langevin Algorithms for Constrained Sampling and Non-Convex Learningcited by 33
  10. 2021Provably Efficient Black-Box Action Poisoning Attacks Against Reinforcement Learningcited by 29
  11. 2019Spatiotemporally Constrained Action Space Attacks on Deep Reinforcement Learning Agentscited by 25
  12. 2023Adversarial Robust Deep Reinforcement Learning Requires Redefining Robustnesscited by 19
  13. 2023Improve Robustness of Reinforcement Learning against Observation Perturbations via l_∞ Lipschitz Policy Networkscited by 7
  14. 2024Understanding and Diagnosing Deep Reinforcement Learningcited by 6

Built on by

Not cited yet.

Similar, not cited

Close in wording, no citation either way

  1. 2024Robust Deep Reinforcement Learning Through Adversarial Attacks and Training : A Survey
  2. 2026Robust Adversarial Policy Optimization Under Dynamics Uncertainty
  3. 2025Search-Based Adversarial Estimates for Improving Sample Efficiency in Off-Policy Reinforcement Learning
  4. 2024Analyzing Adversarial Inputs in Deep Reinforcement Learning
  5. 2025Adversarial Diffusion for Robust Reinforcement Learning
  6. 2025Towards Optimal Adversarial Robust Reinforcement Learning with Infinity Measurement Error
  7. 2026Robust Adversarial Reinforcement Learning with Risk Sensitivity and Critic Consistency Regularization
  8. 2024Robust Deep Reinforcement Learning with Adaptive Adversarial Perturbations in Action Space