Example-based Explanations for Random Forests using Machine Unlearning
Tanmay Surve, Romila Pradhan

TL;DR
This paper introduces FairDebugger, a system that uses machine unlearning and data mining techniques to identify training data responsible for fairness violations in random forest classifiers.
Contribution
It presents a novel method combining machine unlearning and frequent itemset mining to explain and debug fairness issues in tree-based models.
Findings
FairDebugger effectively identifies data subsets linked to unfair outcomes.
The explanations align with prior domain knowledge and insights.
The approach is validated on three real-world datasets.
Abstract
Tree-based machine learning models, such as decision trees and random forests, have been hugely successful in classification tasks primarily because of their predictive power in supervised learning tasks and ease of interpretation. Despite their popularity and power, these models have been found to produce unexpected or discriminatory outcomes. Given their overwhelming success for most tasks, it is of interest to identify sources of their unexpected and discriminatory behavior. However, there has not been much work on understanding and debugging tree-based classifiers in the context of fairness. We introduce FairDebugger, a system that utilizes recent advances in machine unlearning research to identify training data subsets responsible for instances of fairness violations in the outcomes of a random forest classifier. FairDebugger generates top- explanations (in the form of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsExplainable Artificial Intelligence (XAI) · Machine Learning and Data Classification
