mlsanityData to 14 Oct 2026

Mo"ET: Mixture of Expert Trees and its Application to Verifiable Reinforcement Learning

arXiv 1906.06717 ↗First posted 16 Jun 2019cs.LG cs.AI stat.MLcited by 12

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

  1. 2015Distilling the Knowledge in a Neural Networkcited by 10,324
  2. 2016"Why Should I Trust You?": Explaining the Predictions of Any Classifiercited by 5,070
  3. 2017Towards A Rigorous Science of Interpretable Machine Learningcited by 1,416
  4. 2018A Survey Of Methods For Explaining Black Box Modelscited by 973
  5. 2015Dueling Network Architectures for Deep Reinforcement Learningcited by 785
  6. 2016The Mythos of Model Interpretabilitycited by 721
  7. 2018Born Again Neural Networkscited by 546
  8. 2015Policy Distillationcited by 440
  9. 2018Verifiable Reinforcement Learning via Policy Extractioncited by 177
  10. 2018Local Rule-Based Explanations of Black Box Decision Systemscited by 166
  11. 2019Explainable Machine Learning for Scientific Insights and Discoveriescited by 166
  12. 2018Learning Finite State Representations of Recurrent Policy Networkscited by 37
2 more
  1. 2019Formal Verification of Input-Output Mappings of Tree Ensemblescited by 13
  2. 2019Hierarchical Routing Mixture of Expertscited by 5

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2021: 1; 2022: 3; 2023: 3; 2024: 3; 2025: 0; 2026: 2.

12 papers.

Similar, not cited

Close in wording, no citation either way

  1. 2021Probabilistic Mixture-of-Experts for Efficient Deep Reinforcement Learning
  2. 2024SMOSE: Sparse Mixture of Shallow Experts for Interpretable Reinforcement Learning in Continuous Control Tasks
  3. 2026A Heterogeneous Mixture of Experts Framework for Interpretable Machine Learning
  4. 2024Mixtures of Experts Unlock Parameter Scaling for Deep RL
  5. 2026Temporally Extended Mixture-of-Experts Models
  6. 2024Optimizing Interpretable Decision Tree Policies for Reinforcement Learning
  7. 2025Towards Stable and Effective Reinforcement Learning for Mixture-of-Experts
  8. 2023Multi-Task Reinforcement Learning with Mixture of Orthogonal Experts