This work proposes a unified framework, RACER (Risk-sensitive robust Adversarial critic ConsistEncy-regularized Reinforcement learning), that revisits adversarial RL from a risk-sensitive perspective and introduces a state-dependent adversarial objective that adaptively regulates perturbation strength.
Abstract
Reinforcement learning (RL) achieves strong performance in sequential decision-making but remains brittle under dynamic uncertainty and distributional shifts. Robust Adversarial Reinforcement Learning (RARL) improves robustness via worst-case perturbations, but existing approaches frequently suffer from unstable optimization and degraded value estimation. In particular, overly aggressive adversaries can drive the agent toward uninformative failure states, while adversarial perturbations amplify disagreement between double critics and introduce biased value targets. We propose a unified framework, RACER (Risk-sensitive robust Adversarial critic ConsistEncy-regularized Reinforcement learning), that revisits adversarial RL from a risk-sensitive perspective. First, we introduce a state-dependent adversarial objective that adaptively regulates perturbation strength, suppressing harmful disturbances while preserving informative exploration. Second, we propose critic consistency regularization to reduce disagreement between Q-value estimators and stabilize learning. Comprehensive experiments on challenging continuous control benchmarks demonstrate that RACER consistently improves performance, robustness, and training stability over strong robust RL baselines.
RL-FAT is proposed, a reinforcement-learning-inspired fair adversarial training framework that uses policy-gradient based feedback from adversarial predictions to improve adversarial robustness while promoting a more balanced robustness distribution across classes.
Observation uncertainty can drive a deep reinforcement learning (DRL) controller to select inappropriate actions even when its nominal policy performs well. This issue is especially pronounced in robotic systems deployed outside controlled laboratory conditions, where sensing and communication are affected by noise, bi...
Hai-Tao Zhang, Cheng-Yu Liu, Qing-Kai Meng et al.· 2026 3rd International Confe...· 0 citations
This work introduces Adversarial Importance Sampling (Advis), a method that uses importance sampling over trajectories from standard training to estimate and optimize verifiable worst-case returns and introduces advrl, a modular PyTorch library that provides clean, single-file implementations of existing robustness met...
Amine Andam, Jamal Bentahar, M. Hedabou· 0 citations
This paper proposes an empirical method that improves certified lower bounds by selecting the training risk-aversion parameter $\beta$ independently of the risk level used during evaluation, and formulate the risk-sensitive certification problem as a convex optimization and derive its dual to obtain a tractable approxi...
An adversarial training algorithm is developed and shown to be effectiveness in increasing robustness against adversarial missingness on three MuJoCo benchmark environments and achieves better robustness on all three tasks.
Paul Stahlhofen, Luca Hermes, Tim Kochs et al.· 0 citations
Dually Regularized AIL is the first algorithm to simultaneously achieve $\widetilde{O}\left(\frac{1}{\epsilon}\right)$ sample complexity in both expert demonstrations and online interactions for this regularized AIL objective, even with stochastic experts.
Hang Zhou, Shang-Zhe Li, А. А. Браверман et al.· 0 citations
Related blog posts
MIT News · Artificial Intelligence· news.mit.eduOct 14, 2026
Learn how Google DeepMind and GovTech Singapore uses lightweight on-device Gemma models to intercept conversational scams in private chats with zero cloud data egress.
MIT News · Artificial Intelligence· news.mit.eduOct 13, 2026
Machine-learning networks can learn without detailed instructions from a designer. Those that do may offer insight into how the brain reorganizes itself during learning.
Microsoft Research Blog· microsoft.comOct 12, 2026
StudentSim is a research system for evaluating and improving AI tutoring tools before they are tested with learners. It models how individuals may engage with tutors, giving feedback to improve tutor performance across subjects like chess, writing, and mathematics. The post Simulating student learning for better AI tutoring appeared first on Microsoft Research.
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.