arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2104.10751cs.LGstat.ML
收藏

用于分类的规则生成:可扩展性、可解释性与公平性

Rule Generation for Classification: Scalability, Interpretability, and Fairness

Amsterdam Business School, University of Amsterdam(阿姆斯特丹大学阿姆斯特丹商学院);Erasmus School of Economics, Erasmus University Rotterdam(伊拉斯姆斯大学伊拉斯姆斯经济学院)

Tabea E. Röber, Adia C. Lumadjeng, M. Hakan Akyüz, Ş. İlker Birbil

AI总结:

本文提出一种基于列生成的规则优化分类方法,通过决策树启发式加速NP难定价子问题求解,并引入成本系数与约束同时兼顾局部可解释性、公平性和准确率。

摘要:

我们提出了一种新的基于规则的带约束分类优化方法。该方法利用线性规划的列生成技术,因此能够扩展到大规模数据集。由此产生的定价子问题被证明是NP难问题。我们借助基于决策树的启发式方法,并求解一个代理定价子问题以加速计算。该方法返回一组规则及其最优权重,这些权重表明了每条规则对学习的重要性。我们通过为规则分配成本系数并引入额外约束来处理可解释性和公平性问题。特别地,我们关注局部可解释性,并将公平性中的一个分离准则推广到多个敏感属性和多个类别的情形。我们在一系列数据集上测试了所提方法的性能,并给出了一个案例研究以详细阐述其不同方面。所提出的基于规则的学习方法在局部可解释性和公平性与准确率之间表现出良好的折中。

英文摘要:

We introduce a new rule-based optimization method for classification with constraints. The proposed method leverages column generation for linear programming, and hence, is scalable to large datasets. The resulting pricing subproblem is shown to be NP-Hard. We recourse to a decision tree-based heuristic and solve a proxy pricing subproblem for acceleration. The method returns a set of rules along with their optimal weights indicating the importance of each rule for learning. We address interpretability and fairness by assigning cost coefficients to the rules and introducing additional constraints. In particular, we focus on local interpretability and generalize a separation criterion in fairness to multiple sensitive attributes and classes. We test the performance of the proposed methodology on a collection of datasets and present a case study to elaborate on its different aspects. The proposed rule-based learning method exhibits a good compromise between local interpretability and fairness on the one side, and accuracy on the other side.

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

↑