用模型共识与分歧指导标注,大幅减少选最优模型的标注量。
Consensus-Driven Active Model Selection

- 基于概率框架建模模型间关系,利用共识与分歧选择最有信息量的样本标注。
- 在26个基准任务上,相比之前最优方法,减少超70%标注工作量。
- 适合资源有限但需从多个模型中选出最佳方案的研究者使用。
大量现成机器学习模型的出现带来了新挑战:面对众多候选模型,应如何为特定数据分析任务选出最优模型?传统方法依赖人工标注验证集,成本高且耗时。本文提出一种主动模型选择方法CODA,通过分析候选模型对测试样本的预测结果,优先标注能有效区分最优模型的数据点。该方法在概率框架下建模分类器、类别与数据点之间的关系,利用模型间的共识与分歧引导标签获取过程,并通过贝叶斯推断动态更新对最优模型的认知。我们构建了包含26个基准任务的数据集,覆盖多种模型选择场景。实验表明,CODA显著优于现有方法,在发现最优模型过程中,标注成本比当前最优方法降低超过70%。代码与数据已公开于https://github.com/justinkay/coda。
原文摘要 · Abstract (English)
The widespread availability of off-the-shelf machine learning models poses a challenge: which model, of the many available candidates, should be chosen for a given data analysis task? This question of model selection is traditionally answered by collecting and annotating a validation dataset -- a costly and time-intensive process. We propose a method for active model selection, using predictions from candidate models to prioritize the labeling of test data points that efficiently differentiate the best candidate. Our method, CODA, performs consensus-driven active model selection by modeling relationships between classifiers, categories, and data points within a probabilistic framework. The framework uses the consensus and disagreement between models in the candidate pool to guide the label acquisition process, and Bayesian inference to update beliefs about which model is best as more information is collected. We validate our approach by curating a collection of 26 benchmark tasks capturing a range of model selection scenarios. CODA outperforms existing methods for active model selection significantly, reducing the annotation effort required to discover the best model by upwards of 70% compared to the previous state-of-the-art. Code and data are available at https://github.com/justinkay/coda.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。