arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2108.05276cs.AI
收藏

随机森林模型中稀疏性交易的复杂性

Trading Complexity for Sparsity in Random Forest Explanations

CRIL(CRIL(计算机研究实验室));Université d’Artois(阿图瓦大学);CNRS(法国国家科学研究中心);Institut Universitaire de France(法国大学研究院)

Gilles Audemard, Steve Bellart, Louenas Bounia, Frédéric Koriche, Jean-Marie Lagniez, Pierre Marquis

摘要:

随机森林一直被认为是机器学习中强大的模型集成。通过训练多个决策树,其多样性通过数据和特征子采样来培养,所产生的随机森林可以比单个决策树产生更稳定和可靠的预测。然而,这是以降低可解释性为代价的:虽然决策树通常很容易解释,但随机森林做出的预测更难以理解,因为它们涉及数百棵决策树的多数投票。在本文中,我们研究了不同类型的原因,解释“为什么”输入实例被归类为积极或消极的布尔随机森林。值得注意的是,作为一种替代充分的原因采取的形式的随机森林的主要含义,我们引入了主要的原因,这是严格多数的决策树的主要含义。对于这些不同的溯因解释,生成问题(找到一个原因)和最小化问题(找到一个最短的原因)的易处理性进行了研究。在各种数据集上进行的实验揭示了运行时复杂性和稀疏性之间的权衡。充分原因--识别问题是DP-完全的--略大于可以使用简单的线性时间贪心算法生成的多数原因,并且显著大于可以使用任何时间P ARTIAL MAXSAT算法接近的最小多数原因。

英文摘要:

Random forests have long been considered as powerful model ensembles in machine learning. By training multiple decision trees, whose diversity is fostered through data and feature subsampling, the resulting random forest can lead to more stable and reliable predictions than a single decision tree. This however comes at the cost of decreased interpretability: while decision trees are often easily interpretable, the predictions made by random forests are much more difficult to understand, as they involve a majority vote over hundreds of decision trees. In this paper, we examine different types of reasons that explain "why" an input instance is classified as positive or negative by a Boolean random forest. Notably, as an alternative to sufficient reasons taking the form of prime implicants of the random forest, we introduce majoritary reasons which are prime implicants of a strict majority of decision trees. For these different abductive explanations, the tractability of the generation problem (finding one reason) and the minimization problem (finding one shortest reason) are investigated. Experiments conducted on various datasets reveal the existence of a trade-off between runtime complexity and sparsity. Sufficient reasons - for which the identification problem is DP-complete - are slightly larger than majoritary reasons that can be generated using a simple linear- time greedy algorithm, and significantly larger than minimal majoritary reasons that can be approached using an anytime P ARTIAL M AX SAT algorithm.

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

↑