Counterfactual Plans under Distributional Ambiguity

Ngoc Bui · Duy Nguyen · Viet Anh Nguyen

Keywords: [ robust optimization ]

[ Abstract ]
[ Visit Poster at Spot D2 in Virtual World ] [ OpenReview
Thu 28 Apr 2:30 a.m. PDT — 4:30 a.m. PDT


Counterfactual explanations are attracting significant attention due to the flourishing applications of machine learning models in consequential domains. A counterfactual plan consists of multiple possibilities to modify a given instance so that the model's prediction will be altered. As the predictive model can be updated subject to the future arrival of new data, a counterfactual plan may become ineffective or infeasible, with respect to the future values of the model parameters. In this work, we study the counterfactual plans under model uncertainty, in which the distribution of the model parameters is partially prescribed using only the first- and second-moment information. First, we propose an uncertainty quantification tool to compute the lower and upper bounds of the probability of feasibility for any given counterfactual plan. We then provide corrective methods to adjust the counterfactual plan to improve the feasibility measure. The numerical experiments validate our bounds and demonstrate that our correction increases the robustness of the counterfactual plans in different real-world datasets.

Chat is not available.