A Two-Stage Algorithm for Cost-Efficient Multi-instance Counterfactual Explanations
<|reference_start|>A Two-Stage Algorithm for Cost-Efficient Multi-instance Counterfactual Explanations: Counterfactual explanations constitute among the most popular methods for analyzing black-box systems since they can recommend cost-efficient and actionable changes to the input of a system to obtain the desired system output. While most of the existing counterfactual methods explain a single instance, several real-world problems, such as customer satisfaction, require the identification of a single counterfactual that can satisfy multiple instances (e.g. customers) simultaneously. To address this limitation, in this work, we propose a flexible two-stage algorithm for finding groups of instances and computing cost-efficient multi-instance counterfactual explanations. The paper presents the algorithm and its performance against popular alternatives through a comparative evaluation.<|reference_end|>
@article{artelt2024a,
    title={A Two-Stage Algorithm for Cost-Efficient Multi-instance Counterfactual
  Explanations},
    author={Andr'e Artelt and Andreas Gregoriades},
    journal={arXiv preprint arXiv:2403.01221},
    year={2024},
    archivePrefix={arXiv},
    eprint={2403.01221},
    primaryClass={cs.LG cs.AI}
}