Metraipolis › archive › dc_90aa990cdcc0
Probabilistic Linear Explanations — arXiv:2609.19077
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.19077
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-15T15:05:01.477Z
- SHA-256 of the archived text
1c02f29be816b9a06460aeb3b9cc3e73b4bf63f8a675fe69b13f7c69b23f10e6- Stable URL of this page
https://metraipolis.com/documento/dc_90aa990cdcc0
How to cite
Probabilistic Linear Explanations — arXiv:2609.19077 — arXiv (en), https://arxiv.org/abs/2609.19077 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_90aa990cdcc0 (Metraipolis archive dc_90aa990cdcc0, sha256 1c02f29be816b9a06460aeb3b9cc3e73b4bf63f8a675fe69b13f7c69b23f10e6)
BibTeX
@misc{dc90aa990cdcc0,
title = {Probabilistic Linear Explanations — arXiv:2609.19077},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.19077},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_90aa990cdcc0; sha256 1c02f29be816b9a06460aeb3b9cc3e73b4bf63f8a675fe69b13f7c69b23f10e6},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.19077. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Formal explainability provides mathematically grounded justifications for individual predictions. However, abductive explanations often exceed human cognitive limits by involving too many features, while probabilistic relaxations have remained largely limited to categorical classification. We present a unified framework for probabilistic explainability based on sparse, anchored linear models, applicable to both binary classification and continuous regression. By mapping instances to the Boolean hypercube, our linear explanations strictly generalize subset-based approaches: they capture both the magnitude and direction of feature contributions while enforcing a prescribed sparsity budget $k$. We show that minimizing the relevance error for such explanations is \ClassNPPP-hard when the underlying model is a neural network, and we relate this intractable objective to a tractable surrogate---the fidelity error. For a parameterized family of local distributions, the relevance error of any $k$-sparse explanation is bounded by its fidelity error up to a multiplicative factor that remains small locally. We address the resulting empirical problem using two complementary approaches: a Mixed Integer Programming (MIP) formulation that yields provably optimal empirical solutions while maintaining polynomial sample complexity, and a polynomial-time Iterative Hard Thresholding (IHT) algorithm with provable approximation guarantees. Empirical evaluations show that, unlike state-of-the-art baselines such as LIME and MAPLE, our explanations satisfy both the anchoring and sparsity constraints by construction, while consistently achieving lower relevance error. Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-09-17 in cs.LG). Categorie arXiv: Machine Learning (cs.LG) ; Artificial Intelligence (cs.AI). Pagina del lavoro: https://arxiv.org/abs/2609.19077 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-15T14:08:19.177Z dalla pagina https://arxiv.org/catchup/cs.LG/2026-09-17?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).