paper-with-me

홈 › Papers

Directly Optimizing Explanations for Desired Properties

2024-10-31 · Hiwot Belay Tadesse, Alihan Hüyük, Weiwei Pan, Finale Doshi-Velez

When explaining black-box machine learning models, it's often important for explanations to have certain desirable properties. Most existing methods `encourage' desirable properties in their construction of explanations. In this work, we demonstrate that these forms of encouragement do not consistently create explanations with the properties that are supposedly being targeted. Moreover, they do not allow for any control over which properties are prioritized when different properties are at odds with each other. We propose to directly optimize explanations for desired properties. Our direct approach not only produces explanations with optimal properties more consistently but also empowers users to control trade-offs between different properties, allowing them to create explanations with exactly what is needed for a particular task.

📄 PDF Abstract BibTeX arXiv:2410.23880

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

A Formal Approach to Explainability

2020-01-15 · Lior Wolf, Tomer Galanti, Tamir Hazan

We regard explanations as a blending of the input sample and the model's output and offer a few definitions that capture various desired properties of the function that generates these explanations. We study the links be…

RACCER: Towards Reachable and Certain Counterfactual Explanations for Reinforcement Learning

2023-03-08 · Jasmina Gajcin, Ivana Dusparic

While reinforcement learning (RL) algorithms have been successfully applied to numerous tasks, their reliance on neural networks makes their behavior difficult to understand and trust. Counterfactual explanations are hum…

counterfactualreinforcement-learningReinforcement LearningReinforcement Learning (RL)

Strength Change Explanations in Quantitative Argumentation

2026-01-26 · Timotheus Kampik, Xiang Yin, Nico Potyka, Francesca Toni arxiv

In order to make argumentation-based inference contestable, it is crucial to explain what changes can achieve a desired (instead of the contested) inference result. To this end, we introduce strength change explanations …

Perks and Pitfalls of Faithfulness in Regular, Self-Explainable and Domain Invariant GNNs

2024-06-21 · Steve Azzolin, Antonio Longa, Stefano Teso, Andrea Passerini

As Graph Neural Networks (GNNs) become more pervasive, it becomes paramount to build robust tools for computing explanations of their predictions. A key desideratum is that these explanations are faithful, i.e., that the…

InformativenessOut-of-Distribution Generalization

Beyond One-Size-Fits-All: Adapting Counterfactual Explanations to User Objectives

2024-04-12 · Orfeas Menis Mastromichalakis, Jason Liartis, Giorgos Stamou

Explainable Artificial Intelligence (XAI) has emerged as a critical area of research aimed at enhancing the transparency and interpretability of AI systems. Counterfactual Explanations (CFEs) offer valuable insights into…

AllcounterfactualDecision MakingExplainable artificial intelligence+1