MoËT: Mixture of Expert Trees and its Application to Verifiable Reinforcement Learning

Abstract

Rapid advancements in deep learning have led to many recent breakthroughs. While deep learning models achieve superior performance, often statistically better than humans, their adoption into safety-critical settings, such as healthcare or self-driving cars is hindered by their inability to provide safety guarantees or to expose the inner workings of the model in a human understandable form. We present MoËT, a novel model based on Mixture of Experts, consisting of decision tree experts and a generalized linear model gating function. Thanks to such gating function the model is more expressive than the standard decision tree. To support non-differentiable decision trees as experts, we formulate a novel training procedure. In addition, we introduce a hard thresholding version, MoËTH, in which predictions are made solely by a single expert chosen via the gating function. Thanks to that property, MoËTH allows each prediction to be easily decomposed into a set of logical rules in a form which can be easily verified. While MoËT is a general use model, we illustrate its power in the reinforcement learning setting. By training MoËT models using an imitation learning procedure on deep RL agents we outperform the previous state-of-the-art technique based on decision trees while preserving the verifiability of the models. Moreover, we show that MoËT can also be used in real-world supervised problems on which it outperforms other verifiable machine learning models.

References in corpus (14)

• Distilling the Knowledge in a Neural Network
• Knowledge Distillation: A Survey
• Towards A Rigorous Science of Interpretable Machine Learning
• Explainable Machine Learning for Scientific Insights and Discoveries
• Interpretability Beyond Feature Attribution: Quantitative Testing with Concept Activation Vectors (TCAV)
• Born Again Neural Networks
• Local Rule-Based Explanations of Black Box Decision Systems
• Verifiable Reinforcement Learning via Policy Extraction
• An Inductive Synthesis Framework for Verifiable Reinforcement Learning
• Interpreting Neural Network Judgments via Minimal, Stable, and Symbolic Corrections
• Formal Verification of Input-Output Mappings of Tree Ensembles
• Learning Causal State Representations of Partially Observable Environments
• KnowRU: Knowledge Reusing via Knowledge Distillation in Multi-agent Reinforcement Learning
• Hierarchical Routing Mixture of Experts