FAME: Formal Abstract Minimal Explanation for Neural Networks

Ryma Boumazouza, Raya Elsaleh, Melanie Ducoffe, Shahaf Bassan, Guy Katz
3/11/2026
cs.AIcs.LG

No confident code implementation found for this paper.

Abstract

We propose FAME (Formal Abstract Minimal Explanations), a new class of abductive explanations grounded in abstract interpretation. FAME is the first method to scale to large neural networks while reducing explanation size. Our main contribution is the design of dedicated perturbation domains that eliminate the need for traversal order. FAME progressively shrinks these domains and leverages LiRPA-based bounds to discard irrelevant features, ultimately converging to a formal abstract minimal explanation. To assess explanation quality, we introduce a procedure that measures the worst-case distance between an abstract minimal explanation and a true minimal explanation. This procedure combines adversarial attacks with an optional VERIX+ refinement step. We benchmark FAME against VERIX+ and demonstrate consistent gains in both explanation size and runtime on medium- to large-scale neural networks.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Cite this paper

@article{boumazouza2026fame,
  title  = {FAME: Formal Abstract Minimal Explanation for Neural Networks},
  author = {Ryma Boumazouza and Raya Elsaleh and Melanie Ducoffe and Shahaf Bassan and Guy Katz},
  year   = {2026},
  eprint = {2603.10661},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2603.10661v1}
}

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/2603.10661.svg)](https://codeofpaper.com/paper/2603.10661)

Discussion