paper-with-me

홈 › Papers

Exploring the Trade-off Between Model Performance and Explanation Plausibility of Text Classifiers Using Human Rationales

2024-04-03 · Lucas E. Resck, Marcos M. Raimundo, Jorge Poco

Saliency post-hoc explainability methods are important tools for understanding increasingly complex NLP models. While these methods can reflect the model's reasoning, they may not align with human intuition, making the explanations not plausible. In this work, we present a methodology for incorporating rationales, which are text annotations explaining human decisions, into text classification models. This incorporation enhances the plausibility of post-hoc explanations while preserving their faithfulness. Our approach is agnostic to model architectures and explainability methods. We introduce the rationales during model training by augmenting the standard cross-entropy loss with a novel loss function inspired by contrastive learning. By leveraging a multi-objective optimization algorithm, we explore the trade-off between the two loss functions and generate a Pareto-optimal frontier of models that balance performance and plausibility. Through extensive experiments involving diverse models, datasets, and explainability methods, we demonstrate that our approach significantly enhances the quality of model explanations without causing substantial (sometimes negligible) degradation in the original model's performance.

📄 PDF Abstract BibTeX arXiv:2404.03098

Code (1)

visual-ds/plausible-nlp-explanations 공식 구현

Tasks

Contrastive LearningHate Speech DetectionSentiment Classificationtext-classificationText Classification

Methods 이 논문이 사용한 방법론

ALIGN In the ALIGN method, visual and language representations are jointly trained from noisy image alt-text data. The image and text encoders are learned via contrastive loss…

Similar Papers 제목 키워드 기반

A Question on the Explainability of Large Language Models and the Word-Level Univariate First-Order Plausibility Assumption

2024-03-15 · Jeremie Bogaert, Francois-Xavier Standaert

The explanations of large language models have recently been shown to be sensitive to the randomness used for their training, creating a need to characterize this sensitivity. In this paper, we propose a characterization…

NICE: An Algorithm for Nearest Instance Counterfactual Explanations

2021-04-15 · Dieter Brughmans, Pieter Leyman, David Martens

In this paper we suggest NICE: a new algorithm to generate counterfactual explanations for heterogeneous tabular data. The design of our algorithm specifically takes into account algorithmic requirements that often emerg…

counterfactual

Few-Shot Self-Rationalization with Natural Language Prompts

2021-12-17 · ACL ARR December 2022 12 · Anonymous

Self-rationalization models that predict task labels and generate free-text elaborations for their predictions could enable more intuitive interaction with NLP systems. These models are, however, currently trained with a…

Few-Shot Self-Rationalization with Natural Language Prompts

2021-11-16 · Findings (NAACL) 2022 7 · Ana Marasović, Iz Beltagy, Doug Downey, Matthew E. Peters

Self-rationalization models that predict task labels and generate free-text elaborations for their predictions could enable more intuitive interaction with NLP systems. These models are, however, currently trained with a…

CounterFlowNet: From Minimal Changes to Meaningful Counterfactual Explanations

2026-02-19 · Oleksii Furman, Patryk Marszałek, Jan Masłowski, Piotr Gaiński 외 arxiv

Counterfactual explanations (CFs) provide human-interpretable insights into model's predictions by identifying minimal changes to input features that would alter the model's output. However, existing methods struggle to …