Pith. sign in

Locally Aggregated Feature Attribution on Natural Language Model Understanding

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
abstract

With the growing popularity of deep-learning models, model understanding becomes more important. Much effort has been devoted to demystify deep neural networks for better interpretability. Some feature attribution methods have shown promising results in computer vision, especially the gradient-based methods where effectively smoothing the gradients with reference data is key to a robust and faithful result. However, direct application of these gradient-based methods to NLP tasks is not trivial due to the fact that the input consists of discrete tokens and the "reference" tokens are not explicitly defined. In this work, we propose Locally Aggregated Feature Attribution (LAFA), a novel gradient-based feature attribution method for NLP models. Instead of relying on obscure reference tokens, it smooths gradients by aggregating similar reference texts derived from language model embeddings. For evaluation purpose, we also design experiments on different NLP tasks including Entity Recognition and Sentiment Analysis on public datasets as well as key feature detection on a constructed Amazon catalogue dataset. The superior performance of the proposed method is demonstrated through experiments.

fields

cs.LG 1

years

2025 1

verdicts

CONDITIONAL 1

representative citing papers

Probabilistic Stability Guarantees for Feature Attributions

cs.LG · 2025-04-18 · conditional · novelty 6.0

Soft stability measures the probability that an explanation's prediction survives additive feature perturbations, and a sampling algorithm certifies this rate with statistical guarantees.

citing papers explorer

Showing 1 of 1 citing paper.

  • Probabilistic Stability Guarantees for Feature Attributions cs.LG · 2025-04-18 · conditional · none · ref 73 · internal anchor

    Soft stability measures the probability that an explanation's prediction survives additive feature perturbations, and a sampling algorithm certifies this rate with statistical guarantees.