mlsanityData to 14 Oct 2026

Explaining black boxes with a SMILE: Statistical Model-agnostic Interpretability with Local Explanations

arXiv 2311.07286 ↗First posted 13 Nov 2023cs.LG cs.AI math.STcited by 8

Not on the map. Why?

Abstract (arXiv)

Machine learning is currently undergoing an explosion in capability, popularity, and sophistication. However, one of the major barriers to widespread acceptance of machine learning (ML) is trustworthiness: most ML models operate as black boxes, their inner workings opaque and mysterious, and it can be difficult to trust their conclusions without understanding how those conclusions are reached. Explainability is therefore a key aspect of improving trustworthiness: the ability to better understand, interpret, and anticipate the behaviour of ML models. To this end, we propose SMILE, a new method that builds on previous approaches by making use of statistical distance measures to improve explainability while remaining applicable to a wide range of input data domains.

Key facts. Cited by 8 papers in the map (data through 14 Oct 2026). Builds on 8 of its 16 references that are in the map. First posted on arXiv 13 Nov 2023.

Builds on

8 of 16 references.

References · 8

  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. 2017Axiomatic Attribution for Deep Networkscited by 3,384
  4. 2019Explainable Artificial Intelligence (XAI): Concepts, Taxonomies, Opportunities and Challenges toward Responsible AIcited by 1,552
  5. 2019Fooling LIME and SHAP: Adversarial Attacks on Post hoc Explanation Methodscited by 443
  6. 2019Interpretations are useful: penalizing explanations to align neural networks with prior knowledgecited by 145
  7. 2021S-LIME: Stabilized-LIME for Model Explanationcited by 52
  8. 2020BayLIME: Bayesian Local Interpretable Model-Agnostic Explanationscited by 51

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2024: 2; 2025: 5; 2026: 1.

8 papers.