Case-based Explainability for Random Forest: Prototypes, Critics, Counter-factuals and Semi-factuals
<|reference_start|>Case-based Explainability for Random Forest: Prototypes, Critics, Counter-factuals and Semi-factuals: The explainability of black-box machine learning algorithms, commonly known as Explainable Artificial Intelligence (XAI), has become crucial for financial and other regulated industrial applications due to regulatory requirements and the need for transparency in business practices. Among the various paradigms of XAI, Explainable Case-Based Reasoning (XCBR) stands out as a pragmatic approach that elucidates the output of a model by referencing actual examples from the data used to train or test the model. Despite its potential, XCBR has been relatively underexplored for many algorithms such as tree-based models until recently. We start by observing that most XCBR methods are defined based on the distance metric learned by the algorithm. By utilizing a recently proposed technique to extract the distance metric learned by Random Forests (RFs), which is both geometry- and accuracy-preserving, we investigate various XCBR methods. These methods amount to identify special points from the training datasets, such as prototypes, critics, counter-factuals, and semi-factuals, to explain the predictions for a given query of the RF. We evaluate these special points using various evaluation metrics to assess their explanatory power and effectiveness.<|reference_end|>
@article{yampolsky2024case-based,
    title={Case-based Explainability for Random Forest: Prototypes, Critics,
  Counter-factuals and Semi-factuals},
    author={Gregory Yampolsky, Dhruv Desai, Mingshu Li, Stefano Pasquali, Dhagash
  Mehta},
    journal={arXiv preprint arXiv:2408.06679},
    year={2024},
    archivePrefix={arXiv},
    eprint={2408.06679},
    primaryClass={cs.LG q-fin.ST stat.ML}
}