Ordered Counterfactual Explanation by Mixed-Integer Linear Optimization
Kentaro Kanamori, Takuya Takagi, Ken Kobayashi, Yuichi Ike, Kento Uemura, Hiroki Arimura
摘要
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.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper6
- Using MaxSAT for Efficient Explanations of Tree EnsemblesAlexey Ignatiev, Yacine Izza, Peter J. Stuckey, João Marques-SilvaAAAI 2022 · 被引用 75 次
- Learning Decision Trees and Forests with Algorithmic RecourseKentaro Kanamori, Takuya Takagi, Ken Kobayashi, Yuichi IkeICML 2024 · 被引用 4 次
- DiCoFlex: Model-Agnostic Diverse Counterfactuals with Flexible ControlOleksii Furman, Ulvi Movsum-zada, Patryk Marszalek, Maciej Zieba 等NeurIPS 2025 · 被引用 3 次
- SafeAR: Safe Algorithmic Recourse by Risk-Aware PoliciesHaochen Wu, Shubham Sharma, Sunandita Patra, Sriram GopalakrishnanAAAI 2024 · 被引用 1 次
- Algorithmic Recourse for Long-Term ImprovementKentaro Kanamori, Ken Kobayashi, Satoshi Hara, Takuya TakagiICML 2025
相关 Paper
- Very Fast, Approximate Counterfactual Explanations for Decision ForestsMiguel Á. Carreira-Perpiñán, Suryabhan Singh HadaAAAI 2023 · 被引用 7 次
- Trustworthy Actionable PerturbationsJesse Friedbaum, Sudarshan Adiga, Ravi TandonICML 2024 · 被引用 3 次
- Constraint-Driven Explanations for Black-Box ML ModelsAditya A. Shrotri, Nina Narodytska, Alexey Ignatiev, Kuldeep S. Meel 等AAAI 2022 · 被引用 25 次
- Counterfactual Explanations with Probabilistic Guarantees on their Robustness to Model ChangeIgnacy Stepka, Jerzy Stefanowski, Mateusz LangoKDD 2025 · 被引用 1 次
- A New Approach to Backtracking Counterfactual Explanations: A Unified Causal Framework for Efficient Model InterpretabilityPouria Fatemi, Ehsan Sharifian, Mohammad Hossein YassaeeICML 2025
