{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/paper/algorithmic-recourse-in-the-face-of-noisy","title":"Probabilistically Robust Recourse: Navigating the Trade-offs between Costs and Robustness in Algorithmic Recourse","arxiv_id":"2203.06768","date":"2022-03-13","proceeding":null,"authors":["Martin Pawelczyk","Teresa Datta","Johannes van-den-Heuvel","Gjergji Kasneci","Himabindu Lakkaraju"],"abstract":"As machine learning models are increasingly being employed to make consequential decisions in real-world settings, it becomes critical to ensure that individuals who are adversely impacted (e.g., loan denied) by the predictions of these models are provided with a means for recourse. While several approaches have been proposed to construct recourses for affected individuals, the recourses output by these methods either achieve low costs (i.e., ease-of-implementation) or robustness to small perturbations (i.e., noisy implementations of recourses), but not both due to the inherent trade-offs between the recourse costs and robustness. Furthermore, prior approaches do not provide end users with any agency over navigating the aforementioned trade-offs. In this work, we address the above challenges by proposing the first algorithmic framework which enables users to effectively manage the recourse cost vs. robustness trade-offs. More specifically, our framework Probabilistically ROBust rEcourse (\\texttt{PROBE}) lets users choose the probability with which a recourse could get invalidated (recourse invalidation rate) if small changes are made to the recourse i.e., the recourse is implemented somewhat noisily. To this end, we propose a novel objective function which simultaneously minimizes the gap between the achieved (resulting) and desired recourse invalidation rates, minimizes recourse costs, and also ensures that the resulting recourse achieves a positive model prediction. We develop novel theoretical results to characterize the recourse invalidation rates corresponding to any given instance w.r.t. different classes of underlying models (e.g., linear models, tree based models etc.), and leverage these results to efficiently optimize the proposed objective. Experimental evaluation with multiple real world datasets demonstrates the efficacy of the proposed framework.","url_abs":"https://arxiv.org/abs/2203.06768v4","url_pdf":"https://arxiv.org/pdf/2203.06768v4.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"algorithmic-recourse-in-the-face-of-noisy","repo_url":"https://github.com/MartinPawel/ProbabilisticallyRobustRecourse","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[],"methods":[{"method_slug":"hoc","method_name":"HOC"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/2203.06768","atlas_url":"https://app.syntology.ai/?focus=2203.06768","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.06768"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-25T09:33:49+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/MartinPawel/ProbabilisticallyRobustRecourse","reach":{"status":"ok","spdx":"MIT"}}],"summary":{"ran":2,"unverified":6},"by_repo_kind":{"official":{"samples":8,"ran":2,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"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"},"n_pointer_only_for_licence":0,"samples":[{"code_sha256_prefix":"9514a2f24fa740e8","entry":"remove_nans","repo":"MartinPawel/ProbabilisticallyRobustRecourse","repo_kind":"official","path":"carla/evaluation/process_nans.py","file_url":"https://github.com/MartinPawel/ProbabilisticallyRobustRecourse/blob/HEAD/carla/evaluation/process_nans.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"9514a2f24fa740e8"}},{"code_sha256_prefix":"7be77078dc7a0132","entry":"success_rate","repo":"MartinPawel/ProbabilisticallyRobustRecourse","repo_kind":"official","path":"carla/evaluation/success_rate.py","file_url":"https://github.com/MartinPawel/ProbabilisticallyRobustRecourse/blob/HEAD/carla/evaluation/success_rate.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"7be77078dc7a0132"}},{"code_sha256_prefix":"0aaa962e1866ae50","entry":"d1_distance","repo":"MartinPawel/ProbabilisticallyRobustRecourse","repo_kind":"official","path":"carla/evaluation/distances.py","file_url":"https://github.com/MartinPawel/ProbabilisticallyRobustRecourse/blob/HEAD/carla/evaluation/distances.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"0aaa962e1866ae50"}},{"code_sha256_prefix":"5a1d4fbcd79868dd","entry":"d2_distance","repo":"MartinPawel/ProbabilisticallyRobustRecourse","repo_kind":"official","path":"carla/evaluation/distances.py","file_url":"https://github.com/MartinPawel/ProbabilisticallyRobustRecourse/blob/HEAD/carla/evaluation/distances.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"5a1d4fbcd79868dd"}},{"code_sha256_prefix":"dd26c560863fb6ee","entry":"get_distances","repo":"MartinPawel/ProbabilisticallyRobustRecourse","repo_kind":"official","path":"carla/evaluation/distances.py","file_url":"https://github.com/MartinPawel/ProbabilisticallyRobustRecourse/blob/HEAD/carla/evaluation/distances.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"dd26c560863fb6ee"}},{"code_sha256_prefix":"5b72258632321738","entry":"get_models_home","repo":"MartinPawel/ProbabilisticallyRobustRecourse","repo_kind":"official","path":"carla/models/catalog/load_model.py","file_url":"https://github.com/MartinPawel/ProbabilisticallyRobustRecourse/blob/HEAD/carla/models/catalog/load_model.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"5b72258632321738"}},{"code_sha256_prefix":"98bfa98a1f6638d0","entry":"load_online_model","repo":"MartinPawel/ProbabilisticallyRobustRecourse","repo_kind":"official","path":"carla/models/catalog/load_model.py","file_url":"https://github.com/MartinPawel/ProbabilisticallyRobustRecourse/blob/HEAD/carla/models/catalog/load_model.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"98bfa98a1f6638d0"}},{"code_sha256_prefix":"ab78eace1f03136c","entry":"load_trained_model","repo":"MartinPawel/ProbabilisticallyRobustRecourse","repo_kind":"official","path":"carla/models/catalog/load_model.py","file_url":"https://github.com/MartinPawel/ProbabilisticallyRobustRecourse/blob/HEAD/carla/models/catalog/load_model.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"ab78eace1f03136c"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}