Mo"ET: Mixture of Expert Trees and its Application to Verifiable Reinforcement Learning
On the map: Mixture-of-experts → MoE in reinforcement learning and robotics
Abstract (arXiv)
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"ET, 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"ETH, in which predictions are made solely by a single expert chosen via the gating function. Thanks to that property, Mo"ETH allows each prediction to be easily decomposed into a set of logical rules in a form which can be easily verified. While Mo"ET is a general use model, we illustrate its power in the reinforcement learning setting. By training Mo"ET 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"ET can also be used in real-world supervised problems on which it outperforms other verifiable machine learning models.
Key facts. Cited by 12 papers in the map (data through 14 Oct 2026). Placed in MoE in reinforcement learning and robotics, one of 12 directions in Mixture-of-experts. Builds on 14 of its 62 references that are in the map. First posted on arXiv 16 Jun 2019.
Builds on
14 of 62 references.
References · 14
- 2015Distilling the Knowledge in a Neural Networkcited by 10,324
- 2016"Why Should I Trust You?": Explaining the Predictions of Any Classifiercited by 5,070
- 2017Towards A Rigorous Science of Interpretable Machine Learningcited by 1,416
- 2018A Survey Of Methods For Explaining Black Box Modelscited by 973
- 2015Dueling Network Architectures for Deep Reinforcement Learningcited by 785
- 2016The Mythos of Model Interpretabilitycited by 721
- 2018Born Again Neural Networkscited by 546
- 2015Policy Distillationcited by 440
- 2018Verifiable Reinforcement Learning via Policy Extractioncited by 177
- 2018Local Rule-Based Explanations of Black Box Decision Systemscited by 166
- 2019Explainable Machine Learning for Scientific Insights and Discoveriescited by 166
- 2018Learning Finite State Representations of Recurrent Policy Networkscited by 37
2 more
- 2019Formal Verification of Input-Output Mappings of Tree Ensemblescited by 13
- 2019Hierarchical Routing Mixture of Expertscited by 5
Built on by
Citing papers per year: 2021: 1; 2022: 3; 2023: 3; 2024: 3; 2025: 0; 2026: 2.
12 papers.
- 2022Verifying Learning-Based Robotic Navigation Systemscited by 33
- 2021Iterative Bounding MDPs: Learning Interpretable Policies via Non-Interpretable Methodscited by 31
- 2024Verification-Guided Shielding for Deep Reinforcement Learningcited by 13
- 2022Learning Interpretable, High-Performing Policies for Autonomous Drivingcited by 11
- 2023Verifying Generalization in Deep Learningcited by 11
- 2022Explainability in Deep Reinforcement Learning, a Review into Current Methods and Applicationscited by 6
- 2023In Search of netUnicorn: A Data-Collection Platform to Develop Generalizable ML Models for Network Security Problemscited by 6
- 2024SkillTree: Explainable Skill-Based Deep Reinforcement Learning for Long-Horizon Control Taskscited by 3
- 2024Verifying the Generalization of Deep Learning to Out-of-Distribution Domainscited by 2
- 2023Fidelity-Induced Interpretable Policy Extraction for Reinforcement Learningcited by 0
- 2026Robust Exploration in Directed Controller Synthesis via Reinforcement Learning with Soft Mixture-of-Expertscited by 0
- 2026REALM: Regime-Switching, Explainable, and Activation-Induced Linear Modelscited by 0
- 2026REALM: Regime-Switching, Explainable, and Activation-Induced Linear Models26 Sep 2026
- 2026Robust Exploration in Directed Controller Synthesis via Reinforcement Learning with Soft Mixture-of-Experts22 Feb 2026
- 2024SkillTree: Explainable Skill-Based Deep Reinforcement Learning for Long-Horizon Control Tasks19 Nov 2024
- 2024Verification-Guided Shielding for Deep Reinforcement Learning10 Jun 2024
- 2024Verifying the Generalization of Deep Learning to Out-of-Distribution Domains4 Jun 2024
- 2023Fidelity-Induced Interpretable Policy Extraction for Reinforcement Learning12 Sep 2023
- 2023In Search of netUnicorn: A Data-Collection Platform to Develop Generalizable ML Models for Network Security Problems15 Jun 2023
- 2023Verifying Generalization in Deep Learning11 Feb 2023
- 2022Explainability in Deep Reinforcement Learning, a Review into Current Methods and Applications5 Jul 2022
- 2022Verifying Learning-Based Robotic Navigation Systems26 May 2022
- 2022Learning Interpretable, High-Performing Policies for Autonomous Driving4 Feb 2022
- 2021Iterative Bounding MDPs: Learning Interpretable Policies via Non-Interpretable Methods25 Feb 2021
Similar, not cited
Close in wording, no citation either way
- 2021Probabilistic Mixture-of-Experts for Efficient Deep Reinforcement Learning
- 2024SMOSE: Sparse Mixture of Shallow Experts for Interpretable Reinforcement Learning in Continuous Control Tasks
- 2026A Heterogeneous Mixture of Experts Framework for Interpretable Machine Learning
- 2024Mixtures of Experts Unlock Parameter Scaling for Deep RL
- 2026Temporally Extended Mixture-of-Experts Models
- 2024Optimizing Interpretable Decision Tree Policies for Reinforcement Learning
- 2025Towards Stable and Effective Reinforcement Learning for Mixture-of-Experts
- 2023Multi-Task Reinforcement Learning with Mixture of Orthogonal Experts