mlsanityData to 7 Oct 2026

Contextual Decision Trees

arXiv 2207.06355 ↗First posted 13 Jul 2022stat.ML cs.LGcited by 2

Not on the map. Why?

Abstract (arXiv)

Focusing on Random Forests, we propose a multi-armed contextual bandit recommendation framework for feature-based selection of a single shallow tree of the learned ensemble. The trained system, which works on top of the Random Forest, dynamically identifies a base predictor that is responsible for providing the final output. In this way, we obtain local interpretations by observing the rules of the recommended tree. The carried out experiments reveal that our dynamic method is superior to an independent fitted CART decision tree and comparable to the whole black-box Random Forest in terms of predictive performances.

Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 12 of its 41 references that are in the map. First posted on arXiv 13 Jul 2022.

Builds on

12 of 41 references.

References · 12

  1. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  2. 2016"Why Should I Trust You?": Explaining the Predictions of Any Classifiercited by 5,040
  3. 2016SGDR: Stochastic Gradient Descent with Warm Restartscited by 4,993
  4. 2018Explaining Explanations: An Overview of Interpretability of Machine Learningcited by 508
  5. 2020A Survey on the Explainability of Supervised Machine Learningcited by 225
  6. 2015Conditional Computation in Neural Networks for faster modelscited by 166
  7. 2019Global Optimality Guarantees For Policy Gradient Methodscited by 146
  8. 2019A Survey on Practical Applications of Multi-Armed and Contextual Banditscited by 44
  9. 2020Born-Again Tree Ensemblescited by 38
  10. 2018Policy Gradients for Contextual Recommendationscited by 21
  11. 2020Online Active Model Selection for Pre-trained Classifierscited by 19
  12. 2019BanditRank: Learning to Rank Using Contextual Banditscited by 3

Built on by

Cited by year

Citing papers per year: 2023: 2.

2 papers.