Scaling the Explanation of Multi-Class Bayesian Network Classifiers

• URL: http://arxiv.org/abs/2603.14594v1
• Date: Sun, 15 Mar 2026 20:38:06 GMT
• Title: Scaling the Explanation of Multi-Class Bayesian Network Classifiers
• Abstract summary: We propose a new algorithm for compiling Bayesian network classifier (BNC) into class formulas.<n>Compared to prior work on compiling class formulas of BNCs, our proposed algorithm shows significant improvement in compilation time.
• Score: 7.928094304325115
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We propose a new algorithm for compiling Bayesian network classifier (BNC) into class formulas. Class formulas are logical formulas that represent a classifier's input-output behavior, and are crucial in the recent line of work that uses logical reasoning to explain the decisions made by classifiers. Compared to prior work on compiling class formulas of BNCs, our proposed algorithm is not restricted to binary classifiers, shows significant improvement in compilation time, and outputs class formulas as negation normal form (NNF) circuits that are OR-decomposable, which is an important property when computing explanations of classifiers.

Related papers

• Solving Hard XAI Queries Based on a Compiled Dual-Rail Encoding [7.088503833248158]
  The adoption of artificial intelligence (AI) within real-world applications has raised a lot of concerns regarding their trustworthiness.<n>The field of eXplainable AI (XAI) has emerged with the objective of providing explanations to the users about the decisions made by AI systems.
  arXiv  Detail & Related papers  (2026-09-04T09:33:00Z)
• Fundamental limits of distributed multiclass classification from simple binary decisions [5.668668551176212]
  We study the fundamental performance limits of such a classifier when the corresponding binary classifiers are hyperplanes.<n>For a stylized Gaussian setting where the $K$ class centers are independent Gaussian points in $mathbb Rd$ and the observations are corrupted by Gaussian noise, we derive explicit performance bounds across several decoding and dimensional regimes.
  arXiv  Detail & Related papers  (2026-07-21T17:53:44Z)
• A Hard-to-Beat Baseline for Training-free CLIP-based Adaptation [121.0693322732454]
  Contrastive Language-Image Pretraining (CLIP) has gained popularity for its remarkable zero-shot capacity. Recent research has focused on developing efficient fine-tuning methods to enhance CLIP's performance in downstream tasks. We revisit a classical algorithm, Gaussian Discriminant Analysis (GDA), and apply it to the downstream classification of CLIP.
  arXiv  Detail & Related papers  (2024-02-06T15:45:27Z)
• Mitigating Word Bias in Zero-shot Prompt-based Classifiers [55.60306377044225]
  We show that matching class priors correlates strongly with the oracle upper bound performance. We also demonstrate large consistent performance gains for prompt settings over a range of NLP tasks.
  arXiv  Detail & Related papers  (2023-09-10T10:57:41Z)
• Explainable AI using expressive Boolean formulas [0.6323908398583082]
  We implement an interpretable machine classification model for Explainable AI (XAI) based on expressive Boolean formulas. Potential applications include credit scoring and diagnosis of medical conditions.
  arXiv  Detail & Related papers  (2023-06-06T19:18:46Z)
• Compacting Binary Neural Networks by Sparse Kernel Selection [58.84313343190488]
  This paper is motivated by a previously revealed phenomenon that the binary kernels in successful BNNs are nearly power-law distributed. We develop the Permutation Straight-Through Estimator (PSTE) that is able to not only optimize the selection process end-to-end but also maintain the non-repetitive occupancy of selected codewords. Experiments verify that our method reduces both the model size and bit-wise computational costs, and achieves accuracy improvements compared with state-of-the-art BNNs under comparable budgets.
  arXiv  Detail & Related papers  (2023-03-25T13:53:02Z)
• Factorizers for Distributed Sparse Block Codes [45.29870215671697]
  We propose a fast and highly accurate method for factorizing distributed block codes (SBCs) Our iterative factorizer introduces a threshold-based nonlinear activation, conditional random sampling, and an $ell_infty$-based similarity metric. We demonstrate the feasibility of our method on four deep CNN architectures over CIFAR-100, ImageNet-1K, and RAVEN datasets.
  arXiv  Detail & Related papers  (2023-03-24T12:31:48Z)
• Efficient Computation of Shap Explanation Scores for Neural Network Classifiers via Knowledge Compilation [0.0]
  We show how to transform binary neural networks into those circuits for efficient Shap computation. The performance gain is huge, as we show in the light of our experiments.
  arXiv  Detail & Related papers  (2023-03-11T23:33:43Z)
• On Deciding Feature Membership in Explanations of SDD & Related Classifiers [0.685316573653194]
  The paper shows that the feature membership problem (FMP) is hard for $SigmaP$ for a broad class of classifiers. The paper proposes propositional encodings for classifiers represented with Sentential Decision Diagrams (SDDs) and for other propositional languages.
  arXiv  Detail & Related papers  (2022-02-15T16:38:53Z)
• On the rate of convergence of a classifier based on a Transformer encoder [55.41148606254641]
  The rate of convergence of the misclassification probability of the classifier towards the optimal misclassification probability is analyzed. It is shown that this classifier is able to circumvent the curse of dimensionality provided the aposteriori probability satisfies a suitable hierarchical composition model.
  arXiv  Detail & Related papers  (2021-11-29T14:58:29Z)
• Convolutional Dynamic Alignment Networks for Interpretable Classifications [108.83345790813445]
  We introduce a new family of neural network models called Convolutional Dynamic Alignment Networks (CoDA-Nets) Their core building blocks are Dynamic Alignment Units (DAUs), which linearly transform their input with weight vectors that dynamically align with task-relevant patterns. CoDA-Nets model the classification prediction through a series of input-dependent linear transformations, allowing for linear decomposition of the output into individual input contributions.
  arXiv  Detail & Related papers  (2021-03-31T18:03:53Z)
• A Multiple Classifier Approach for Concatenate-Designed Neural Networks [13.017053017670467]
  We give the design of the classifiers, which collects the features produced between the network sets. We use the L2 normalization method to obtain the classification score instead of the Softmax Dense. As a result, the proposed classifiers are able to improve the accuracy in the experimental cases.
  arXiv  Detail & Related papers  (2021-01-14T04:32:40Z)
• Generalized Zero-Shot Learning Via Over-Complete Distribution [79.5140590952889]
  We propose to generate an Over-Complete Distribution (OCD) using Conditional Variational Autoencoder (CVAE) of both seen and unseen classes. The effectiveness of the framework is evaluated using both Zero-Shot Learning and Generalized Zero-Shot Learning protocols.
  arXiv  Detail & Related papers  (2020-04-01T19:05:28Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.