mlsanityData to 14 Oct 2026

Interpretable Predictions of Tree-based Ensembles via Actionable Feature Tweaking

arXiv 1706.06691 ↗First posted 20 Jun 2017stat.MLcited by 76

Not on the map. Why?

Abstract (arXiv)

Machine-learned models are often described as "black boxes". In many real-world applications however, models may have to sacrifice predictive power in favour of human-interpretability. When this is the case, feature engineering becomes a crucial task, which requires significant and time-consuming human effort. Whilst some features are inherently static, representing properties that cannot be influenced (e.g., the age of an individual), others capture characteristics that could be adjusted (e.g., the daily amount of carbohydrates taken). Nonetheless, once a model is learned from the data, each prediction it makes on new instances is irreversible - assuming every instance to be a static point located in the chosen feature space. There are many circumstances however where it is important to understand (i) why a model outputs a certain prediction on a given instance, (ii) which adjustable features of that instance should be modified, and finally (iii) how to alter such a prediction when the mutated instance is input back to the model. In this paper, we present a technique that exploits the internals of a tree-based ensemble classifier to offer recommendations for transforming true negative instances into positively predicted ones. We demonstrate the validity of our approach using an online advertising application. First, we design a Random Forest classifier that effectively separates between two types of ads: low (negative) and high (positive) quality ads (instances). Then, we introduce an algorithm that provides recommendations that aim to transform a low quality ad (negative instance) into a high quality one (positive instance). Finally, we evaluate our approach on a subset of the active inventory of a large ad network, Yahoo Gemini.

Key facts. Cited by 76 papers in the map (data through 14 Oct 2026). First posted on arXiv 20 Jun 2017.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2021: 11; 2022: 22; 2023: 14; 2024: 12; 2025: 10; 2026: 7.

76 papers.

Sort:

By area:

  1. 2022From Anecdotal Evidence to Quantitative Evaluation Methods: A Systematic Review on Evaluating Explainable AIcited by 302
  2. 2021CF-GNNExplainer: Counterfactual Explanations for Graph Neural Networkscited by 119
  3. 2021CARLA: A Python Library to Benchmark Algorithmic Recourse and Counterfactual Explanation Algorithmscited by 86
  4. 2021If Only We Had Better Counterfactual Explanations: Five Key Deficits to Rectify in the Evaluation of Counterfactual XAI Techniquescited by 82
  5. 2022Robust Counterfactual Explanations for Tree-Based Ensemblescited by 49
  6. 2022CLEAR: Generative Counterfactual Explanations on Graphscited by 48
  7. 2022Probabilistically Robust Recourse: Navigating the Trade-offs between Costs and Robustness in Algorithmic Recoursecited by 40
  8. 2021Optimal Counterfactual Explanations in Tree Ensemblescited by 36
  9. 2022DualCF: Efficient Model Extraction Attack from Counterfactual Explanationscited by 32
  10. 2022On the Privacy Risks of Algorithmic Recoursecited by 32
  11. 2021M2Lens: Visualizing and Explaining Multimodal Models for Sentiment Analysiscited by 29
  12. 2024Robust Counterfactual Explanations in Machine Learning: A Surveycited by 29
38 more
  1. 2021ReLAX: Reinforcement Learning Agent eXplainer for Arbitrary Predictive Modelscited by 25
  2. 2022Formalising the Robustness of Counterfactual Explanations for Neural Networkscited by 24
  3. 2021Counterfactual Explanations for Arbitrary Regression Modelscited by 22
  4. 2022GREASE: Generate Factual and Counterfactual Explanations for GNN-based Recommendationscited by 22
  5. 2022On the Trade-Off between Actionable Explanations and the Right to be Forgottencited by 20
  6. 2023Provably Robust and Plausible Counterfactual Explanations for Neural Networks via Robust Optimisationcited by 20
  7. 2023Recourse under Model Multiplicity via Argumentative Ensembling (Technical Report)cited by 15
  8. 2021Counterfactual Explanations for Oblique Decision Trees: Exact, Efficient Algorithmscited by 14
  9. 2022From Black Boxes to Conversations: Incorporating XAI in a Conversational Agentcited by 14
  10. 2024Contestable AI needs Computational Argumentationcited by 13
  11. 2023Towards Bridging the Gaps between the Right to Explanation and the Right to be Forgottencited by 10
  12. 2022Global Counterfactual Explanations: Investigations, Implementations and Improvementscited by 9
  13. 2022Synthesizing explainable counterfactual policies for algorithmic recourse with program synthesiscited by 8
  14. 2021MCCE: Monte Carlo sampling of realistic counterfactual explanationscited by 7
  15. 2022Higher-order Neural Additive Models: An Interpretable Machine Learning Model with Feature Interactionscited by 7
  16. 2023Explainable Data-Driven Optimization: From Context to Decision and Back Againcited by 7
  17. 2024A multi-criteria approach for selecting an explanation from the set of counterfactuals produced by an ensemble of explainerscited by 7
  18. 2024Interval Abstractions for Robust Counterfactual Explanationscited by 7
  19. 2024Learning Decision Trees and Forests with Algorithmic Recoursecited by 7
  20. 2025Symbolic Knowledge Extraction and Injection with Sub-symbolic Predictors: A Systematic Literature Reviewcited by 7
  21. 2023Flexible and Robust Counterfactual Explanations with Minimal Satisfiable Perturbationscited by 6
  22. 2022Sparse Vicious Attacks on Graph Neural Networkscited by 5
  23. 2023Navigating Explanatory Multiverse Through Counterfactual Path Geometrycited by 5
  24. 2024Sparse and Faithful Explanations Without Sparse Modelscited by 5
  25. 2022Computing Rule-Based Explanations by Leveraging Counterfactualscited by 4
  26. 2023Very fast, approximate counterfactual explanations for decision forestscited by 4
  27. 2023Explaining Black-Box Models through Counterfactualscited by 4
  28. 2023Prediction without Preclusion: Recourse Verification with Reachable Setscited by 4
  29. 2024Generating Feasible and Plausible Counterfactual Explanations for Outcome Prediction of Business Processescited by 4
  30. 2021An exact counterfactual-example-based approach to tree-ensemble models interpretabilitycited by 3
  31. 2024Privacy Implications of Explainable AI in Data-Driven Systemscited by 3
  32. 2022Don't Explain Noise: Robust Counterfactuals for Randomized Ensemblescited by 2
  33. 2023counterfactuals: An R Package for Counterfactual Explanation Methodscited by 2
  34. 2023Evading Community Detection via Counterfactual Neighborhood Searchcited by 2
  35. 2024Natural Language Counterfactual Explanations for Graphs Using Large Language Modelscited by 2
  36. 2025DiCoFlex: Model-agnostic diverse counterfactuals with flexible controlcited by 2
  37. 2026Fair Recourse for All: Ensuring Individual and Group Fairness in Counterfactual Explanationscited by 2
  38. 2026Counterfactual Maps: What They Are and How to Find Themcited by 2

50 most cited of 76 All 76 (JSON)