Pith. sign in

Understanding Neural Networks through Representation Erasure

8 Pith papers cite this work. Polarity classification is still indexing.

8 Pith papers citing it
abstract

While neural networks have been successfully applied to many natural language processing tasks, they come at the cost of interpretability. In this paper, we propose a general methodology to analyze and interpret decisions from a neural model by observing the effects on the model of erasing various parts of the representation, such as input word-vector dimensions, intermediate hidden units, or input words. We present several approaches to analyzing the effects of such erasure, from computing the relative difference in evaluation metrics, to using reinforcement learning to erase the minimum set of input words in order to flip a neural model's decision. In a comprehensive analysis of multiple NLP tasks, including linguistic feature classification, sentence-level sentiment analysis, and document level sentiment aspect prediction, we show that the proposed methodology not only offers clear explanations about neural model decisions, but also provides a way to conduct error analysis on neural models.

representative citing papers

Information Filtering via Variational Regularization for Robot Manipulation

cs.RO · 2026-01-29 · unverdicted · novelty 7.0

Variational Regularization imposes an adaptive information bottleneck on noisy intermediate features in DP3-UNet and DP3-DiT policies, consistently raising task success rates on RoboTwin2.0, Adroit, and MetaWorld while achieving new state-of-the-art results.

Language Models as Knowledge Bases?

cs.CL · 2019-09-03 · accept · novelty 7.0

BERT stores relational knowledge extractable via cloze queries without fine-tuning and matches supervised baselines on open-domain QA tasks.

Caption Bottleneck Models

cs.CV · 2026-07-01 · unverdicted · novelty 6.0

Caption Bottleneck Models use LMM-generated image captions as the sole input to a text classifier, creating leakage-free interpretable models that discover dataset-specific concepts without predefined lists or manual labels.

Understanding Memory Modules on Learning Simple Algorithms

cs.LG · 2019-07-01 · unverdicted · novelty 5.0

NTM and stack-augmented networks both generalize on sequence reversal but only the stack model succeeds on arithmetic expressions by monitoring different input categories and applying distinct memory-update policies.

Interpretable Question Answering on Knowledge Bases and Text

cs.CL · 2019-06-26 · unverdicted · novelty 5.0

Compares LIME, input perturbation and attention for explaining QA on KB+text; proposes automatic evaluation paradigm and finds input perturbation superior in both automatic and human studies.

citing papers explorer

Showing 8 of 8 citing papers.

  • Information Filtering via Variational Regularization for Robot Manipulation cs.RO · 2026-01-29 · unverdicted · none · ref 7 · internal anchor

    Variational Regularization imposes an adaptive information bottleneck on noisy intermediate features in DP3-UNet and DP3-DiT policies, consistently raising task success rates on RoboTwin2.0, Adroit, and MetaWorld while achieving new state-of-the-art results.

  • Language Models as Knowledge Bases? cs.CL · 2019-09-03 · accept · none · ref 269 · internal anchor

    BERT stores relational knowledge extractable via cloze queries without fine-tuning and matches supervised baselines on open-domain QA tasks.

  • SkillRet: A Large-Scale Benchmark for Skill Retrieval in LLM Agents cs.AI · 2026-05-07 · unverdicted · none · ref 18

    SkillRet benchmark shows fine-tuned retrievers improve NDCG@10 by 13+ points over prior models on large-scale skill retrieval for LLM agents.

  • Caption Bottleneck Models cs.CV · 2026-07-01 · unverdicted · none · ref 10 · internal anchor

    Caption Bottleneck Models use LMM-generated image captions as the sole input to a text classifier, creating leakage-free interpretable models that discover dataset-specific concepts without predefined lists or manual labels.

  • Knowledge Dependency Estimation for Reliable Question Answering cs.CL · 2026-05-27 · unverdicted · none · ref 5 · internal anchor

    Knot estimates QA model sensitivity to candidate knowledge via subset counterfactual training and latent factor coverage, yielding unit rankings that outperform baselines without extra model calls.

  • UntrustVul: An Automated Approach for Identifying Untrustworthy Alerts in Vulnerability Detection Models cs.SE · 2025-03-19 · unverdicted · none · ref 31 · internal anchor

    UntrustVul identifies untrustworthy vulnerability predictions by marking lines that neither match historical vulnerability patterns nor influence vulnerable lines through dependencies, reporting AUC 70-88% and F1 82-94% on 115K predictions.

  • Understanding Memory Modules on Learning Simple Algorithms cs.LG · 2019-07-01 · unverdicted · none · ref 9 · internal anchor

    NTM and stack-augmented networks both generalize on sequence reversal but only the stack model succeeds on arithmetic expressions by monitoring different input categories and applying distinct memory-update policies.

  • Interpretable Question Answering on Knowledge Bases and Text cs.CL · 2019-06-26 · unverdicted · none · ref 10 · internal anchor

    Compares LIME, input perturbation and attention for explaining QA on KB+text; proposes automatic evaluation paradigm and finds input perturbation superior in both automatic and human studies.