面向主动学习的学习排序:列表方法
Learning to Rank for Active Learning: A Listwise Approach
摘要:
主动学习作为一种替代方案出现,以减轻为大量数据的应用程序(如图像/视频索引和检索,自动驾驶等)标记大量数据的努力。主动学习的目标是根据获取函数自动选择一些未标记的样本进行注释(根据预算),该获取函数指示样本对于训练模型的价值。学习损失方法是一种与任务无关的方法,它附加了一个模块来学习预测未标记数据的目标损失,并选择损失最大的数据进行标记。在这项工作中,我们遵循这一策略,但我们定义的收购功能作为一个学习排序的问题,并重新考虑的损失预测模块的结构,使用一个简单但有效的列表方法。四个数据集上的实验结果表明,我们的方法优于最近的国家的最先进的主动学习方法的图像分类和回归任务。
英文摘要:
Active learning emerged as an alternative to alleviate the effort to label huge amount of data for data hungry applications (such as image/video indexing and retrieval, autonomous driving, etc.). The goal of active learning is to automatically select a number of unlabeled samples for annotation (according to a budget), based on an acquisition function, which indicates how valuable a sample is for training the model. The learning loss method is a task-agnostic approach which attaches a module to learn to predict the target loss of unlabeled data, and select data with the highest loss for labeling. In this work, we follow this strategy but we define the acquisition function as a learning to rank problem and rethink the structure of the loss prediction module, using a simple but effective listwise approach. Experimental results on four datasets demonstrate that our method outperforms recent state-of-the-art active learning approaches for both image classification and regression tasks.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。