REVIEW 3 cited by
A survey of algorithmic recourse: definitions, formulations, solutions, and prospects
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
Machine learning is increasingly used to inform decision-making in sensitive situations where decisions have consequential effects on individuals' lives. In these settings, in addition to requiring models to be accurate and robust, socially relevant values such as fairness, privacy, accountability, and explainability play an important role for the adoption and impact of said technologies. In this work, we focus on algorithmic recourse, which is concerned with providing explanations and recommendations to individuals who are unfavourably treated by automated decision-making systems. We first perform an extensive literature review, and align the efforts of many authors by presenting unified definitions, formulations, and solutions to recourse. Then, we provide an overview of the prospective research directions towards which the community may engage, challenging existing assumptions and making explicit connections to other ethical challenges such as security, privacy, and fairness.
Forward citations
Cited by 3 Pith papers
-
A Survey of Explainable Reinforcement Learning: Targets, Methods and Needs
A survey of 250+ explainable-reinforcement-learning papers proposes a What/How taxonomy and reports that sequence-level explanations are rare (11 works) compared with policy-level (175) and action-level (89) ones.
-
Steering Robots with Inference-Time Interactions
Frozen imitation policies can be steered at inference time via user interactions, with a diffusion-sampling method and a constraint-enforcing framework that provides formal task guarantees.
-
Pareto Optimal Algorithmic Recourse in Multi-cost Function
A Bellman-Ford-style dynamic program over an actionability graph returns all Pareto-optimal recourse paths for multiple non-differentiable metric costs, with an epsilon-net sampling scheme proposed for scalability.
Discussion (0). Continue with ORCID to comment.