paper-with-me

홈 › Papers

Provably Better Explanations with Optimized Aggregation of Feature Attributions

2024-06-07 · Thomas Decker, Ananta R. Bhattarai, Jindong Gu, Volker Tresp, Florian Buettner

Using feature attributions for post-hoc explanations is a common practice to understand and verify the predictions of opaque machine learning models. Despite the numerous techniques available, individual methods often produce inconsistent and unstable results, putting their overall reliability into question. In this work, we aim to systematically improve the quality of feature attributions by combining multiple explanations across distinct methods or their variations. For this purpose, we propose a novel approach to derive optimal convex combinations of feature attributions that yield provable improvements of desired quality criteria such as robustness or faithfulness to the model behavior. Through extensive experiments involving various model architectures and popular feature attribution techniques, we demonstrate that our combination strategy consistently outperforms individual methods and existing baselines.

📄 PDF Abstract BibTeX arXiv:2406.05090

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Global Aggregations of Local Explanations for Black Box models

2019-07-05 · Ilse van der Linden, Hinda Haned, Evangelos Kanoulas

The decision-making process of many state-of-the-art machine learning models is inherently inscrutable to the extent that it is impossible for a human to interpret the model directly: they are black box models. This has …

Decision MakingOpen-Ended Question Answering

Provably Explaining Neural Additive Models

2026-02-19 · Shahaf Bassan, Yizhak Yisrael Elboher, Tobias Ladner, Volkan Şahin 외 arxiv

Despite significant progress in post-hoc explanation methods for neural networks, many remain heuristic and lack provable guarantees. A key approach for obtaining explanations with provable guarantees is by identifying a…

Multi-criteria Rank-based Aggregation for Explainable AI

2025-05-30 · Sujoy Chatterjee, Everton Romanzini Colombo, Marcos Medeiros Raimundo

Explainability is crucial for improving the transparency of black-box machine learning models. With the advancement of explanation methods such as LIME and SHAP, various XAI performance metrics have been developed to eva…

Decision MakingFeature Importance

ElliCE: Efficient and Provably Robust Algorithmic Recourse via the Rashomon Sets

2026-02-07 · Bohdan Turbal, Iryna Voitsitska, Lesia Semenova arxiv

Machine learning models now influence decisions that directly affect people's lives, making it important to understand not only their predictions, but also how individuals could act to obtain better results. Algorithmic …

Explaining, Fast and Slow: Abstraction and Refinement of Provable Explanations

2025-06-10 · Shahaf Bassan, Yizhak Yisrael Elboher, Tobias Ladner, Matthias Althoff 외

Despite significant advancements in post-hoc explainability techniques for neural networks, many current methods rely on heuristics and do not provide formally provable guarantees over the explanations provided. Recent w…