Papers › Feature Responsiveness Scores: Model-Agnostic Explanations for Recourse

Feature Responsiveness Scores: Model-Agnostic Explanations for Recourse

29 Oct 2024arXiv:2410.22598archive 2025-07-28

Seung Hyun Cheon, Anneke Wernerfelt, Sorelle A. Friedler, Berk Ustun

Machine learning models routinely automate decisions in applications like lending and hiring. In such settings, consumer protection rules require companies that deploy models to explain predictions to decision subjects. These rules are motivated, in part, by the belief that explanations can promote recourse by revealing information that individuals can use to contest or improve their outcomes. In practice, many companies comply with these rules by providing individuals with a list of the most important features for their prediction, which they identify based on feature importance scores from feature attribution methods such as SHAP or LIME. In this work, we show how these practices can undermine consumers by highlighting features that would not lead to an improved outcome and by explaining predictions that cannot be changed. We propose to address these issues by highlighting features based on their responsiveness score -- i.e., the probability that an individual can attain a target prediction by changing a specific feature. We develop efficient methods to compute responsiveness scores for any model and any dataset. We conduct an extensive empirical study on the responsiveness of explanations in lending. Our results show that standard practices in consumer finance can backfire by presenting consumers with reasons without recourse, and demonstrate how our approach improves consumer protection by highlighting responsive features and identifying fixed predictions.

PaperPDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2410.22598")

Code

Syntology Ran 0 of 7 code samples harvested from 1 repository linked to this paper; 7 have no recorded run.

By repository: community (archive-listed): 7 samples from 1 repository, 0 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

ustunb/reachml officialmentioned in papermentioned on GitHubMIT report
ustunb/reach-ml mentioned on GitHubMIT report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

7 samples harvested; 0 ran; 0 honoured the contract we drafted; 7 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

7unverified

Licence: 0 of the 7 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from ustunb/reach-ml. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

expand_values ustunb/reach-ml/reachml/utils.py community (archive-listed) unverified MIT (permissive) · 8bd1ca22e60b991e · report
get_action_set_file ustunb/reach-ml/reachml/paths.py community (archive-listed) unverified MIT (permissive) · 53a60af562f0ddb7 · report
get_data_csv_file ustunb/reach-ml/reachml/paths.py community (archive-listed) unverified MIT (permissive) · 2decd86c92adafea · report
get_data_file ustunb/reach-ml/reachml/paths.py community (archive-listed) unverified MIT (permissive) · a0098860145ad174 · report
givemecredit_cts_slim ustunb/reach-ml/reachml/datasets.py community (archive-listed) unverified MIT (permissive) · 35a58be574ff2f38 · report
has_feature_vector_discrete ustunb/reach-ml/reachml/utils.py community (archive-listed) unverified MIT (permissive) · f1591b2229cee5f4 · report
has_feature_vector_float ustunb/reach-ml/reachml/utils.py community (archive-listed) unverified MIT (permissive) · 90cc02227c088c98 · report

Tasks

Feature Importance

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

ALIGNLIMESHAP

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections