arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2007.15140cs.AIcs.LO
收藏

用SAT计算最优决策集

Computing Optimal Decision Sets with SAT

Monash University(莫纳什大学)

Jinqiang Yu, Alexey Ignatiev, Peter J. Stuckey, Pierre Le Bodic

摘要:

随着机器学习越来越多地用于帮助做出决策,需要这些决策是可解释的。可以说,最容易解释的机器学习模型使用决策规则。本文重点讨论决策集,这是一种具有无序规则的模型,它用单个规则解释每个预测。为了便于人类理解,这些规则必须简明扼要。早期关于生成最优决策集的工作首先最小化规则的数量,然后最小化文字的数量,但最终的规则通常会非常大。在这里,我们考虑一个更好的措施,即在文字的决策集的总大小。因此,我们不会被驱动到一个小的规则集,需要大量的文字。我们提供了第一种方法来确定最小规模的决策集,实现最小的经验风险,然后研究稀疏的替代品,我们的贸易规模的准确性。通过找到最佳的解决方案,我们可以建立决策集分类器,几乎是最好的探试法一样准确,但更简洁,因此更容易解释。

英文摘要:

As machine learning is increasingly used to help make decisions, there is a demand for these decisions to be explainable. Arguably, the most explainable machine learning models use decision rules. This paper focuses on decision sets, a type of model with unordered rules, which explains each prediction with a single rule. In order to be easy for humans to understand, these rules must be concise. Earlier work on generating optimal decision sets first minimizes the number of rules, and then minimizes the number of literals, but the resulting rules can often be very large. Here we consider a better measure, namely the total size of the decision set in terms of literals. So we are not driven to a small set of rules which require a large number of literals. We provide the first approach to determine minimum-size decision sets that achieve minimum empirical risk and then investigate sparse alternatives where we trade accuracy for size. By finding optimal solutions we show we can build decision set classifiers that are almost as accurate as the best heuristic methods, but far more concise, and hence more explainable.

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

↑