CHAOSMINING: Benchmarking Post-Hoc Attribution with Sparse Informative Features in High Dimensions
cs.LG, cs.AI
Submitted: 2024-06-17
Updated: 2026-10-05
Comments: 13 pages, 5 figures, Proceedings of ICDMW 2026
Code: https://github.com/geshijoker/ChaosMining
License: http://creativecommons.org/licenses/by-nc-sa/4.0/
The gist: Post-hoc attribution is widely used to identify important model inputs, but evaluating whether these attributions identify truly informative features is difficult because real datasets rarely provide
Terminology
Abstract
Post-hoc attribution is widely used to identify important model inputs, but evaluating whether these attributions identify truly informative features is difficult because real datasets rarely provide reliable ground truth. We introduce a multimodal benchmark containing symbolic tabular, vision, and audio tasks with known informative feature sets. In the main benchmark conditions, informative variables, spatial regions, or channels occupy fixed input coordinates while the remaining inputs provide irrelevant or distracting information. We use the benchmark to study how attribution quality depends on predictive performance, irrelevant-feature burden and structure, model configuration, and attribution mechanism, while separately measuring identification, stability, and computational cost. In most symbolic-data sweeps, informative-set identification co-varies with predictive performance, while the relative ordering of attribution methods remains largely stable. Across modalities, no method dominates all architectures and conditions, and greater attribution complexity does not consistently improve identification. Simple gradient attribution is often competitive at lower computational cost, while the vision and audio results show that architecture and the form of irrelevant content materially affect attribution quality.
Sources
- Towards better understanding of gradient-based attribution methods for Deep Neural Networks
- An Image is Worth 16x16 Words: Transformers for Image Recognition at Scale
- Neural Machine Translation in Linear Time
- Captum: A unified and generic model interpretability library for PyTorch
- Synthetic Benchmarks for Scientific Research in Explainable Machine Learning
- BAGEL: A Benchmark for Assessing Graph Neural Network Explanations
- Long Short-Term Memory Based Recurrent Neural Network Architectures for Large Vocabulary Speech Recognition
- Very Deep Convolutional Networks for Large-Scale Image Recognition
- Deep Inside Convolutional Networks: Visualising Image Classification Models and Saliency Maps
- A Fine-grained Interpretability Evaluation Benchmark for Neural NLP
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