Causal Explanations from the Geometric Properties of ReLU Neural Networks
Not on the map. Why?
Abstract (arXiv)
Neural networks have proved an effective means of learning control policies for autonomous systems, but these learned policies are difficult to understand due to the black-box nature of neural networks. This lack of interpretability makes safety assurance for such autonomous systems challenging. The fields of eXplainable Artificial Intelligence (XAI) and eXplainable Reinforcement Learning (XRL) aim to interpret the decision making processes of neural networks and autonomous agents, respectively. In particular, work on causal explanations aims to provide "why" and "why not" explanations for why a model made a given decision. However, most of the work on explainability to date utilises a distilled version of the original model. While this distilled policy is interpretable, it necessarily degrades in performance significantly when compared to the original model, and is not guaranteed to be an accurate reflection of the decision making processes in the original model and as such cannot be used to guarantee its safety. Recent work on understanding the geometry of ReLU neural networks shows that a ReLU network corresponds to a piecewise linear function divided into regions defined by an n-dimensional convex polytope. Through this lens, a neural network can be understood as dividing the input space into distinct regions which apply a single linear function for each output neuron. We show that this geometric representation can be used to generate causal explanations for the network's behaviour similar to previous work, but which extracts rules directly from the geometry of Neural Networks with the ReLU activation function, and is therefore an accurate reflection of the network's behaviour.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 10 of its 26 references that are in the map. First posted on arXiv 11 May 2026.
Builds on
10 of 26 references.
References · 10
- 2017Reluplex: An Efficient SMT Solver for Verifying Deep Neural Networkscited by 739
- 2019Explainable Reinforcement Learning Through a Causal Lenscited by 177
- 2019Deep ReLU Networks Have Surprisingly Few Activation Patternscited by 160
- 2020Explainable Reinforcement Learning: A Surveycited by 139
- 2021Traversing the Local Polytopes of ReLU Neural Networks: A Unified Approach for Network Verificationcited by 13
- 2023ReLU Neural Networks, Polyhedral Decompositions, and Persistent Homologcited by 10
- 2022Reachable Polyhedral Marching (RPM): An Exact Analysis Tool for Deep-Learned Control Systemscited by 6
- 2024Fast and Exact Enumeration of Deep Networks Partitions Regionscited by 5
- 2021A Framework of Explanation Generation toward Reliable Autonomous Robotscited by 2
- 2023Vertex-based reachability analysis for verifying ReLU deep neural networkscited by 1
Built on by
Not cited yet.