CausalXRL explained reinforcement-learning decisions through causal graphs, and rated useful in an expert RTS study
AspireAI community · arXiv
Reinforcement learning delivers strong performance in complex environments at the cost of interpretability, which makes agent behaviour hard to trust and hard to debug. CausalXRL is a framework for explainable RL whose distinguishing feature is causal graph reasoning, giving transparent, structured, multi-level explanations of agent decision-making. It is evaluated in two parts: a quantitative analysis of explanation fidelity and causal-structure learning efficiency in benchmark RL environments, and a qualitative expert study of explainability in the real-time strategy benchmark MicroRTS. The quantitative results show the framework producing faithful explanations while learning causal structures efficiently, and the expert study suggests participants found it useful for inspecting high-level RTS strategies. It is published as a full paper in the ICML 2026 proceedings.
Read the story and explore more from the AspireAI community.
Two sparse-autoencoder analyses have resisted scaling: matching semantically similar features across layers, and compressing large feature circuits into interpretable supernodes. This paper argues both are the same underlying problem, estimating semantic distances between SAE features that sit on different activation manifolds. Its representation treats each feature not as a single decoder vector but as an activation-weighted distribution over the hidden states expressing it, projects those distributions into a shared reference space, and compares them with Wasserstein distance. The representation is proved invariant to activation rescaling and stable under perturbation, and recovers true matches under finite-sample margin conditions. Empirically it outperformed decoder-vector and LLM-based baselines and captured subtle functional distinctions between related features, and it compressed large feature circuits into interpretable supernodes automatically. The limitation is that this is interpretability tooling: the paper demonstrates better feature matching and circuit compression, not that downstream interpretability claims become more accurate.