mlsanityData to 7 Oct 2026

Prism: Policy Reuse via Interpretable Strategy Mapping in Reinforcement Learning

arXiv 2604.02353 ↗First posted 4 Mar 2026cs.LG cs.AIcited by 0

Not on the map. Why?

Abstract (arXiv)

We present PRISM (Policy Reuse via Interpretable Strategy Mapping), a framework that grounds reinforcement learning agents' decisions in discrete, causally validated concepts and uses those concepts as a zero-shot transfer interface between agents trained with different algorithms. PRISM clusters each agent's encoder features into K concepts via K-means. Causal intervention establishes that these concepts directly drive - not merely correlate with - agent behavior: overriding concept assignments changes the selected action in 69.4% of interventions (p = 8.6 × 10-86, 2500 interventions). Concept importance and usage frequency are dissociated: the most-used concept (C47, 33.0% frequency) causes only a 9.4% win-rate drop when ablated, while ablating C16 (15.4% frequency) collapses win rate from 100% to 51.8%. Because concepts causally encode strategy, aligning them via optimal bipartite matching transfers strategic knowledge zero-shot. On Go~7×7 with three independently trained agents, concept transfer achieves 69.5%±3.2% and 76.4%±3.4% win rate against a standard engine across the two successful transfer pairs (10 seeds), compared to 3.5% for a random agent and 9.2% without alignment. Transfer succeeds when the source policy is strong; geometric alignment quality predicts nothing (R2 ≈ 0). The framework is scoped to domains where strategic state is naturally discrete: the identical pipeline on Atari Breakout yields bottleneck policies at random-agent performance, confirming that the Go results reflect a structural property of the domain.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 13 of its 20 references that are in the map. First posted on arXiv 4 Mar 2026.

Builds on

13 of 20 references.

References · 13

  1. 2017Proximal Policy Optimization Algorithmscited by 14,441
  2. 2017Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networkscited by 4,861
  3. 2016Progressive Neural Networkscited by 1,332
  4. 2020Concept Bottleneck Modelscited by 1,022
  5. 2020Mastering Atari with Discrete World Modelscited by 990
  6. 2018Diversity is All You Need: Learning Skills without a Reward Functioncited by 734
  7. 2018Data-Efficient Hierarchical Reinforcement Learningcited by 436
  8. 2015Policy Distillationcited by 414
  9. 2021Causal Abstractions of Neural Networkscited by 401
  10. 2016Successor Features for Transfer in Reinforcement Learningcited by 331
  11. 2023Probabilistic Concept Bottleneck Modelscited by 101
  12. 2024Stochastic Concept Bottleneck Modelscited by 49
1 more
  1. 2024Interpretable Concept Bottlenecks to Align Reinforcement Learning Agentscited by 23

Built on by

Not cited yet.