Ordered Counterfactual Explanation by Mixed-Integer Linear Optimization
Kentaro Kanamori, Takuya Takagi, Ken Kobayashi, Yuichi Ike, Kento Uemura, Hiroki Arimura
Abstract
Counterfactual Explanation (CE) is one of the post-hoc explanation methods that provides a perturbation vector so as to alter the prediction result obtained from a classifier. Users can directly interpret the perturbation as an "action" for obtaining their desired decision results. However, an action extracted by existing methods often becomes unrealistic for users because they do not adequately care about the characteristics corresponding to the empirical data distribution such as feature-correlations and outlier risk. To suggest an executable action for users, we propose a new framework of CE for extracting an action by evaluating its reality on the empirical data distribution. The key idea of our proposed method is to define a new cost function based on the Mahalanobis' distance and the local outlier factor. Then, we propose a mixed-integer linear optimization approach to extracting an optimal action by minimizing our cost function. By experiments on real datasets, we confirm the effectiveness of our method in comparison with existing methods for CE.
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.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext a67caa9d-0878-4198-828f-0cdc3d557aecCited by top-tier papers6
- Using MaxSAT for Efficient Explanations of Tree EnsemblesAlexey Ignatiev, Yacine Izza, Peter J. Stuckey, João Marques-SilvaAAAI 2022 · 75 citations
- Learning Decision Trees and Forests with Algorithmic RecourseKentaro Kanamori, Takuya Takagi, Ken Kobayashi, Yuichi IkeICML 2024 · 4 citations
- DiCoFlex: Model-Agnostic Diverse Counterfactuals with Flexible ControlOleksii Furman, Ulvi Movsum-zada, Patryk Marszalek, Maciej Zieba et al.NeurIPS 2025 · 3 citations
- SafeAR: Safe Algorithmic Recourse by Risk-Aware PoliciesHaochen Wu, Shubham Sharma, Sunandita Patra, Sriram GopalakrishnanAAAI 2024 · 1 citation
- Algorithmic Recourse for Long-Term ImprovementKentaro Kanamori, Ken Kobayashi, Satoshi Hara, Takuya TakagiICML 2025
Related papers
- Very Fast, Approximate Counterfactual Explanations for Decision ForestsMiguel Á. Carreira-Perpiñán, Suryabhan Singh HadaAAAI 2023 · 7 citations
- Trustworthy Actionable PerturbationsJesse Friedbaum, Sudarshan Adiga, Ravi TandonICML 2024 · 3 citations
- Constraint-Driven Explanations for Black-Box ML ModelsAditya A. Shrotri, Nina Narodytska, Alexey Ignatiev, Kuldeep S. Meel et al.AAAI 2022 · 25 citations
- Counterfactual Explanations with Probabilistic Guarantees on their Robustness to Model ChangeIgnacy Stepka, Jerzy Stefanowski, Mateusz LangoKDD 2025 · 1 citation
- A New Approach to Backtracking Counterfactual Explanations: A Unified Causal Framework for Efficient Model InterpretabilityPouria Fatemi, Ehsan Sharifian, Mohammad Hossein YassaeeICML 2025
