mlsanityData to 7 Oct 2026

Efficient XAI Techniques: A Taxonomic Survey

arXiv 2302.03225 ↗First posted 7 Feb 2023cs.LG cs.AI cs.CYcited by 14

Not on the map. Why?

Abstract (arXiv)

Recently, there has been a growing demand for the deployment of Explainable Artificial Intelligence (XAI) algorithms in real-world applications. However, traditional XAI methods typically suffer from a high computational complexity problem, which discourages the deployment of real-time systems to meet the time-demanding requirements of real-world scenarios. Although many approaches have been proposed to improve the efficiency of XAI methods, a comprehensive understanding of the achievements and challenges is still needed. To this end, in this paper we provide a review of efficient XAI. Specifically, we categorize existing techniques of XAI acceleration into efficient non-amortized and efficient amortized methods. The efficient non-amortized methods focus on data-centric or model-centric acceleration upon each individual instance. In contrast, amortized methods focus on learning a unified distribution of model explanations, following the predictive, generative, or reinforcement frameworks, to rapidly derive multiple model explanations. We also analyze the limitations of an efficient XAI pipeline from the perspectives of the training phase, the deployment phase, and the use scenarios. Finally, we summarize the challenges of deploying XAI acceleration methods to real-world scenarios, overcoming the trade-off between faithfulness and efficiency, and the selection of different acceleration methods.

Key facts. Cited by 14 papers in the map (data through 7 Oct 2026). Builds on 73 of its 107 references that are in the map. First posted on arXiv 7 Feb 2023.

Builds on

73 of 107 references.

References · 73

  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. 2022Generative Adversarial Networkscited by 5,603
  4. 2017Axiomatic Attribution for Deep Networkscited by 3,350
  5. 2014Conditional Generative Adversarial Netscited by 2,152
  6. 2020LightGCN: Simplifying and Powering Graph Convolution Network for Recommendationcited by 1,134
  7. 2017SmoothGrad: removing noise by adding noisecited by 1,097
  8. 2017Counterfactual Explanations without Opening the Black Box: Automated Decisions and the GDPRcited by 1,086
  9. 2018RISE: Randomized Input Sampling for Explanation of Black-box Modelscited by 825
  10. 2017Counterfactual Fairnesscited by 802
  11. 2018Actionable Recourse in Linear Classificationcited by 327
  12. 2018Adversarial Attacks and Defences: A Surveycited by 259
38 more
  1. 2020Algorithmic Recourse: from Counterfactual Explanations to Interventionscited by 250
  2. 2018Learning to Explain: An Information-Theoretic Perspective on Model Interpretationcited by 248
  3. 2017Real Time Image Saliency for Black Box Classifierscited by 246
  4. 2018Techniques for Interpretable Machine Learningcited by 237
  5. 2019Interpretable Counterfactual Explanations Guided by Prototypescited by 223
  6. 2019Model-Agnostic Counterfactual Explanations for Consequential Decisionscited by 204
  7. 2020Evaluating and Aggregating Feature-based Model Explanationscited by 185
  8. 2018Beyond Data and Model Parallelism for Deep Neural Networkscited by 177
  9. 2020Multi-Objective Counterfactual Explanationscited by 157
  10. 2020Improving KernelSHAP: Practical Shapley Value Estimation via Linear Regressioncited by 153
  11. 2019Learning Model-Agnostic Counterfactual Explanations for Tabular Datacited by 146
  12. 2019The Shapley Taylor Interaction Indexcited by 143
  13. 2019Preserving Causal Constraints in Counterfactual Explanations for Machine Learning Classifierscited by 143
  14. 2020Algorithmic recourse under imperfect causal knowledge: a probabilistic approachcited by 139
  15. 2019Towards Realistic Individual Recourse and Actionable Explanations in Black-Box Decision Making Systemscited by 128
  16. 2020Reliable Post hoc Explanations: Modeling Uncertainty in Explainabilitycited by 125
  17. 2019Fairness in Deep Learning: A Computational Perspectivecited by 123
  18. 2021FastSHAP: Real-Time Shapley Value Estimationcited by 123
  19. 2019Explaining Deep Neural Networks with a Polynomial Time Algorithm for Shapley Values Approximationcited by 115
  20. 2019Efficient Search for Diverse Coherent Explanationscited by 111
  21. 2021Sampling Permutations for Shapley Value Estimationcited by 101
  22. 2018L-Shapley and C-Shapley: Efficient Model Interpretation for Structured Datacited by 100
  23. 2019CXPlain: Causal Explanations for Model Interpretation under Uncertaintycited by 98
  24. 2020Getting a CLUE: A Method for Explaining Uncertainty Estimatescited by 92
  25. 2017Detecting Statistical Interactions from Neural Network Weightscited by 80
  26. 2020A Distributional Framework for Data Valuationcited by 79
  27. 2019Explanation by Progressive Exaggerationcited by 76
  28. 2020How does this interaction affect me? Interpretable attribution for feature interactionscited by 73
  29. 2015Reinforcement Learning with Parameterized Actionscited by 61
  30. 2021Have We Learned to Explain?: How Interpretability Methods Can Learn to Encode Predictions in their Interpretationscited by 59
  31. 2021Beyond Trivial Counterfactual Explanations with Diverse Valuable Explanationscited by 56
  32. 2022Rethinking Stability for Attribution-based Explanationscited by 52
  33. 2022CLEAR: Generative Counterfactual Explanations on Graphscited by 48
  34. 2022Learning to Estimate Shapley Values with Vision Transformerscited by 44
  35. 2021Shapley Explanation Networkscited by 41
  36. 2021Optimal Counterfactual Explanations in Tree Ensemblescited by 36
  37. 2021Fast Axiomatic Attribution for Neural Networkscited by 35
  38. 2019CERTIFAI: Counterfactual Explanations for Robustness, Transparency, Interpretability, and Fairness of Artificial Intelligence modelscited by 34

50 most cited of 73 All 73 (JSON)

Built on by

Cited by year

Citing papers per year: 2023: 8; 2024: 4; 2025: 2.

14 papers.

Sort: