Researchers have developed a new constraint programming (CP) formulation called CPCF for computing optimal counterfactual explanations in tree ensembles. This method encodes numerical features as interval domains and discrete features with native finite-domain representations, enabling efficient search without continuous boundary analysis. The study compares CPCF against MaxSAT and MILP formulations across various datasets and tree ensemble types, finding CP to be the most versatile and generally performant approach. AI
影响 Introduces a more robust method for generating counterfactual explanations, potentially increasing trust in AI model decisions.
排序理由 Academic paper detailing a new method for counterfactual explanations in machine learning models.
AI 生成摘要 · Google Gemini · 来自 2 个来源。 我们如何撰写摘要 →
