arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2005.10848cs.LGcs.ITmath.ITstat.ML
收藏

基于异构局部专家的全局多类分类与数据集构建

Global Multiclass Classification and Dataset Construction via Heterogeneous Local Experts

Stanford University(斯坦福大学)

Surin Ahn, Ayfer Ozgur, Mert Pilanci

摘要:

在数据集构建和众包领域,一个值得注意的挑战是从一组异质的标签者中聚合标签,每个标签者都可能是某些任务子集的专家(而在其他任务中不太可靠)。为了降低雇用人工标记或训练自动标记系统的成本,感兴趣的是最小化标记器的数量,同时确保所得数据集的可靠性。我们将其建模为使用较小分类器的预测执行$K$类分类的问题,每个分类器在$[K]$的一个子集上训练,并推导出在对抗性和随机假设下准确推断未标记样本的真实类所需的分类器数量的界限。通过利用连接到经典的集合覆盖问题,我们产生了一个接近最优的方案,用于设计这种配置的分类器,恢复了众所周知的一对一。一种分类方法作为特例。MNIST和CIFAR-10数据集的实验证明了我们的聚合方案应用于在数据子集上训练的分类器的良好准确性(与集中式分类器相比)。这些结果提出了一种新的方法来自动标记数据或适应现有的一组局部分类器,以更大规模的多类问题。

英文摘要:

In the domains of dataset construction and crowdsourcing, a notable challenge is to aggregate labels from a heterogeneous set of labelers, each of whom is potentially an expert in some subset of tasks (and less reliable in others). To reduce costs of hiring human labelers or training automated labeling systems, it is of interest to minimize the number of labelers while ensuring the reliability of the resulting dataset. We model this as the problem of performing $K$-class classification using the predictions of smaller classifiers, each trained on a subset of $[K]$, and derive bounds on the number of classifiers needed to accurately infer the true class of an unlabeled sample under both adversarial and stochastic assumptions. By exploiting a connection to the classical set cover problem, we produce a near-optimal scheme for designing such configurations of classifiers which recovers the well known one-vs.-one classification approach as a special case. Experiments with the MNIST and CIFAR-10 datasets demonstrate the favorable accuracy (compared to a centralized classifier) of our aggregation scheme applied to classifiers trained on subsets of the data. These results suggest a new way to automatically label data or adapt an existing set of local classifiers to larger-scale multiclass problems.

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

↑