Skip to main content
Search

# MINABRO

1 related articles

Subscribe to updates
  1. Explaining abstention, not just predictions: MINABRO computes minimum-size abductive explanations for linear models with a reject option

    Linear classifiers with a reject option abstain when evidence is insufficient, but no method previously guaranteed both faithful and minimum-size explanations for those abstentions. MINABRO keeps a greedy ordering for classified instances, yielding minimum-size abductive explanations in O(n log n) time over bounded feature domains, and formulates rejected instances as a 0–1 integer linear program. Across ten public datasets it ran faster than the sampling-based Anchors and the linear-programming AbLinRO, even while solving the NP-hard rejection form.

You’re all caught up