Explanations that reveal all through the definition of encoding
Aahlad Puli, Nhi Nguyen, Rajesh Ranganath
cs.LG, cs.AI, stat.ML
Submitted: 2024-12-18
Updated: 2026-08-24
Comments: 36 pages, 7 figures, 6 tables, 38th Conference on Neural Information Processing Systems (NeurIPS 2024)
Journal ref: 38th Conference on Neural Information Processing Systems (NeurIPS 2024)
DOI: 10.52202/079017-3172
License: http://creativecommons.org/licenses/by-nc-sa/4.0/
The gist: Feature attributions attempt to highlight what inputs drive predictive power.
Terminology
Abstract
Feature attributions attempt to highlight what inputs drive predictive power. Good attributions or explanations are thus those that produce inputs that retain this predictive power; accordingly, evaluations of explanations score their quality of prediction. However, evaluations produce scores better than what appears possible from the values in the explanation for a class of explanations, called encoding explanations. Probing for encoding remains a challenge because there is no general characterization of what gives the extra predictive power. We develop a definition of encoding that identifies this extra predictive power via conditional dependence and show that the definition fits existing examples of encoding. This definition implies, in contrast to encoding explanations, that non-encoding explanations contain all the informative inputs used to produce the explanation, giving them a "what you see is what you get" property, which makes them transparent and simple to use. Next, we prove that existing scores (ROAR, FRESH, EVAL-X) do not rank non-encoding explanations above encoding ones, and develop STRIPE-X which ranks them correctly. After empirically demonstrating the theoretical insights, we use STRIPE-X to show that despite prompting an LLM to produce non-encoding explanations for a sentiment analysis task, the LLM-generated explanations encode.
Sources
- New-Onset Diabetes Assessment Using Artificial Intelligence-Enhanced Electrocardiography
- RISE: Randomized Input Sampling for Explanation of Black-box Models
- Learning to Faithfully Rationalize by Construction
- Goodhart's Law Applies to NLP's Explanation Benchmarks
- Explanations from Large Language Models Make Small Reasoners Better
- Leakage-Adjusted Simulatability: Can Models Generate Non-Trivial Explanations of Their Behavior in Natural Language?
- "Will You Find These Shortcuts?" A Protocol for Evaluating the Faithfulness of Input Salience Methods for Text Classification
- Logic Traps in Evaluating Attribution Scores
- Towards Faithfully Interpretable NLP Systems: How should we define and evaluate faithfulness?
- Faithfulness Tests for Natural Language Explanations
Related papers
- Polynomial-Augmented Neural Networks (PANNs) with Weak Orthogonality Constraints for Enhanced Function and PDE Approximation
- AIRL-S: Unifying Reinforcement Learning and Search-Based Test-Time Scaling via Adversarial Inverse Reinforcement Learning
- Transformers as Bayesian In-Context Experimenters: Smoothness-Adaptive Efficient ATE Estimation
- Convergence issues in Relational Concept Analysis based on AOC-posets
- Beliefs Beyond Posteriors: The Predictive Cost of ELBO Binding
- Understanding Diffusion Models via Ratio-Based Function Approximation with SignReLU Networks