Sign inGet started
Paper · arXiv

FCx: An algorithm for finding Feasible Counterfactual Explanations

Counterfactual (CF) explanations identify changes that alter an input's classification. While existing methods produce realistic and low-cost CFs, they often fail to ensure feasibility, by suggesting non-constructive modifications or incompatible with future changes (e.g., changing an individual's race to secure a job offer). We introduce a refinement of CF explanations that explicitly enforces feasibility. Our approach is the first to efficiently generate CFs that are realistic, low-cost and feasible. We accommodate both hard feasible constraints, specified by domain knowledge users, and soft feasible constraints, inferred automatically via causal inference from the dataset. Our method, ...

AuthorsKleopatra Markou, Vana Kalogeraki, Dimitrios Gunopulos
Primary categorycs.LG
Published16 September 2026
Last updated at source16 September 2026
cs.LG
Embed this entry
<iframe src="https://silytics.si/embed/item/a40009f2-b54d-46d7-9d30-731a0ced061e" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Free, no tracking. More about feeds and embeds.

Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 17 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.