Cited by 1,386Explainable Artificial Intelligence (XAI)Software Testing and Debugging TechniquesAdversarial Robustness in Machine Learning

The DOI matches its Crossref record; 46 of the 53 references it cites were found in a registry or an index; none of the 49 sources its claims cite is checked for support yet.

Explainable AI (XAI): Core Ideas, Techniques, and Solutions

Open access

Abstract

As our dependence on intelligent machines continues to grow, so does the demand for more transparent and interpretable models. In addition, the ability to explain the model generally is now the gold standard for building trust and deployment of artificial intelligence systems in critical domains. Explainable artificial intelligence (XAI) aims to provide a suite of machine learning techniques that enable human users to understand, appropriately trust, and produce more explainable models. Selecting an appropriate approach for building an XAI-enabled application requires a clear understanding of the core ideas within XAI and the associated programming frameworks. We survey state-of-the-art programming techniques for XAI and present the different phases of XAI in a typical machine learning development process. We classify the various XAI approaches and, using this taxonomy, discuss the key differences among the existing XAI techniques. Furthermore, concrete examples are used to describe these techniques that are mapped to programming frameworks and software toolkits. It is the intention that this survey will help stakeholders in selecting the appropriate approaches, programming frameworks, and software toolkits by comparing them through the lens of the presented taxonomy.

Overview

AI snapshot

Written from the paper’s full text.

TL;DR

This survey reviews explainable AI concepts, techniques, and software frameworks, organizing them by model transparency, explanation scope, and model specificity. It maps data, model, feature-based, and example-based explanation methods to practical libraries and toolkits, using illustrative examples.

Key findings

  • The paper proposes a taxonomy of XAI techniques along white-box vs. black-box, model-specific vs. model-agnostic, and global vs. local dimensions, covering data explainability, model explainability, feature-based methods, example-based methods, toolkits, and distributed learning.
  • It reports an illustrative bias example: a 2015 Google Images search for “CEO” returned women 11% of the time, compared with a real-world representation of 27%.
  • Neural-symbolic systems are presented as combining neural learning with symbolic reasoning; the paper cites a Neuro-Symbolic Concept Learner trained on 10% of the original dataset while remaining explainable.
  • It maps techniques such as LIME, SHAP, PDP, ICE, ALE, anchors, counterfactuals, and integrated gradients to frameworks including ELI5, SHAP, PDPbox, Skater, tf-explain, DiCE, Alibi, InterpretML, What-If Tool, and TensorBoard, while noting a trade-off between interpretability and model performance.

Methods

  • Design: a comparative survey of state-of-the-art XAI programming techniques, not a primary empirical study; it classifies approaches and compares them through a proposed taxonomy.
  • Data or sample: illustrative datasets and examples include Breast Cancer Wisconsin, Heart Disease, Iris (4 features and 3 target classes), Fashion MNIST (70,000 grayscale 28×28 images across 10 classes), and an animal price prediction example.
  • Main analysis: qualitative comparison tables mapping XAI techniques to software libraries and toolkits, plus discussion of ML development phases (understanding and explaining) and implementation design considerations.

Limitations

  • The paper does not state limitations of the survey itself. It does enumerate limitations of reviewed techniques: PDP assumes feature independence and is realistically limited to about two features; ICE can overcrowd plots and shares correlation concerns; LIME’s local linear approximation may fail with nonlinearity; SHAP can be computationally expensive; global surrogates explain the model rather than the data and may not explain individual predictions; counterfactuals perform worse for multiclass than binary classification.
  • Evident from the text: no benchmark, user study, or empirical validation of the taxonomy or toolkit comparisons is reported; the examples are illustrative rather than systematic evaluations.
  • Also evident: some tables and sections in the provided text are incomplete or formatting-corrupted, which limits reproducibility of the comparative claims.

Model-written summary. Check it against the paper before relying on it.

Integrity signals

Registry

Crossref · 10.1145/3561048

Cites

46 of 46 references verified0 citation errors · 0 not checkable

Statistics

Nothing to recompute.

Verification

Claims the paper makes

0 of 49 cited sources checked · 0 supported · 0 flagged

Show all 48 claims

  • Probably not a substantial claim. 118
  • It may state two separate claims as one. 54
135 of 135

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

Each contradiction between two passages listed here was confirmed by an independent check.

  • Outline assigns software toolkits to the wrong section

    Minor

    The outline says the toolkits are covered in Section 9, whereas Section 9 is about design considerations; software toolkits are in Section 8.

  • Tree ensembles are classified as both white-box and black-box

    Minor

    Table 3 lists tree ensembles among white-box models, but Section 5.2 explicitly includes them among black-box models.

  • Table 5 is described as covering the wrong type of explainability

    Minor

    Section 5.5 says Table 5 concerns data explainability, but the table caption says it concerns model explainability.

  • Outline misnumbers the data and model explainability sections

    Minor

    The outline places data explainability in Section 5 and model explainability in Section 6, but their headings are Sections 4 and 5, respectively.

  • Intrinsic and post-hoc labels are reversed

    Minor

    Section 3.1 calls black-box models intrinsic and white-box models post-hoc. The conclusion instead describes white-box models as intrinsically explainable relative to black-box models.

  • Table 8 conflicts with the stated Skater capabilities

    Minor

    Table 8 marks Skater as unable to perform feature importance and partial dependence plots, but the Skater description expressly says it can perform both.

  • Low concave-point values receive opposite interpretations

    Minor

    The PDP discussion associates lower values of the same feature with a lower chance of malignancy, while the ICE discussion associates them with a higher malignant target value.

  • Outline gives the wrong conclusion section

    Minor

    The outline places the conclusion in Section 11, but the conclusion is headed Section 10.

  • Table 6 is assigned two different subjects

    Minor

    The text identifies Table 6 as a feature-importance example, while its caption identifies it as a table of distributed-learning frameworks.

