Approximating Shapley Explanations in Reinforcement Learning

Daniel Beechey, Özgür Şimşek
11/8/2025
cs.LG

No confident code implementation found for this paper.

Abstract

Reinforcement learning has achieved remarkable success in complex decision-making environments, yet its lack of transparency limits its deployment in practice, especially in safety-critical settings. Shapley values from cooperative game theory provide a principled framework for explaining reinforcement learning; however, the computational cost of Shapley explanations is an obstacle to their use. We introduce FastSVERL, a scalable method for explaining reinforcement learning by approximating Shapley values. FastSVERL is designed to handle the unique challenges of reinforcement learning, including temporal dependencies across multi-step trajectories, learning from off-policy data, and adapting to evolving agent behaviours in real time. FastSVERL introduces a practical, scalable approach for principled and rigorous interpretability in reinforcement learning.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{beechey2025approximating,
  title  = {Approximating Shapley Explanations in Reinforcement Learning},
  author = {Daniel Beechey and Özgür Şimşek},
  year   = {2025},
  eprint = {2511.06094},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2511.06094v1},
  journal = {NEURIPS 2025 2025}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2511.06094.svg)](https://codeofpaper.com/paper/2511.06094)

Discussion