Concisely Explaining the Doubt: Minimum-Size Abductive Explanations for Linear Models with a Reject Option

TL;DR

This paper develops methods to efficiently compute minimal abductive explanations for linear models with a reject option, ensuring interpretability and fidelity in critical AI applications like healthcare and finance.

Contribution

It introduces algorithms for minimum-size abductive explanations in linear models with rejection, combining efficient adaptation for accepted cases and integer programming for rejected cases.

Findings

Efficient algorithm for explanations in accepted instances.

Integer programming formulation for rejected instances.

Experimental results show practical efficiency over previous methods.

Abstract

Trustworthiness in artificial intelligence depends not only on what a model decides, but also on how it handles and explains cases in which a reliable decision cannot be made. In critical domains such as healthcare and finance, a reject option allows the model to abstain when evidence is insufficient, making it essential to explain why an instance is rejected in order to support informed human intervention. In these settings, explanations must not only be interpretable, but also faithful to the underlying model and computationally efficient enough to support real-time decision making. Abductive explanations guarantee fidelity, but their exact computation is known to be NP-hard for many classes of models, limiting their practical applicability. Computing \textbf{minimum-size} abductive explanations is an even more challenging problem, as it requires reasoning not only about fidelity but also about optimality. Prior work has addressed this challenge in restricted settings, including log-linear-time algorithms for computing minimum-size abductive explanations in linear models without rejection, as well as a polynomial-time method based on linear programming for computing abductive explanations, without guarantees of minimum size, for linear models with a reject option. In this work, we bridge these lines of research by computing minimum-size abductive explanations for linear models with a reject option. For accepted instances, we adapt the log-linear algorithm to efficiently compute optimal explanations. For rejected instances, we formulate a 0-1 integer linear programming problem that characterizes minimum-size abductive explanations of rejection. Although this formulation is NP-hard in theory, our experimental results show that it is consistently more efficient in practice than the linear-programming-based approach that does not guarantee minimum-size explanations.