On the Structural Non-Preservation of Epistemic Behaviour under Policy Transformation
Not on the map. Why?
Abstract (arXiv)
Reinforcement learning (RL) agents under partial observability often condition actions on internally accumulated information such as memory or inferred latent context. We formalise such information-conditioned interaction patterns as behavioural dependency: variation in action selection with respect to internal information under fixed observations. This induces a probe-relative notion of ε-behavioural equivalence and a within-policy behavioural distance that quantifies probe sensitivity. We establish three structural results. First, the set of policies exhibiting non-trivial behavioural dependency is not closed under convex aggregation. Second, behavioural distance contracts under convex combination. Third, we prove a sufficient local condition under which gradient ascent on a skewed mixture objective decreases behavioural distance when a dominant-mode gradient aligns with the direction of steepest contraction. Minimal bandit and partially observable gridworld experiments provide controlled witnesses of these mechanisms. In the examined settings, behavioural distance decreases under convex aggregation and under continued optimisation with skewed latent priors, and in these experiments it precedes degradation under latent prior shift. These results identify structural conditions under which probe-conditioned behavioural separation is not preserved under common policy transformations.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 16 of its 24 references that are in the map. First posted on arXiv 24 Feb 2026.
Builds on
16 of 24 references.
References · 16
- 2018Soft Actor-Critic: Off-Policy Maximum Entropy Deep Reinforcement Learning with a Stochastic Actorcited by 4,635
- 2019Dream to Control: Learning Behaviors by Latent Imaginationcited by 1,598
- 2018World Modelscited by 1,444
- 2019Mastering Atari, Go, Chess and Shogi by Planning with a Learned Modelcited by 1,327
- 2017Curiosity-driven Exploration by Self-supervised Predictioncited by 1,173
- 2020Mastering Atari with Discrete World Modelscited by 990
- 2016Unifying Count-Based Exploration and Intrinsic Motivationcited by 632
- 2016RL2: Fast Reinforcement Learning via Slow Reinforcement Learningcited by 490
- 2016Reinforcement Learning with Unsupervised Auxiliary Taskscited by 400
- 2019Efficient Off-Policy Meta-Reinforcement Learning via Probabilistic Context Variablescited by 372
- 2020Data-Efficient Reinforcement Learning with Self-Predictive Representationscited by 309
- 2018Large-Scale Study of Curiosity-Driven Learningcited by 277
4 more
- 2022Understanding and Preventing Capacity Loss in Reinforcement Learningcited by 124
- 2023System Neural Diversity: Measuring Behavioral Heterogeneity in Multi-Agent Learningcited by 12
- 2023Understanding and Addressing the Pitfalls of Bisimulation-based Representations in Offline Reinforcement Learningcited by 10
- 2024Measuring Policy Distance for Multi-Agent Reinforcement Learningcited by 4
Built on by
Not cited yet.