CONFEX: Uncertainty-Aware Counterfactual Explanations with Conformal Guarantees
Aman Bilkhoo, Mehran Hosseini, Milad Kazemi, Nicola Paoletti

TL;DR
CONFEX introduces a method for generating reliable counterfactual explanations that incorporate uncertainty guarantees using conformal prediction and MILP, improving robustness and interpretability.
Contribution
It presents a novel uncertainty-aware counterfactual explanation method with formal guarantees, leveraging conformal prediction and tree-based input space partitioning.
Findings
CONFEX provides local coverage guarantees for explanations.
The method achieves robust and plausible explanations across benchmarks.
CONFEX outperforms existing approaches in reliability and interpretability.
Abstract
Counterfactual explanations (CFXs) provide human-understandable justifications for model predictions, enabling actionable recourse and enhancing interpretability. To be reliable, CFXs must avoid regions of high predictive uncertainty, where explanations may be misleading or inapplicable. However, existing methods often neglect uncertainty or lack principled mechanisms for incorporating it with formal guarantees. We propose CONFEX, a novel method for generating uncertainty-aware counterfactual explanations using Conformal Prediction (CP) and Mixed-Integer Linear Programming (MILP). CONFEX explanations are designed to provide local coverage guarantees, addressing the issue that CFX generation violates exchangeability. To do so, we develop a novel localised CP procedure that enjoys an efficient MILP encoding by leveraging an offline tree-based partitioning of the input space. This way,…
Peer Reviews
Decision·Submitted to ICLR 2026
-- I enjoyed reading this paper. The idea of bringing together ideas from conformal prediction and MILP for counterfactuals is interesting. Conformal prediction techniques give prediction sets that are guaranteed to contain the true (unknown) outcome with a given probability. MILP provides a framework for deriving CFXs as a constraint-solving problem. The technique is called CONFEX. -- They also introduce CONFEX-Tree which is a more efficient way of computing the uncertainty-aware counterfactua
-- The tabular datasets used are also used for gradient-based counterfactual generation techniques. Could you highlight the differences and benefits of this class of technique from gradient based methods? There's this line in limitations that would be great to elaborate and clarify: gradient-based methods like Wachter and ECCCo are less prone to this problem, but they sacrifice guarantees on CFX validity. -- How do you compute plausibility and validity in the experiments? -- The experiments se
The paper tackles an interesting question and reads okay. I believe the paper addresses an important problem with using CP for counterfactual generation. The authors also cleverly simplify the problem to enable better scalability.
There are multiple issues with the paper. In order of perceived importance: - The paper seems to wrongly claim that the MIP formulation is linear. Algorithm 2 contains the multiplication of two variables ($in_i$ and $w_i$), specifically on lines 8 and 9. The paper should specify the exact and complete MIP formulation, as is otherwise common in MIP literature, at least in appendix. Especially, the formulation of CONFEX-Tree is essential. Algorithm 1 specifies only a general idea and no further e
The paper demonstrates technical rigor in identifying and addressing a fundamental problem with applying conformal prediction to counterfactual explanation generation. The recognition that CFX search violates the exchangeability assumption which a cornerstone of CP's validity which represents genuine theoretical insight. The authors don't simply note this problem but provide a principled solution through localized CP that enforces approximate conditional guarantees. The mathematical formulation
The novelty of this work is fundamentally incremental rather than groundbreaking. The paper essentially combines two existing techniques i.e., localized conformal prediction (Guan, 2023) and MILP-based counterfactual generation (Kanamori et al., 2020). in a principled way. While the combination is non-trivial and the application domain is new, neither the core CP methodology nor the optimization framework represents novel technical contributions. The localized CP procedure is directly borrowed f
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsExplainable Artificial Intelligence (XAI) · Advanced Graph Neural Networks · Adversarial Robustness in Machine Learning
