mlsanityData to 7 Oct 2026

Decomposition of Evidence, Contradiction, and Fragility in Perturbation Responses

arXiv 2608.12935 ↗First posted 13 Aug 2026cs.AI cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

Perturbation methods explain model decisions by measuring prediction changes under altered inputs, but response magnitude tells us only how much a model reacts, not what that reaction means. The same magnitude can support the final factual-counterfactual difference, oppose it, or arise strongly along the perturbation path yet vanish at the endpoint. We therefore track how the contrast develops as paired inputs are progressively revealed, using the final contrast to interpret the trajectory. We introduce DECAF (Decomposition of Evidence, Contradiction, And Fragility), which routes aligned, opposed, and endpoint-null responses into evidence E, contradiction C, and fragility F. The decomposition preserves ordinary magnitude exactly, Abs = E + C + F, and is unique under endpoint-relative axioms. Across controlled vision and tabular settings, the three components track independently measured behavior. In a 72-model ImageNet-9 audit, we compare cases with nearly identical response magnitude but different independently measured behaviors. The largest DECAF component agrees with an observed behavior in 96.4% of cases, compared with 35.0% for magnitude alone. Changing only the reveal path increases total response by nearly 80%, yet evidence barely changes while fragility grows by more than 4x. On FunnyBirds and ImageNet-1k, short forward-only DECAF trajectories outperform the tested general-purpose attribution baselines. On a 1B-scale DINOv2 model, a short trajectory matches a strong gradient-based baseline with 4.75x lower wall time and 2.36x lower peak memory.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 42 of its 46 references that are in the map. First posted on arXiv 13 Aug 2026.

Builds on

42 of 46 references.

References · 42

  1. 2016Grad-CAM: Visual Explanations from Deep Networks via Gradient-based Localizationcited by 6,690
  2. 2017A Unified Approach to Interpreting Model Predictionscited by 6,488
  3. 2016"Why Should I Trust You?": Explaining the Predictions of Any Classifiercited by 5,040
  4. 2017Axiomatic Attribution for Deep Networkscited by 3,350
  5. 2013Deep Inside Convolutional Networks: Visualising Image Classification Models and Saliency Mapscited by 2,348
  6. 2013Visualizing and Understanding Convolutional Networkscited by 2,278
  7. 2020Shortcut Learning in Deep Neural Networkscited by 1,928
  8. 2017Learning Important Features Through Propagating Activation Differencescited by 1,454
  9. 2017Interpretability Beyond Feature Attribution: Quantitative Testing with Concept Activation Vectors (TCAV)cited by 1,309
  10. 2018Sanity Checks for Saliency Mapscited by 1,149
  11. 2017SmoothGrad: removing noise by adding noisecited by 1,097
  12. 2020Concept Bottleneck Modelscited by 1,022
30 more
  1. 2018RISE: Randomized Input Sampling for Explanation of Black-box Modelscited by 825
  2. 2017Interpretable Explanations of Black Boxes by Meaningful Perturbationcited by 611
  3. 2018A Benchmark for Interpretability Methods in Deep Neural Networkscited by 467
  4. 2017Interpretation of Neural Networks is Fragilecited by 443
  5. 2019Fooling LIME and SHAP: Adversarial Attacks on Post hoc Explanation Methodscited by 440
  6. 2020Noise or Signal: The Role of Image Backgrounds in Object Recognitioncited by 342
  7. 2018Understanding disentangling in β-VAEcited by 332
  8. 2017The (Un)reliability of saliency methodscited by 331
  9. 2019Counterfactual Visual Explanationscited by 312
  10. 2019On the (In)fidelity and Sensitivity for Explanationscited by 309
  11. 2018Explanations based on the Missing: Towards Contrastive Explanations with Pertinent Negativescited by 261
  12. 2019Understanding Deep Networks via Extremal Perturbations and Smooth Maskscited by 257
  13. 2020Explaining by Removing: A Unified Framework for Model Explanationcited by 218
  14. 2019Explanations can be manipulated and geometry is to blamecited by 215
  15. 2019Full-Gradient Representation for Neural Network Visualizationcited by 189
  16. 2019Feature relevance quantification in explainable AI: A causal problemcited by 164
  17. 2018Explaining Image Classifiers by Counterfactual Generationcited by 144
  18. 2019Explaining Classifiers with Causal Concept Effect (CaCE)cited by 135
  19. 2021FastSHAP: Real-Time Shapley Value Estimationcited by 123
  20. 2021Guided Integrated Gradients: An Adaptive Path Method for Removing Noisecited by 102
  21. 2022A Consistent and Efficient Evaluation Strategy for Attribution Methodscited by 100
  22. 2020Shapley explainability on the data manifoldcited by 88
  23. 2019Neural Network Attributions: A Causal Perspectivecited by 77
  24. 2020Attribution in Scale and Spacecited by 61
  25. 2023FunnyBirds: A Synthetic Vision Dataset for a Part-Based Analysis of Explainable AI Methodscited by 49
  26. 2023Don't be fooled: label leakage in explanation methods and the importance of their quantitative evaluationcited by 11
  27. 2024Benchmarking the Attribution Quality of Vision Modelscited by 7
  28. 2024Distributional Counterfactual Explanations With Optimal Transportcited by 6
  29. 2024Joint Distribution-Informed Shapley Values for Sparse Counterfactual Explanationscited by 4
  30. 2026DISCOVER: A Solver for Distributional Counterfactual Explanationscited by 1

Built on by

Not cited yet.