Cardinality-Minimal Explanations for Monotonic Neural Networks
Not on the map. Why?
Abstract (arXiv)
In recent years, there has been increasing interest in explanation methods for neural model predictions that offer precise formal guarantees. These include abductive (respectively, contrastive) methods, which aim to compute minimal subsets of input features that are sufficient for a given prediction to hold (respectively, to change a given prediction). The corresponding decision problems are, however, known to be intractable. In this paper, we investigate whether tractability can be regained by focusing on neural models implementing a monotonic function. Although the relevant decision problems remain intractable, we can show that they become solvable in polynomial time by means of greedy algorithms if we additionally assume that the activation functions are continuous everywhere and differentiable almost everywhere. Our experiments suggest favourable performance of our algorithms.
Key facts. Cited by 8 papers in the map (data through 14 Oct 2026). Builds on 30 of its 57 references that are in the map. First posted on arXiv 19 May 2022.
Builds on
30 of 57 references.
References · 30
- 2014Adam: A Method for Stochastic Optimizationcited by 37,240
- 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,305
- 2017Axiomatic Attribution for Deep Networkscited by 3,384
- 2013Deep Inside Convolutional Networks: Visualising Image Classification Models and Saliency Mapscited by 2,371
- 2017Understanding Black-box Predictions via Influence Functionscited by 1,741
- 2017Learning Important Features Through Propagating Activation Differencescited by 1,458
- 2018Sanity Checks for Saliency Mapscited by 1,156
- 2014Deep Learning in Neural Networks: An Overviewcited by 770
- 2014Deep Speech: Scaling up end-to-end speech recognitioncited by 354
- 2019The many Shapley values for model explanationcited by 344
- 2019Counterfactual Visual Explanationscited by 313
- 2018Explanations based on the Missing: Towards Contrastive Explanations with Pertinent Negativescited by 262
18 more
- 2015Explaining NonLinear Classification Decisions with Deep Taylor Decompositioncited by 250
- 2017Real Time Image Saliency for Black Box Classifierscited by 246
- 2017Deep Learning for Case-Based Reasoning through Prototypes: A Neural Network that Explains Its Predictionscited by 234
- 2018Abduction-Based Explanations for Machine Learning Modelscited by 160
- 2018A Symbolic Approach to Explaining Bayesian Network Classifierscited by 131
- 2021CF-GNNExplainer: Counterfactual Explanations for Graph Neural Networkscited by 119
- 2019Explaining Deep Neural Networks with a Polynomial Time Algorithm for Shapley Values Approximationcited by 115
- 2020Model Interpretability through the Lens of Computational Complexitycited by 75
- 2021Robust Counterfactual Explanations on Graph Neural Networkscited by 72
- 2021On Explaining Random Forests with SATcited by 57
- 2020Certified Monotonic Neural Networkscited by 51
- 2021Explanations for Monotonic Classifierscited by 39
- 2020On Tractable Representations of Binary Neural Networkscited by 34
- 2021Provably efficient, succinct, and precise explanationscited by 32
- 2018Interpreting Neural Network Judgments via Minimal, Stable, and Symbolic Correctionscited by 19
- 2018Monotonic classification: an overview on algorithms, performance measures and data setscited by 18
- 2020Three Modern Roles for Logic in AIcited by 15
- 2019Equivalent and Approximate Transformations of Deep Neural Networkscited by 11
Built on by
Citing papers per year: 2023: 2; 2024: 1; 2025: 2; 2026: 3.
8 papers.
- 2025Explaining, Fast and Slow: Abstraction and Refinement of Provable Explanationscited by 13
- 2025Explain Yourself, Briefly! Self-Explaining Neural Networks with Concise Sufficient Reasonscited by 12
- 2026Formal Mechanistic Interpretability: Automated Circuit Discovery with Provable Guaranteescited by 11
- 2024Even-if Explanations: Formal Foundations, Priorities and Complexitycited by 4
- 2026Unifying Formal Explanations: A Complexity-Theoretic Perspectivecited by 2
- 2023Understanding User Preferences in Explainable Artificial Intelligence: A Survey and a Mapping Function Proposalcited by 1
- 2026Provably Explaining Neural Additive Modelscited by 1
- 2023CIDR: A Cooperative Integrated Dynamic Refining Method for Minimal Feature Removal Problemcited by 0
- 2026Unifying Formal Explanations: A Complexity-Theoretic Perspective20 Feb 2026
- 2026Provably Explaining Neural Additive Models19 Feb 2026
- 2026Formal Mechanistic Interpretability: Automated Circuit Discovery with Provable Guarantees18 Feb 2026
- 2025Explaining, Fast and Slow: Abstraction and Refinement of Provable Explanations10 Jun 2025
- 2025Explain Yourself, Briefly! Self-Explaining Neural Networks with Concise Sufficient Reasons5 Feb 2025
- 2024Even-if Explanations: Formal Foundations, Priorities and Complexity17 Jan 2024
- 2023CIDR: A Cooperative Integrated Dynamic Refining Method for Minimal Feature Removal Problem13 Dec 2023
- 2023Understanding User Preferences in Explainable Artificial Intelligence: A Survey and a Mapping Function Proposal7 Feb 2023