paper-with-me

Papers

RoCourseNet: Distributionally Robust Training of a Prediction Aware Recourse Model

2022-06-01 · Hangzhi Guo, Feiran Jia, Jinghui Chen, Anna Squicciarini, Amulya Yadav

Counterfactual (CF) explanations for machine learning (ML) models are preferred by end-users, as they explain the predictions of ML models by providing a recourse (or contrastive) case to individuals who are adversely impacted by predicted outcomes. Existing CF explanation methods generate recourses under the assumption that the underlying target ML model remains stationary over time. However, due to commonly occurring distributional shifts in training data, ML models constantly get updated in practice, which might render previously generated recourses invalid and diminish end-users trust in our algorithmic framework. To address this problem, we propose RoCourseNet, a training framework that jointly optimizes predictions and recourses that are robust to future data shifts. This work contains four key contributions: (1) We formulate the robust recourse generation problem as a tri-level optimization problem which consists of two sub-problems: (i) a bi-level problem that finds the worst-case adversarial shift in the training data, and (ii) an outer minimization problem to generate robust recourses against this worst-case shift. (2) We leverage adversarial training to solve this tri-level optimization problem by: (i) proposing a novel virtual data shift (VDS) algorithm to find worst-case shifted ML models via explicitly considering the worst-case data shift in the training dataset, and (ii) a block-wise coordinate descent procedure to optimize for prediction and corresponding robust recourses. (3) We evaluate RoCourseNet's performance on three real-world datasets, and show that RoCourseNet consistently achieves more than 96% robust validity and outperforms state-of-the-art baselines by at least 10% in generating robust CF explanations. (4) Finally, we generalize the RoCourseNet framework to accommodate any parametric post-hoc methods for improving robust validity.

📄 PDF Abstract BibTeX arXiv:2206.00700

Code (1)

bkghz-orange-blue/counternet_adv 공식 구현 pytorch

Tasks

counterfactual

Similar Papers 제목 키워드 기반

Distributionally Robust Recourse Action

2023-02-22 · Duy Nguyen, Ngoc Bui, Viet Anh Nguyen

A recourse action aims to explain a particular algorithmic decision by showing one specific way in which the instance could be modified to receive an alternate outcome. Existing recourse generation methods often assume t…

valid

Argumentative Ensembling for Robust Recourse under Model Multiplicity

2025-06-25 · Junqi Jiang, Antonio Rago, Francesco Leofante, Francesca Toni

In machine learning, it is common to obtain multiple equally performing models for the same prediction task, e.g., when training neural networks with different random seeds. Model multiplicity (MM) is the situation which…

counterfactual

PAR: Plausibility-aware Amortized Recourse Generation

2026-01-24 · Anagha Sabu, Vidhya S, Narayanan C Krishnan arxiv

Algorithmic recourse aims to recommend actionable changes to a factual's attributes that flip an unfavorable model decision while remaining realistic and feasible. We formulate recourse as a Constrained Maximum A-Posteri…

Actionable Recourse via GANs for Mobile Health

2022-11-12 · Jennifer Chien, Anna Guitart, Ana Fernandez del Rio, Africa Perianez 외

Mobile health apps provide a unique means of collecting data that can be used to deliver adaptive interventions.The predicted outcomes considerably influence the selection of such interventions. Recourse via counterfactu…

counterfactualCounterfactual ReasoningPredictionSurvival Analysis

RAGUEL: Recourse-Aware Group Unfairness Elimination

2022-08-30 · Aparajita Haldar, Teddy Cunningham, Hakan Ferhatosmanoglu

While machine learning and ranking-based systems are in widespread use for sensitive decision-making processes (e.g., determining job candidates, assigning credit scores), they are rife with concerns over unintended bias…

AttributecounterfactualDecision MakingFairness+1