Skip to content
Preprint

Evidential Rule Learning for Interpretable Classification with Abstention

Aug 2026 · 0 citations · 63 references
Computer Science

TL;DR

Fast Evidential Rule Learning (FERL) is introduced, a method that learns interpretable, accurate fuzzy rule models whose outputs are evidential, and is Lipschitz stable, which means that its evidential outputs vary smoothly with the input.

Abstract

Interpretable classification often requires more than accurate predictions for real-life deployment: models should be transparent about the evidence behind their decisions and abstain when they cannot decide reliably. We introduce Fast Evidential Rule Learning (FERL), a method that learns interpretable, accurate fuzzy rule models whose outputs are evidential. Unlike post-hoc calibration, FERL's belief, plausibility, and abstention capabilities arise directly from the fuzzy memberships in a single deterministic pass, with no auxiliary head, held-out set, or repeated inference. Our theoretical analysis further shows that FERL is Lipschitz stable, which means that its evidential outputs vary smoothly with the input. Against state-of-the-art rule learners, FERL is statistically significantly more accurate across a 30 tabular-dataset benchmark ($+2.6\%$ average accuracy over the second best). Its native set predictions attain the best utility-discounted accuracy among credal classifiers ($u_{65}/u_{80}=0.80/0.83$ vs.\ $0.79/0.80$ for the naive credal classifier), at higher set coverage ($0.92$ vs.\ $\le0.82$). FERL also matches dedicated out-of-distribution detectors on tabular near-OOD detection ($77.7$ vs.\ $77.4$ AUROC for the strongest baseline). Under detector-class-disjoint concept-bottleneck evaluation, its it is within $2.3$ AUROC points of the strongest dedicated detector on both CUB and AwA2, while attaining the best AwA2 AUPR-Out ($68.3$) and novel-class rejection ($57.2$), while being able to name which attributes are anomalous.

View source

Similar papers

Open access Aug 2026

Set-valued classification via evidential deep learning with maximum expected utility

Conventional evidential deep learning (EDL) represents evidence strength and vacuity but typically converts the learned evidence into a single-label prediction. This may conceal class ambiguity when multiple classes remain plausible and lead to unreliable precise decisions. To address this problem, this paper proposes...

M. Mei, Jia-Hui Luo, Shi-Qi Yang et al. · 0 citations
#artificial intelligence Review Sep 2026

SR4-Fit: A Unified Interpretable Rule-Based Machine Learning Framework for Informative and Trustworthy Decision-Making

Sarse Relaxed Regularized Regression Rule-Fit is proposed, an intrinsically interpretable algorithm for both classification and regression that produces compact and stable rule sets without sacrificing performance, demonstrating that interpretability and predictive reliability need not be mutually exclusive.

S. Krishnan, Dean F. Hougen · 0 citations
#machine learning Preprint Oct 2026

Credal Machine Learning for Risk-Averse Decision Making

In many machine learning applications, it is necessary to guard against worst-case scenarios and predictions that could result in substantial losses. In principle, this can be achieved by training risk-averse predictive models that minimize loss functions such as conditional value-at-risk (CVaR), rather than relying on...

Tim Löhr, Paul Hofman, Maximilian Muschalik et al. · 0 citations
#artificial intelligence Open access Oct 2026

Interpreting Machine Learning Predictions with SHAP and LIME for Transparent Decision Making

Machine learning models increasingly influence critical decisions across diverse domains, yet their complex architectures often operate as black boxes, obscuring the rationale behind predictions and limiting stakeholder trust. This research demonstrates a comprehensive, reproducible workflow for applying explainable ar...

M. Stow · 1 citation
#machine learning Preprint Oct 2026

Robust Evidential Learning Through Latent Consistency

Reliable uncertainty quantification is essential for deploying deep learning models in high-stakes settings, where out-of-distribution and adversarial inputs can induce confident but unreliable predictions. Evidential Deep Learning provides efficient uncertainty estimates in a single forward pass, but can still assign...

Charmaine Barker, Daniel Bethell, Simos Gerasimou · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.