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

二分类器中事后纠错的约束图高效搜索

Efficient Constrained Graph Search for Post-hoc Error Correction in Binary Classifiers

Leidos Holdings Inc.(莱多斯控股公司);The University of Texas at Austin(德克萨斯大学奥斯汀分校)

Qinwu Xu

AI总结:

提出模型无关的约束事后纠错框架,通过图搜索和动态约束为冻结二分类器生成可解释规则,高效消除假阳性并控制新错误。

摘要:

我们提出了一种模型无关的框架,用于二分类器中的约束事后纠错。给定一个冻结的基础分类器,该方法搜索可解释的特征-阈值规则的合取,以纠正残余的假阳性或假阴性错误,同时显式约束新引入的错误。该方法结合了基于图的候选规则路径搜索、深度相关的动态约束,以及用于高效阈值评估的缩减直方图过程。与重新训练或修改基础分类器不同,学习到的纠错路径作用于其预测,因此可应用于具有合适输入特征的任意二分类器。在一个大规模二分类问题上的实验表明,该方法能够高效地识别紧凑的纠错规则;例如,一种配置消除了90%的假阳性,同时牺牲了5%的真阳性。

英文摘要:

This study develops a graph search algorithm to find the optimal discrimination path for the binary classification problem. The objective function is defined as the difference of variations between the true positive (TP) and false positive (FP). It uses the depth first search (DFS) algorithm to find the top-down paths for discrimination. It proposes a dynamic optimization procedure to optimize TP at the upper levels and then reduce FP at the lower levels. To accelerate computing speed while improving accuracy, it proposes a reduced histogram algorithm with variable bin size instead of looping over all data points to find the feature threshold of discrimination. The algorithm is applied on top of a Support Vector Machine (SVM) model for a binary classification problem on whether a person is fit or unfit. It significantly improves TP and reduces FP of the SVM results (e.g., reduced FP by 90\% with a loss of only 5\% TP). The graph search auto-generates 39 ranked discrimination paths within 9 seconds on an input of 328,464 objects, using a dual-core laptop computer with a processor of 2.59 GHz.

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

↑