arXivDaily arXiv每日学术速递 周一至周五更新
北美退伍军人节(Veterans Day),12 日无更新
arXiv 2602.08362cs.AIcs.LGcs.LO
收藏

随机森林的电路表示及其在可解释性人工智能中的应用

Circuit Representations of Random Forests with Applications to XAI

Chunxi Ji, Adnan Darwiche

AI总结:

本文提出将随机森林分类器编译为电路集的方法,通过实例抽象提升决策解释的可计算性,并提出计算决策鲁棒性和翻转路径的算法。

摘要:

本文作出三项贡献。首先,我们提出将随机森林分类器编译为电路集的方法,每个电路直接编码某些类别的实例。我们实证表明,该方法显著优于现有方法。其次,利用该方法获得可计算的决策完整原因,这些实例抽象在计算解释中起关键作用。最后,我们提出计算决策鲁棒性及所有最短翻转路径的算法。通过该方法,我们列举了所有充分原因、必要原因和对比解释,计算了决策鲁棒性,并识别了所有最短翻转路径。

英文摘要:

We make three contributions in this paper. First, we present an approach for compiling a random forest classifier into a set of circuits, where each circuit directly encodes the instances in some class of the classifier. We show empirically that our proposed approach is significantly more efficient than existing similar approaches. Next, we utilize this approach to further obtain circuits that are tractable for computing the complete and general reasons of a decision, which are instance abstractions that play a fundamental role in computing explanations. Finally, we propose algorithms for computing the robustness of a decision and all shortest ways to flip it. We illustrate the utility of our contributions by using them to enumerate all sufficient reasons, necessary reasons and contrastive explanations of decisions; to compute the robustness of decisions; and to identify all shortest ways to flip the decisions made by random forest classifiers learned from a wide range of datasets.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