paper-with-me

Papers

Evidential Rule Learning for Interpretable Classification with Abstention

2026-08-06 · Javier Fumanal-Idocin, Javier Andreu-Perez arxiv

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.

📄 PDF Abstract BibTeX arXiv:2608.05859

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

EvidentialRAG: Quantifying and Mitigating Information Conflict in Multi-Source Retrieval-Augmented Generation via Evidential Deep Learning

2026-07-11 · S M Asif Hossain, Ruksat Khan Shayoni, M. F. Mridha arxiv

Retrieval-augmented generation grounds large language models in external evidence, but most pipelines still treat retrieved passages as deterministic and mutually consistent context. In open information environments, ret…

Question Answering

Explainable Evidential Clustering

2025-07-16 · Victor F. Lopes de Souza, Karima Bakhti, Sofiane Ramdani, Denis Mottet 외 arxiv

Unsupervised classification is a fundamental machine learning problem. Real-world data often contain imperfections, characterized by uncertainty and imprecision, which are not well handled by traditional methods. Evident…

Interpretable and Fair Mechanisms for Abstaining Classifiers

2025-03-24 · Daphne Lenders, Andrea Pugnana, Roberto Pellungrini, Toon Calders 외

Abstaining classifiers have the option to refrain from providing a prediction for instances that are difficult to classify. The abstention mechanism is designed to trade off the classifier's performance on the accepted d…

Fairness

Binary Classification with Bounded Abstention Rate

2019-05-23 · Shubhanshu Shekhar, Mohammad Ghavamzadeh, Tara Javidi

We consider the problem of binary classification with abstention in the relatively less studied \emph{bounded-rate} setting. We begin by obtaining a characterization of the Bayes optimal classifier for an arbitrary input…

Binary ClassificationClassificationGeneral Classification

Combining partially independent belief functions

2015-03-17 · Mouna Chebbah, Arnaud Martin, Boutheina Ben Yaghlane

The theory of belief functions manages uncertainty and also proposes a set of combination rules to aggregate opinions of several sources. Some combination rules mix evidential information where sources are independent; o…