arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1911.09162cs.LGstat.ML
收藏

深度主动学习:统一原则的查询与训练方法

Deep Active Learning: Unified and Principled Method for Query and Training

Université Laval(拉瓦尔大学);Mila, Canada CIFAR AI Chair(Mila(加拿大)CIFAR人工智能主席);University of Western Ontario(西安大略大学);Vector Institute(Vector研究所(注:该机构常见译名为“Vector研究院”))

Changjian Shui, Fan Zhou, Christian Gagné, Boyu Wang

摘要:

在本文中,我们提出了一个统一的和原则性的方法,查询和训练过程中的深批主动学习。我们通过采用Wasserstein距离,将主动学习中的交互过程建模为分布匹配,从而提供理论见解。因此,我们从理论分析中推导出一个新的训练损失,通过交替优化将其分解为优化深度神经网络参数和批量查询选择。此外,通过利用未标记的数据信息,训练深度神经网络的损失自然地被公式化为最小-最大优化问题。此外,所提出的原则也表明了一个明确的不确定性多样性的权衡在查询批量选择。最后,我们评估我们提出的方法在不同的基准,一贯表现出更好的经验性能和更好的时间效率的查询策略相比,基线。

英文摘要:

In this paper, we are proposing a unified and principled method for both the querying and training processes in deep batch active learning. We are providing theoretical insights from the intuition of modeling the interactive procedure in active learning as distribution matching, by adopting the Wasserstein distance. As a consequence, we derived a new training loss from the theoretical analysis, which is decomposed into optimizing deep neural network parameters and batch query selection through alternative optimization. In addition, the loss for training a deep neural network is naturally formulated as a min-max optimization problem through leveraging the unlabeled data information. Moreover, the proposed principles also indicate an explicit uncertainty-diversity trade-off in the query batch selection. Finally, we evaluate our proposed method on different benchmarks, consistently showing better empirical performances and a better time-efficient query strategy compared to the baselines.

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

↑