A Behavior-Aware Approach for Deep Reinforcement Learning in Non-stationary Environments without Known Change Points
Zihe Liu, Jie Lu, Guangquan Zhang, Junyu Xuan
TL;DR
The paper tackles deep reinforcement learning in non-stationary environments with unknown change points by introducing the Behavior-Aware Detection and Adaptation (BADA) framework. BADA detects environment changes by analyzing shifts in policy behavior through behavior embeddings and the Wasserstein distance $W(\cdot,\cdot)$, using a permutation test to determine change points without manually tuned thresholds. It then adapts online via a policy gradient objective that regularizes toward faster deviation from the previous optimum: $F(\theta) = \mathbb{E}_{\tau \sim \mathbb{P}_{\theta}}[\mathcal{R}(\tau)] - W(\mathbb{P}_{\theta},\mathbb{P}_{t-1}) + \delta W(\mathbb{P}_{\theta},\mathbb{P}_{pre})$, with a self-adjusted $\delta$ based on the observed change magnitude. Empirical results in ViZDoom across multiple scenarios show that BADA achieves faster adaptation and higher cumulative rewards and change-detection accuracy than baselines, demonstrating practical robustness in dynamic, unknown-change settings.
Abstract
Deep reinforcement learning is used in various domains, but usually under the assumption that the environment has stationary conditions like transitions and state distributions. When this assumption is not met, performance suffers. For this reason, tracking continuous environmental changes and adapting to unpredictable conditions is challenging yet crucial because it ensures that systems remain reliable and flexible in practical scenarios. Our research introduces Behavior-Aware Detection and Adaptation (BADA), an innovative framework that merges environmental change detection with behavior adaptation. The key inspiration behind our method is that policies exhibit different global behaviors in changing environments. Specifically, environmental changes are identified by analyzing variations between behaviors using Wasserstein distances without manually set thresholds. The model adapts to the new environment through behavior regularization based on the extent of changes. The results of a series of experiments demonstrate better performance relative to several current algorithms. This research also indicates significant potential for tackling this long-standing challenge.
