Geometry of Drifting MDPs with Path-Integral Stability Certificates
Zuyuan Zhang, Mahdi Imani, Tian Lan
TL;DR
This work advances nonstationary reinforcement learning by modeling environment evolution as a differentiable homotopy path $M( au)$ and tracking the induced motion of the optimal Bellman fixed point $Q^*_ au$. It introduces a length--curvature--kink signature (PL, Curv, $oldsymbol{oldsymbol{oldsymbol{oldsymbol{oldsymbol{oldsymbol{oldsymbol{oldsymbol{oldsymbol{oldsymbol{oldsymbol{oldsymbol{oldsymbol{oldsymbol{oldsymbol{oldsymbol{oldsymbol{oldsymbol{oldsymbol{oldsymbol{oldsymbol{oldsymbol{oldsymbol{oldsymbol{oldsymbol{}}}}}}}}}}}}$) to quantify drift, acceleration, and near-ties, and proves a solver-agnostic path-integral stability bound with gap-safe regions to certify local stability away from switches. Building on this, the paper derives first-/second-order tubes, ellipsoidal feasible regions, and projected tangent cones that characterize how $Q^*_ au$ can move along the path, enabling geometry-aware online control of learning/planning. It then delivers two lightweight, solver-agnostic wrappers, HT-RL and HT-MCTS, which estimate online proxies for PL, Curv, and kink proximity to adapt learning rates, target updates, regularization, and planning budgets, with formal dynamic-regret guarantees. Experiments on synthetic homotopy MDPs and deep-control benchmarks show improved tracking and reduced dynamic regret, particularly in oscillatory and switch-prone regimes, demonstrating practical impact for real-world nonstationary settings.
Abstract
Real-world reinforcement learning is often \emph{nonstationary}: rewards and dynamics drift, accelerate, oscillate, and trigger abrupt switches in the optimal action. Existing theory often represents nonstationarity with coarse-scale models that measure \emph{how much} the environment changes, not \emph{how} it changes locally -- even though acceleration and near-ties drive tracking error and policy chattering. We take a geometric view of nonstationary discounted Markov Decision Processes (MDPs) by modeling the environment as a differentiable homotopy path and tracking the induced motion of the optimal Bellman fixed point. This yields a length-curvature-kink signature of intrinsic complexity: cumulative drift, acceleration/oscillation, and action-gap-induced nonsmoothness. We prove a solver-agnostic path-integral stability bound and derive gap-safe feasible regions that certify local stability away from switch regimes. Building on these results, we introduce \textit{Homotopy-Tracking RL (HT-RL)} and \textit{HT-MCTS}, lightweight wrappers that estimate replay-based proxies of length, curvature, and near-tie proximity online and adapt learning or planning intensity accordingly. Experiments show improved tracking and dynamic regret over matched static baselines, with the largest gains in oscillatory and switch-prone regimes.
