Circuit Representations of Random Forests with Applications to XAI
We make three contributions in this paper. First, we present an approach for compiling a random forest classifier into a set of circuits, where each circuit directly encodes the instances in some class of the classifier. We show empirically that our proposed approach is significantly more efficient than existing similar approaches. Next, we utilize this approach to further obtain circuits that are tractable for computing the complete and general reasons of a decision, which are instance abstractions that play a fundamental role in computing explanations. Finally, we propose algorithms for computing the robustness of a decision and all shortest ways to flip it. We illustrate the utility of our contributions by using them to enumerate all sufficient reasons, necessary reasons and contrastive explanations of decisions; to compute the robustness of decisions; and to identify all shortest ways to flip the decisions made by random forest classifiers learned from a wide range of datasets.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Circuit-Based Intrinsic Methods to Detect Overfitting
The focus of this paper is on intrinsic methods to detect overfitting. By intrinsic methods, we mean methods that rely only on the model and the training data, as opposed to traditional methods (we call them extrinsic me…
counterfactualMemorizationData-driven design of fault diagnosis for three-phase PWM rectifier using random forests technique with transient synthetic features
A three-phase pulse-width modulation (PWM) rectifier can usually maintain operation when open-circuit faults occur in insulated-gate bipolar transistors (IGBTs), which will lead the system to be unstable and unsafe. Aimi…
Fault DiagnosisQ-learning with online random forests
$Q$-learning is the most fundamental model-free reinforcement learning algorithm. Deployment of $Q$-learning requires approximation of the state-action value function (also known as the $Q$-function). In this work, we pr…
Q-Learningreinforcement-learningReinforcement LearningReinforcement Learning (RL)Adversarial random forests for density estimation and generative modeling
We propose methods for density estimation and data synthesis using a novel form of unsupervised random forests. Inspired by generative adversarial networks, we implement a recursive procedure in which trees gradually lea…
Density EstimationSynthetic Data GenerationPairwise Conditional Random Forests for Facial Expression Recognition
Facial expression can be seen as the dynamic variation of one's appearance over time. Successful recognition thus involves finding representations of high-dimensional spatiotemporal patterns that can be generalized to un…
Facial Expression RecognitionFacial Expression Recognition (FER)