GLANCE: Global Actions in a Nutshell for Counterfactual Explainability
Loukas Kavouras, Eleni Psaroudaki, Konstantinos Tsopelas, Dimitrios Rontogiannis, Nikolaos Theologitis, Dimitris Sacharidis, Giorgos Giannopoulos, Dimitrios Tomaras, Kleopatra Markou, Dimitrios Gunopulos, Dimitris Fotakis, Ioannis Z. Emiris
摘要
The widespread deployment of machine learning systems in critical real-world decision-making applications has highlighted the urgent need for counterfactual explainability methods that operate effectively. Global counterfactual explanations, expressed as actions to offer recourse, aim to provide succinct explanations and insights applicable to large population subgroups. High effectiveness, measured by the fraction of the population that is provided recourse, ensures that the actions benefit as many individuals as possible. Keeping the cost of actions low ensures the proposed recourse actions remain practical and actionable. Limiting the number of actions that provide global counterfactuals is essential to maximize interpretability. The primary challenge, therefore, is to balance these trade-offs—maximizing effectiveness, minimizing cost, while maintaining a small number of actions. We introduce GLANCE, a versatile and adaptive algorithm that employs a novel agglomerative approach, jointly considering both the feature space and the space of counterfactual actions, thereby accounting for the distribution of points in a way that aligns with the model's structure. This design enables the careful balancing of the trade-offs among the three key objectives, with the size objective functioning as a tunable parameter to keep the actions few and easy to interpret. Our extensive experimental evaluation demonstrates that GLANCE consistently shows greater robustness and performance compared to existing methods across various datasets and models.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
它引用的顶会 Paper3
- Beyond Individualized Recourse: Interpretable and Interactive Summaries of Actionable RecoursesKaivalya Rawal, Himabindu LakkarajuNeurIPS 2020 · 被引用 113 次
- Counterfactual Explanations for Oblique Decision Trees: Exact, Efficient AlgorithmsMiguel Á. Carreira-Perpiñán, Suryabhan Singh HadaAAAI 2021 · 被引用 39 次
- GLOBE-CE: A Translation Based Approach for Global Counterfactual ExplanationsDan Ley, Saumitra Mishra, Daniele MagazzeniICML 2023 · 被引用 30 次
相关 Paper
- ElliCE: Efficient and Provably Robust Algorithmic Recourse via the Rashomon SetsBohdan Turbal, Iryna Voitsitska, Lesia SemenovaNeurIPS 2025 · 被引用 6 次
- GAM Coach: Towards Interactive and User-centered Algorithmic RecourseZijie J. Wang, Jennifer Wortman Vaughan, Rich Caruana, Duen Horng ChauCHI 2023 · 被引用 18 次
- Learning Models for Actionable RecourseAlexis Ross, Himabindu Lakkaraju, Osbert BastaniNeurIPS 2021 · 被引用 25 次
- Counterfactual Explanations Can Be ManipulatedDylan Slack, Anna Hilgard, Himabindu Lakkaraju, Sameer SinghNeurIPS 2021 · 被引用 182 次
- Probabilistically Robust Recourse: Navigating the Trade-offs between Costs and Robustness in Algorithmic RecourseMartin Pawelczyk, Teresa Datta, Johannes van den Heuvel, Gjergji Kasneci 等ICLR 2023 · 被引用 13 次
