mlsanityData to 14 Oct 2026

SPEX: Scaling Feature Interaction Explanations for LLMs

arXiv 2502.13870 ↗First posted 19 Feb 2025cs.LG cs.AI cs.CLcited by 12

Not on the map. Why?

Abstract (arXiv)

Large language models (LLMs) have revolutionized machine learning due to their ability to capture complex interactions between input features. Popular post-hoc explanation methods like SHAP provide marginal feature attributions, while their extensions to interaction importances only scale to small input lengths (≈ 20). We propose Spectral Explainer (SPEX), a model-agnostic interaction attribution algorithm that efficiently scales to large input lengths (≈ 1000). SPEX exploits underlying natural sparsity among interactions -- common in real-world data -- and applies a sparse Fourier transform using a channel decoding algorithm to efficiently identify important interactions. We perform experiments across three difficult long-context datasets that require LLMs to utilize interactions between inputs to complete the task. For large inputs, SPEX outperforms marginal attribution methods by up to 20% in terms of faithfully reconstructing LLM outputs. Further, SPEX successfully identifies key features and interactions that strongly influence model output. For one of our datasets, HotpotQA, SPEX provides interactions that align with human annotations. Finally, we use our model-agnostic approach to generate explanations to demonstrate abstract reasoning in closed-source LLMs (GPT-4o mini) and compositional reasoning in vision-language models.

Key facts. Cited by 12 papers in the map (data through 14 Oct 2026). Builds on 31 of its 62 references that are in the map. First posted on arXiv 19 Feb 2025.

Builds on

31 of 62 references.

References · 31

  1. 2017A Unified Approach to Interpreting Model Predictionscited by 6,555
  2. 2016"Why Should I Trust You?": Explaining the Predictions of Any Classifiercited by 5,070
  3. 2019DistilBERT, a distilled version of BERT: smaller, faster, cheaper and lightercited by 4,307
  4. 2018HotpotQA: A Dataset for Diverse, Explainable Multi-hop Question Answeringcited by 3,754
  5. 2017Axiomatic Attribution for Deep Networkscited by 3,384
  6. 2019DROP: A Reading Comprehension Benchmark Requiring Discrete Reasoning Over Paragraphscited by 903
  7. 2018RISE: Randomized Input Sampling for Explanation of Black-box Modelscited by 838
  8. 2018Learning to Explain: An Information-Theoretic Perspective on Model Interpretationcited by 248
  9. 2016Layer-wise Relevance Propagation for Neural Networks with Local Renormalization Layerscited by 199
  10. 2018Deep learning generalizes because the parameter-function map is biased towards simple functionscited by 183
  11. 2019The Shapley Taylor Interaction Indexcited by 143
  12. 2022Data Banzhaf: A Robust Data Valuation Framework for Machine Learningcited by 132
19 more
  1. 2021Scatterbrain: Unifying Sparse and Low-rank Attention Approximationcited by 130
  2. 2024ContextCite: Attributing Model Generation to Contextcited by 98
  3. 2023Tell Your Model Where to Attend: Post-hoc Attention Steering for LLMscited by 91
  4. 2021Vision-and-Language or Vision-for-Language? On Cross-Modal Influence in Multimodal Transformerscited by 72
  5. 2022Faith-Shap: The Faithful Shapley Interaction Indexcited by 69
  6. 2019A Fine-Grained Spectral Perspective on Neural Networkscited by 68
  7. 2023SHAP-IQ: Unified Approximation of any-order Shapley Interactionscited by 51
  8. 2022MM-SHAP: A Performance-agnostic Metric for Measuring Multimodal Contributions in Vision and Language Models & Taskscited by 43
  9. 2024Easy Problems That LLMs Get Wrongcited by 30
  10. 2024Efficient Automated Circuit Discovery in Transformers using Contextual Decompositioncited by 23
  11. 2024SVARM-IQ: Efficient Approximation of Any-order Shapley Interactions through Stratificationcited by 16
  12. 2024Learning to Understand: Identifying Interactions via the M"obius Transformcited by 13
  13. 2024Towards the Dynamics of a DNN Learning Symbolic Interactionscited by 13
  14. 2024Multi-Level Explanations for Generative Language Modelscited by 11
  15. 2024Large Language Models Cannot Explain Themselvescited by 11
  16. 2024On Recovering Higher-order Interactions from Protein Language Modelscited by 10
  17. 2023Efficiently Computing Sparse Fourier Transforms of q-ary Functionscited by 7
  18. 2022Trade-off Between Efficiency and Consistency for Removal-based Explanationscited by 6
  19. 2013Computing a k-sparse n-length Discrete Fourier Transform using at most 4k samples and O(k log k) complexitycited by 3

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2025: 3; 2026: 9.

12 papers.

Similar, not cited

Close in wording, no citation either way

  1. 2025Interpreting and Steering LLMs with Mutual Information-based Explanations on Sparse Autoencoders
  2. 2025A Survey on Sparse Autoencoders: Interpreting the Internal Mechanisms of Large Language Models
  3. 2024From Feature Importance to Natural Language Explanations Using LLMs with RAG
  4. 2023In-Context Explainers: Harnessing LLMs for Explaining Black Box Models
  5. 2025Gaussian mixture models as a proxy for interacting language models
  6. 2025Aligning What LLMs Do and Say: Towards Self-Consistent Explanations
  7. 2025Explainability of Large Language Models: Opportunities and Challenges toward Generating Trustworthy Explanations
  8. 2024Rethinking Interpretability in the Era of Large Language Models