ExplainReduce: Generating global explanations from many local explanations

Lauri Seppäläinen, Mudong Guo, Kai Puolamäki
2/14/2025
cs.LGcs.AIcs.HC

No official code found. Best implementation: edahelsinki/explainreduce (0 stars, MIT, last commit 2026-03-10).

Abstract

Most commonly used non-linear machine learning methods are closed-box models, uninterpretable to humans. The field of explainable artificial intelligence (XAI) aims to develop tools to examine the inner workings of these closed boxes. An often-used model-agnostic approach to XAI involves using simple models as local approximations to produce so-called local explanations; examples of this approach include LIME, SHAP, and SLISEMAP. This paper shows how a large set of local explanations can be reduced to a small "proxy set" of simple models, which can act as a generative global explanation. This reduction procedure, ExplainReduce, can be formulated as an optimisation problem and approximated efficiently using greedy heuristics. We show that, for many problems, as few as five explanations can faithfully emulate the closed-box model and that our reduction procedure is competitive with other model aggregation methods.

View on arXivView PDF

Code Implementations(1)

MIT
00TeX, ShellJan 21, 20257 months agoMIT

Similar Papers

Cite this paper

@article{sepplinen2025explainreduce,
  title  = {ExplainReduce: Generating global explanations from many local explanations},
  author = {Lauri Seppäläinen and Mudong Guo and Kai Puolamäki},
  year   = {2025},
  eprint = {2502.10311},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2502.10311v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2502.10311.svg)](https://codeofpaper.com/paper/2502.10311)

Discussion