English

Reward-Preserving Attacks For Robust Reinforcement Learning

Machine Learning 2026-01-30 v2

Abstract

Adversarial training in reinforcement learning (RL) is challenging because perturbations cascade through trajectories and compound over time, making fixed-strength attacks either overly destructive or too conservative. We propose reward-preserving attacks, which adapt adversarial strength so that an α\alpha fraction of the nominal-to-worst-case return gap remains achievable at each state. In deep RL, perturbation magnitudes η\eta are selected dynamically, using a learned critic Q((s,a),η)Q((s,a),\eta) that estimates the expected return of α\alpha-reward-preserving rollouts. For intermediate values of α\alpha, this adaptive training yields policies that are robust across a wide range of perturbation magnitudes while preserving nominal performance, outperforming fixed-radius and uniformly sampled-radius adversarial training.

Keywords

Cite

@article{arxiv.2601.07118,
  title  = {Reward-Preserving Attacks For Robust Reinforcement Learning},
  author = {Lucas Schott and Elies Gherbi and Hatem Hajri and Sylvain Lamprier},
  journal= {arXiv preprint arXiv:2601.07118},
  year   = {2026}
}

Comments

27 pages, 28 figures, 4 algorithms, 3 tables, preprint

R2 v1 2026-07-01T08:59:54.794Z