All posts

research digesten May 11, 2026 6 min read

The Tension Between Safety and Adaptation in Continual Reinforcement Learning

By kualia research desk

When we deploy reinforcement learning agents into the physical world, we ask them to solve two contradictory tasks simultaneously. They must remain rigid enough to preserve safety constraints that prevent damage to themselves and their surroundings, yet flexible enough to adapt when the world changes around them. This tension sits at the heart of safe continual reinforcement learning, a problem that remains largely unsolved despite recent advances in both safe RL and continual learning.

In their recent work, Safe Continual Reinforcement Learning in Non-stationary Environments, Coursey and colleagues from Vanderbilt University provide the first systematic investigation into this intersection. Their findings reveal something troubling: the very mechanisms that ensure safety tend to actively work against the plasticity required for adaptation, while the mechanisms that enable adaptation often violate safety during the transition period.

The Dual Challenge of Non-Stationarity and Safety

Most reinforcement learning theory assumes stationary environments, where the underlying dynamics remain constant throughout the agent's lifetime. Yet real systems degrade, weather patterns shift, and operational contexts evolve. Consider the Mars rover example the authors present: over a multi-year mission, wheel motors degrade, suspension systems wear, and terrain characteristics change with seasons. The control policy must adapt to these shifting dynamics, but it cannot afford to violate safety constraints, such as tip-over limits or collision avoidance, even for a single episode during the adaptation period.

The paper formalizes this as learning in a Constrained Markov Decision Process where the transition dynamics change over time. To study this formally, the authors introduce three benchmark environments that capture different facets of the problem. The Damaged HalfCheetah and Damaged Ant tasks simulate robotic locomotion with impaired joints, where the agent must learn to move with velocity constraints despite changing damage patterns. The Coffee Mug environment presents a manipulation task where a robotic arm must perform everyday tasks while avoiding configurations that would spill the contents of a fragile container.

These benchmarks are carefully designed to test both objectives simultaneously. Success requires not merely avoiding constraint violations in a static setting, but maintaining safety while the agent's physical capabilities change, and ensuring that knowledge of previous damage configurations persists to avoid catastrophic forgetting when old conditions recur.

The Fundamental Tension

Coursey et al. benchmark several classes of algorithms to understand how existing methods handle this dual mandate. They evaluate Safe RL approaches like Constrained Policy Optimization (CPO) and PPO-Lagrangian, which enforce safety through conservative policy updates and trust regions. They also test Continual RL methods like Elastic Weight Consolidation (EWC), which prevents catastrophic forgetting by regularizing weight updates away from parameters critical for previous tasks.

The results expose a fundamental incompatibility. Safe RL methods, by design, constrain how far the policy can deviate from previously known safe regions. When the environment changes non-stationarily, this conservatism prevents the policy from adapting quickly enough to new dynamics. The agent remains safe but becomes increasingly ineffective as its environment drifts.

Conversely, continual learning methods adapt aggressively to new tasks by allowing large parameter updates. While this prevents forgetting, it frequently violates safety constraints during the transition period between environment states. The agent learns to handle new dynamics eventually, but only after experiencing unsafe intermediate states that would be unacceptable in physical deployment.

To address this, the authors propose two hybrid algorithms: Safe Elastic Weight Consolidation (Safe EWC) and Cost Fisher Elastic Weight Consolidation (CF EWC). These approaches modify standard EWC by incorporating safety constraints into the regularization objective. Rather than merely preserving performance on previous tasks, they preserve the safety-critical aspects of previous policies while allowing controlled adaptation to new dynamics.

The empirical results show partial success. Regularization based approaches do mitigate the trade off to some degree, allowing safer adaptation than pure continual learning methods while avoiding the rigidity of pure safe RL. However, the paper honestly reports that these methods still exhibit significant safety violations during adaptation phases and incomplete retention of previous task knowledge. The tension is softened but not resolved.

My Analysis: Beyond the Technical Trade Off

The findings in this paper point to a deeper conceptual issue that extends beyond algorithmic engineering. In traditional safe RL, safety is treated as a constraint on the optimization landscape, a boundary that the policy must not cross. But in continual learning, what constitutes safe behavior changes as the system itself changes. A control policy that prevents tip over for a healthy rover may be catastrophically unsafe for a damaged rover with asymmetric thrust capabilities.

I would argue that this reveals a category error in how we formulate safe continual RL. We currently treat safety as a static constraint within each environment phase, when in fact safety in non-stationary settings requires meta learning of safety boundaries themselves. The agent must learn not just what actions are safe now, but how safety constraints evolve with system degradation.

Furthermore, the paper's focus on soft constraints, where violations incur penalty costs rather than hard termination, masks a critical distinction between transient and catastrophic safety failures. In the Coffee Mug environment, a small spill might be recoverable, but in aerospace or autonomous driving applications, a single constraint violation could be terminal. The benchmarks, while valuable, may understate the severity of the problem for safety critical applications where zero tolerance for violation during adaptation is required.

The connection to neural network plasticity also deserves more attention. The Fisher Information regularization used in EWC and its variants assumes that important parameters for safety are fixed features of the network. But in physical systems, the same parameter might encode safe behavior for one damage mode and unsafe behavior for another. This suggests we may need context dependent regularization that varies the consolidation strength based on detected environmental changes, rather than applying uniform regularization across all historical data.

Open Questions and Future Directions

Coursey and colleagues rightly identify several open challenges that the field must address. First, we need a theoretical characterization of when adaptation is possible without safety violation. Currently, we lack formal guarantees about the minimum number of unsafe episodes required to adapt to new dynamics while maintaining safety constraints from previous phases.

Second, the detection of environment changes remains a critical assumption in their work. In real deployment, the agent may not receive clear signals that damage has occurred or that terrain has changed. Continual safety under latent non-stationarity, where the agent must simultaneously detect changes and adapt safely, presents a significantly harder problem than the detectable changes studied here.

Finally, the field needs benchmarks that capture the severity of hard safety constraints. The soft constraint formulation, where violations are penalized but allowed, works for economic optimization but fails for safety critical systems where a single collision or hardware failure ends the mission. Developing algorithms that maintain zero violation during adaptation, perhaps through shielding or backup controllers, while still allowing policy improvement represents the next frontier.

The intersection of safety and continual learning will define whether RL can move beyond game playing and simulation into long duration autonomous operation. The Vanderbilt study makes clear that simply combining existing techniques is insufficient. We need fundamentally new approaches that treat safety not as a constraint to be satisfied, but as a dynamic invariant that must be preserved across changing system identities.

This digest was drafted by kualia's research assistant from a public paper and reviewed before publishing. It summarises the paper; it is not a substitute for reading it.