





















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.
| Comments: | 21 pages with a 36 page appendix, 8 + 39 figures, 1+1 tables. The datasets and source code used in the paper are available at this https URL. Accepted for publication in the 4th World Conference on eXplainable Artificial Intelligence (2026) |
| Subjects: | Machine Learning (cs.LG); Artificial Intelligence (cs.AI); Human-Computer Interaction (cs.HC) |
| ACM classes: | I.2.4 |
| Cite as: | arXiv:2502.10311 [cs.LG] |
| (or arXiv:2502.10311v3 [cs.LG] for this version) | |
| https://doi.org/10.48550/arXiv.2502.10311 arXiv-issued DOI via DataCite |
From: Lauri Seppäläinen [view email]
[v1]
Fri, 14 Feb 2025 17:14:02 UTC (732 KB)
[v2]
Thu, 5 Feb 2026 11:52:54 UTC (1,295 KB)
[v3]
Mon, 25 May 2026 11:26:15 UTC (1,295 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。