Search

In recent years, considerable attention has been directed toward clarifying complex, opaque systems, commonly referred to as black-box models, including deep neural networks and random forests. So-called model-agnostic techniques generally approximate the outputs of these non-transparent systems using an interpretable architecture, ignoring the internal mechanisms of the primary black-box system itself. Consequently, it remains an important inquiry whether the straightforward training of transparent, white-box architectures ought to be favored over the post-hoc approximation of these opaque models. This study presents the findings of an empirical investigation comparing post-hoc explanatory methods against inherently interpretable architectures across multiple datasets, focusing on both rule-based and feature-based frameworks. The empirical outcomes indicate that directly trained transparent models frequently approximate black-box models with an accuracy that matches or exceeds that of post-hoc surrogate models, despite lacking direct access to the underlying black-box structure.

We introduce and execute a transparent machine learning classification model designed for Explainable AI (XAI) that leverages expressive Boolean formulas. Potential domains of use include credit risk evaluation and medical diagnostics. The system utilizes a Boolean formula to establish a rule with adjustable complexity (or interpretability) for categorizing input data. This formula accommodates any operator applicable to single or multiple Boolean variables, offering superior expressivity relative to more rigid rule- and tree-based methodologies. Native local optimization methods are used to train the classifier, allowing for an efficient search of the feasible formula space. Fast Integer Linear Programming (ILP) or Quadratic Unconstrained Binary Optimization (QUBO) solvers—potentially enhanced by custom hardware or quantum systems—can identify shallow rules. By executing non-local moves that optimize across subtrees of the complete Boolean formula, we merge the expressivity and efficiency of the native local optimizer with the rapid processing capabilities of these devices. We present comprehensive numerical benchmarking data against multiple baseline models using recognized public datasets. The findings indicate that the native local rule classifier performs competitively with alternative models. Incorporating non-local moves yields comparable outcomes with a reduced number of iterations. Consequently, deploying specialized or quantum hardware could provide substantial acceleration by rapidly generating non-local moves.

Explainable artificial intelligence increasingly offers diverse ways to communicate how intelligent systems operate, yet explanation selection is still frequently driven by method availability or model compatibility rather than stakeholder need. This article develops a stakeholder-oriented taxonomy for determining which explanation type may be appropriate for whom, at which decision moment, and for what purpose. Explanation is treated as a multiform system capability encompassing different scopes, reasoning functions, presentation modes, interaction patterns, and quality requirements. The taxonomy distinguishes global explanations concerned with model-level behaviour from local explanations directed at individual predictions, while clarifying the roles and limitations of feature attribution, saliency, surrogate models, rule extraction, transparency, fidelity, stability, and completeness. It further differentiates counterfactual, contrastive, and causal explanations according to their contributions to alternative reasoning, actionability, contestability, recourse, and accountability. Example-based, case-based, prototype, rule-based, natural-language, interactive, dialogue-based, adaptive, and personalized explanations are positioned according to user expertise, cognitive accessibility, task demands, and interaction context. The proposed taxonomy connects explanation families with stakeholder roles, pre-decision, during-decision, and post-decision timing, explanation purpose, decision consequence, uncertainty, trust calibration, human oversight, and accountability requirements. Its central contribution is a structured selection logic that moves beyond technical method categories toward stakeholder–purpose–timing–risk alignment. The taxonomy can guide explanation design and evaluation but does not independently establish understanding, fairness, recourse, accountability, legal sufficiency, trustworthiness, or deployment readiness. Stakeholder-specific and decision-context-specific validation therefore remains necessary.