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 α fraction of the nominal-to-worst-case return gap remains achievable at each state. In deep RL, perturbation magnitudes η are selected dynamically, using a learned critic Q((s,a),η) that estimates the expected return of α-reward-preserving rollouts. For intermediate values of α, 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.
@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}
}