Interpreting Neural Policies with Disentangled Tree Representations
Not on the map. Why?
Abstract (arXiv)
The advancement of robots, particularly those functioning in complex human-centric environments, relies on control solutions that are driven by machine learning. Understanding how learning-based controllers make decisions is crucial since robots are often safety-critical systems. This urges a formal and quantitative understanding of the explanatory factors in the interpretability of robot learning. In this paper, we aim to study interpretability of compact neural policies through the lens of disentangled representation. We leverage decision trees to obtain factors of variation [1] for disentanglement in robot learning; these encapsulate skills, behaviors, or strategies toward solving tasks. To assess how well networks uncover the underlying task dynamics, we introduce interpretability metrics that measure disentanglement of learned neural dynamics from a concentration of decisions, mutual information and modularity perspective. We showcase the effectiveness of the connection between interpretability and disentanglement consistently across extensive experimental analysis.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 32 of its 54 references that are in the map. First posted on arXiv 13 Oct 2022.
Builds on
32 of 54 references.
References · 32
- 2017Proximal Policy Optimization Algorithmscited by 15,215
- 2018Neural Ordinary Differential Equationscited by 3,779
- 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,262
- 2014On the Properties of Neural Machine Translation: Encoder-Decoder Approachescited by 1,304
- 2018Challenging Common Assumptions in the Unsupervised Learning of Disentangled Representationscited by 941
- 2018Towards Robust Interpretability with Self-Explaining Neural Networkscited by 505
- 2020A Survey on Neural Network Interpretabilitycited by 291
- 2017Interpretable Convolutional Neural Networkscited by 162
- 2020Liquid Time-constant Networkscited by 161
- 2022Liquid Structural State-Space Modelscited by 136
- 2018Learning Deep Disentangled Embeddings with the F-Statistic Losscited by 101
- 2018Interpreting CNNs via Decision Treescited by 89
20 more
- 2020Learning Long-Term Dependencies in Irregularly-Sampled Time Seriescited by 83
- 2021VISTA 2.0: An Open, Data-driven Simulator for Multimodal Sensing and Policy Learning for Autonomous Vehiclescited by 81
- 2021Lost in Pruning: The Effects of Pruning Neural Networks beyond Test Accuracycited by 62
- 2019Physically Interpretable Neural Networks for the Geosciences: Applications to Earth System Variabilitycited by 44
- 2021Latent Imagination Facilitates Zero-Shot Transfer in Autonomous Racingcited by 26
- 2020On The Verification of Neural ODEs with Stochastic Guaranteescited by 24
- 2021Causal Navigation by Continuous-time Neural Networkscited by 23
- 2021Adversarial Training is Not Ready for Robot Learningcited by 20
- 2021On-Off Center-Surround Receptive Fields for Accurate and Robust Image Classificationcited by 15
- 2019Optimizing for Interpretability in Deep Neural Networks with Tree Regularizationcited by 13
- 2021Sparse Flows: Pruning Continuous-depth Modelscited by 13
- 2021BarrierNet: A Safety-Guaranteed Layer for Neural Networkscited by 12
- 2022On the Forward Invariance of Neural ODEscited by 11
- 2018Response Characterization for Auditing Cell Dynamics in Long Short-term Memory Networkscited by 10
- 2022Differentiable Control Barrier Functions for Vision-based End-to-End Autonomous Drivingcited by 10
- 2019Enhancing Decision Tree based Interpretation of Deep Neural Networks through L1-Orthogonal Regularizationcited by 9
- 2019Extracting Interpretable Concept-Based Decision Trees from CNNscited by 5
- 2021Interactive Analysis of CNN Robustnesscited by 4
- 2022Entangled Residual Mappingscited by 4
- 2022End-to-End Sensitivity-Based Filter Pruningcited by 1
Built on by
Citing papers per year: 2022: 1.
1 paper.