9 of 9

Citations

Cites

Flagged first, then by citations

Show all 53 references

7 of the 53 references couldn’t be matched to a known paper.

Research works printed but not linked: 13

  1. David Beckett, Tim Berners-Lee, Eric Prud’hommeaux, and Gavin Carothers. 2014. RDF 1.1 Turtle. World Wide Web Consortium 2014 (2014), 18–31.
  2. Jeffrey Dean Greg S. Corrado Rajat Monga Kai Chen Matthieu Devin Quoc V. Le Mark Z. Mao et al. 2012. Large scale distributed deep networks. In Proceedings of the 25th International Conference on Neural Information Processing Systems (NIPS’12) . 1223–1231.
  3. CEUR Workshop Proceedings Proceedings of the First International Workshop on Comprehensibility and Explanation in AI and ML 2017 co-located with 16th International Conference of the Italian Association for Artificial Intelligence (AI*IA 2017) Bari Italy November 16th and 17th 2017 2071 Derek Doran Sarah Schulz Tarek R. Besold Tarek R. Besold Oliver Kutz What does explainable AI really mean? A new conceptualization of perspectives 2017
  4. Xin He Kaiyong Zhao and Xiaowen Chu. 2019. AutoML: A survey of the state-of-the-art. arxiv:1908.00709 [cs.LG]. · arXiv
  5. Pascal Hitzler, Markus Krötzsch, Bijan Parsia, Peter F. Patel-Schneider, and Sebastian Rudolph. 2009. OWL 2 web ontology language primer. W3C Recommendation 27, 1 (2009), 123.
  6. SNOMED International. 2022. Data Analytics with SNOMED CT. Retrieved June 29, 2022 from https://confluence.ihtsdotools.org/display/DOCANLYT/Data+Analytics+with+SNOMED+CT.
  7. Accenture Labs. 2020. Understanding Machines: Explainable AI. Technical Report. Retrieved September 9, 2022 from https://www.accenture.com/_acnmedia/pdf-85/accenture-understanding-machines-explainable-ai.pdf.
  8. Mu Li David G. Andersen Jun Woo Park Alexander J. Smola Amr Ahmed Vanja Josifovski James Long Eugene J. Shekita and Bor-Yiing Su. 2014. Scaling distributed machine learning with the parameter server. In Proceedings of the 11th USENIX Symposium on Operating Systems Design and Implementation (OSDI’14) . 583–598.
  9. Joanne S. Luciano, Bosse Andersson, Colin Batchelor, Olivier Bodenreider, Tim Clark, Christine K. Denney, Christopher Domarew, et al. 2011. The Translational Medicine Ontology and Knowledge Base: Driving personalized medicine by bridging the gap between bench and bedside. Journal of Biomedical Semantics 2 (2011), 1–21.
  10. Azalia Mirhoseini, Anna Goldie, Hieu Pham, Benoit Steiner, Quoc V. Le, and Jeff Dean. 2018. A hierarchical model for device placement. In Proceedings of the International Conference on Learning Representations.
  11. Azalia Mirhoseini, Hieu Pham, Quoc V. Le, Benoit Steiner, Rasmus Larsen, Yuefeng Zhou, Naveen Kumar, Mohammad Norouzi, Samy Bengio, and Jeff Dean. 2017. Device placement optimization with reinforcement learning. In Proceedings of the International Conference on Machine Learning. 2430–2439.
  12. CEUR Workshop Proceedings Proceedings of the Twelfth International Workshop on Neural-Symbolic Learning and Reasoning NeSy 2017 London UK July 17-18 2017 2003 Kamruzzaman Sarker Ning Xie Derek Doran Michael L. Raymer Pascal Hitzler Tarek R. Besold Artur S. d’Avila Garcez Isaac Noble Explaining trained neural networks with semantic web technologies: First steps 2017
  13. Ajay Thampi. 2020. Interpretable AI, Building Explainable Machine Learning Systems. Manning Publications.

Cited by

Sorted by citations

See all 1,386

Metadata

Authors
Dwivedi, R., Dave, D., Naik, H., Singhal, S., Omer, R., Patel, P., Qian, B., Wen, Z., Shah, T., Morgan, G., & Ranjan, R.
Affiliations
  • Netaji Subhas University of Technology (IN)
  • Pandit Deendayal Energy University (IN)
  • Cardiff University, Cardiff, UK
  • University of South Carolina (US)
  • Newcastle University (GB)
Venue
ACM Computing Surveys
Published
2023-01-16
Volume
55
Issue
9
Pages
1-33
ISSN
  • 0360-0300 (ISSN-L)
  • 1557-7341
OpenAlex
W4294559022
Cited by
1,386
References
53
Citations by year
2026: 479 · 2025: 554 · 2024: 284 · 2023: 68
FWCI
74.65
Type
journal article
Language
en
Open access
Locations
  • ACM Computing Surveys (publishedVersion)
  • ORCA Online Research @Cardiff (Cardiff University) (submittedVersion)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Explainable Artificial Intelligence (XAI)
  • Physical Sciences › Computer Science › Software › Software Testing and Debugging Techniques
  • Physical Sciences › Computer Science › Artificial Intelligence › Adversarial Robustness in Machine Learning
Keywords
explainable AI, model interpretability, trust in AI

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

A language model drew the claims from the paper on 2026-10-06, under version 3 of the claim definition (model deepseek-v4.1-flash, prompt extract-v3).

A second model labelled each claim on 2026-10-06 (model jev-1.13-20260917, definition revision gold-guideline-v0.2).

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review