paper-with-me

Papers

Synthesizing explainable counterfactual policies for algorithmic recourse with program synthesis

2022-01-18 · Giovanni De Toni, Bruno Lepri, Andrea Passerini

Being able to provide counterfactual interventions - sequences of actions we would have had to take for a desirable outcome to happen - is essential to explain how to change an unfavourable decision by a black-box machine learning model (e.g., being denied a loan request). Existing solutions have mainly focused on generating feasible interventions without providing explanations on their rationale. Moreover, they need to solve a separate optimization problem for each user. In this paper, we take a different approach and learn a program that outputs a sequence of explainable counterfactual actions given a user description and a causal graph. We leverage program synthesis techniques, reinforcement learning coupled with Monte Carlo Tree Search for efficient exploration, and rule learning to extract explanations for each recommended action. An experimental evaluation on synthetic and real-world datasets shows how our approach generates effective interventions by making orders of magnitude fewer queries to the black-box classifier with respect to existing solutions, with the additional benefit of complementing them with interpretable explanations.

📄 PDF Abstract BibTeX arXiv:2201.07135

Code (1)

unitn-sml/syn-interventions-algorithmic-recourse 공식 구현 pytorch

Tasks

counterfactualEfficient ExplorationProgram Synthesis

Similar Papers 제목 키워드 기반

Counterfactual Explanations via Locally-guided Sequential Algorithmic Recourse

2023-09-08 · Edward A. Small, Jeffrey N. Clark, Christopher J. McWilliams, Kacper Sokol 외

Counterfactuals operationalised through algorithmic recourse have become a powerful tool to make artificial intelligence systems explainable. Conceptually, given an individual classified as y -- the factual -- we seek ac…

counterfactual

Endogenous Macrodynamics in Algorithmic Recourse

2023-08-16 · Patrick Altmeyer, Giovan Angela, Aleksander Buszydlik, Karol Dobiczek 외

Existing work on Counterfactual Explanations (CE) and Algorithmic Recourse (AR) has largely focused on single individuals in a static environment: given some estimated model, the goal is to find valid counterfactuals for…

counterfactualvalid

ElliCE: Efficient and Provably Robust Algorithmic Recourse via the Rashomon Sets

2026-02-07 · Bohdan Turbal, Iryna Voitsitska, Lesia Semenova arxiv

Machine learning models now influence decisions that directly affect people's lives, making it important to understand not only their predictions, but also how individuals could act to obtain better results. Algorithmic …

Longitudinal Counterfactuals: Constraints and Opportunities

2024-02-29 · Alexander Asemota, Giles Hooker

Counterfactual explanations are a common approach to providing recourse to data subjects. However, current methodology can produce counterfactuals that cannot be achieved by the subject, making the use of counterfactuals…

counterfactual

When Bits Break Recourse: Counterfactual-Faithful Quantization

2026-05-16 · Chaymae Yahyati, Ismail Lamaakal, Khalid El Makkaoui, Ibrahim Ouahbi arxiv

Quantization can preserve predictive accuracy under low-bit deployment while silently breaking algorithmic recourse: an actionable change that flips a decision before quantization may fail after quantization, or become s…