Personal Insights for Altering Decisions of Tree-based Ensembles over Time
Nave Frost, Naama Boer, Daniel Deutch, Tova Milo
Abstract
Machine Learning models are prevalent in critical human-related decision making, such as resume filtering and loan applications. Refused individuals naturally ask what could change the decision, should they reapply. This question is hard for the model owner to answer: first, the model is typically complex and not easily interpretable; second, models may be updated periodically; and last, attributes of the individual seeking approval are apt to change in time. While each of these challenges have been extensively studied in isolation, their conjunction has not. To this end, we propose a novel framework that allows users to devise a plan of action to individuals in presence of Machine Learning classification, where both the ML model and the user properties are expected to change over time. Our technical solution is currently confined to a particular yet important class of models, namely those of tree-based ensembles (Random Forests, Gradient Boosted trees). In this setting it uniquely combines state-of-the-art solutions for single model interpretation, domain adaptation techniques for predicting future models, and constraint databases to represent and query the space of possible actions. We devise efficient algorithms that leverage these foundations in a novel solution, and experimentally show that they are effective in proposing useful and actionable steps leading to the desired classification.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Cited by top-tier papers1
Ask how each one uses itBuilds on2
- Algorithmic Transparency via Quantitative Input Influence: Theory and Experiments with Learning SystemsAnupam Datta, Shayak Sen, Yair ZickS&P 2016 · 774 citations
- Manipulating and Measuring Model InterpretabilityForough Poursabzi-Sangdeh, Daniel G. Goldstein, Jake M. Hofman, Jennifer Wortman Vaughan et al.CHI 2021 · 663 citations
Related papers
- FOCUS: Flexible Optimizable Counterfactual Explanations for Tree EnsemblesAna Lucic, Harrie Oosterhuis, Hinda Haned, Maarten de RijkeAAAI 2022 · 87 citations
- Synthesizing Action Sequences for Modifying Model DecisionsGoutham Ramakrishnan, Yun Chan Lee, Aws AlbarghouthiAAAI 2020 · 37 citations
- Learning Decision Trees and Forests with Algorithmic RecourseKentaro Kanamori, Takuya Takagi, Ken Kobayashi, Yuichi IkeICML 2024 · 4 citations
- Prediction without Preclusion: Recourse Verification with Reachable SetsAvni Kothari, Bogdan Kulynych, Tsui-Wei Weng, Berk UstunICLR 2024 · 7 citations
- Rehearsal Learning for Avoiding Undesired FutureTian Qin, Tian-Zuo Wang, Zhi-Hua ZhouNeurIPS 2023 · 8 citations
