Explainable AI Isn't Enough! Rethinking Algorithmic Contestability
Timo Freiesleben, Kristof Meding, Gunnar K\"onig

TL;DR
This paper emphasizes the importance of algorithmic contestability in AI decision-making, proposing a formal framework and evidence types for challenging erroneous decisions beyond traditional explainability methods.
Contribution
It introduces a formal definition of contestability, identifies key evidence types for overturning decisions, and connects these concepts to existing legal rights.
Findings
Standard XAI explanations are insufficient for contesting decisions.
Three evidence types—predictive multiplicity, incorrect features, neglected evidence—enable contestability.
Existing EU laws support some rights to contestability evidence.
Abstract
Machine learning systems increasingly make life-changing decisions about individuals, such as loan approvals, hiring, and cheating detection, raising a pressing question: how can individuals respond to negative decisions made by these opaque systems? While explainable artificial intelligence (XAI) has largely focused on algorithmic recourse -- helping individuals change their features to obtain a desired outcome -- the parallel problem of algorithmic contestability -- helping individuals review and correct erroneous algorithmic decisions -- has received far less attention, despite its central ethical and legal importance. We trace this neglect to the absence of clear formal definitions and a systematic operationalization of contestability as an algorithmic problem. To address it, we propose an operational definition of contestability as a natural complement to recourse: contestability…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
