# Endogenous Macrodynamics in Algorithmic Recourse
# Endogenous Macrodynamics in Algorithmic Recourse
This repository contains all code, notebooks, data and empirical results for our conference paper "Endogenous Macrodynamics in Algorithmic Recourse". Below is a list of relevant resources hosted in this repository:
This repository contains all code, notebooks, data and empirical results for our conference paper "Endogenous Macrodynamics in Algorithmic Recourse" [@altmeyer2023endogenous].
1. [Paper](paper/paper.pdf)
Below is a list of relevant resources hosted in this repository:
6. Software: [`AlgorithmicRecourseDynamics.jl`](https://github.com/pat-alt/AlgorithmicRecourseDynamics.jl) and [`CounterfactualExplanations.jl`](https://github.com/pat-alt/CounterfactualExplanations.jl)
## Motivation
## Motivation
...
@@ -33,3 +38,5 @@ Existing work on Counterfactual Explanations (CE) and Algorithmic Recourse (AR)
...
@@ -33,3 +38,5 @@ Existing work on Counterfactual Explanations (CE) and Algorithmic Recourse (AR)
By introducing a second penalty term in the counterfactual search objective, we can explicitly penalize external costs. The figure below illustrates how the mitigation strategies compared to the baseline approach, that is, Wachter (Generic) with γ = 0.5: choosing a higher decision threshold pushes the counterfactual a little further into the target domain; this effect is even stronger for ClaPROAR; finally, using the Gravitational generator the counterfactual ends up all the way inside the target domain. Find out more in the [paper](paper/paper.pdf).
By introducing a second penalty term in the counterfactual search objective, we can explicitly penalize external costs. The figure below illustrates how the mitigation strategies compared to the baseline approach, that is, Wachter (Generic) with γ = 0.5: choosing a higher decision threshold pushes the counterfactual a little further into the target domain; this effect is even stronger for ClaPROAR; finally, using the Gravitational generator the counterfactual ends up all the way inside the target domain. Find out more in the [paper](paper/paper.pdf).
author={Altmeyer, Patrick and Angela, Giovan and Buszydlik, Aleksander and Dobiczek, Karol and van Deursen, Arie and Liem, Cynthia},
booktitle={First {IEEE} {Conference} on {Secure} and {Trustworthy} {Machine} {Learning}},
date={2023},
title={Endogenous {Macrodynamics} in {Algorithmic} {Recourse}},
file={:altmeyerendogenous - Endogenous Macrodynamics in Algorithmic Recourse.pdf:PDF},
}
%% This BibTeX bibliography file was created using BibDesk.
%% This BibTeX bibliography file was created using BibDesk.
%% https://bibdesk.sourceforge.io/
%% https://bibdesk.sourceforge.io/
...
@@ -2386,4 +2394,13 @@
...
@@ -2386,4 +2394,13 @@
keywords={Computer Science - Machine Learning, Computer Science - Data Structures and Algorithms, Computer Science - Computer Science and Game Theory, Statistics - Machine Learning},
keywords={Computer Science - Machine Learning, Computer Science - Data Structures and Algorithms, Computer Science - Computer Science and Game Theory, Statistics - Machine Learning},
}
}
@Article{pawelczyk2022probabilistically,
author={Pawelczyk, Martin and Datta, Teresa and van-den-Heuvel, Johannes and Kasneci, Gjergji and Lakkaraju, Himabindu},
date={2022},
journaltitle={arXiv preprint arXiv:2203.06768},
title={Probabilistically {Robust} {Recourse}: {Navigating} the {Trade}-offs between {Costs} and {Robustness} in {Algorithmic} {Recourse}},
file={:pawelczyk2022probabilistically - Probabilistically Robust Recourse_ Navigating the Trade Offs between Costs and Robustness in Algorithmic Recourse.pdf:PDF},