论文标题
迈向计算可行的深度积极学习
Towards Computationally Feasible Deep Active Learning
论文作者
论文摘要
主动学习(AL)是减少培训机器学习模型所需的注释工作的重要技术。深度学习为在实践中部署AL的几个基本障碍提供了解决方案,但引入了许多其他障碍。此类问题之一是培训采集模型并估算未标记池实例所需的过多计算资源。我们提出了两种针对文本分类和标记任务解决此问题的技术,从而大大减少了迭代持续时间以及AL中深入收购模型引入的计算开销。我们还证明了我们的算法利用伪标记和蒸馏模型克服了文献中先前揭示的基本障碍之一。也就是说,由于用于选择AL期间选择实例的采集模型与经过标记数据的后继模型的差异,因此Al的好处可能会降低。我们表明,尽管使用了较小,更快的获取模型,但我们的算法能够训练具有更高性能的更具表现力的继任模型。
Active learning (AL) is a prominent technique for reducing the annotation effort required for training machine learning models. Deep learning offers a solution for several essential obstacles to deploying AL in practice but introduces many others. One of such problems is the excessive computational resources required to train an acquisition model and estimate its uncertainty on instances in the unlabeled pool. We propose two techniques that tackle this issue for text classification and tagging tasks, offering a substantial reduction of AL iteration duration and the computational overhead introduced by deep acquisition models in AL. We also demonstrate that our algorithm that leverages pseudo-labeling and distilled models overcomes one of the essential obstacles revealed previously in the literature. Namely, it was shown that due to differences between an acquisition model used to select instances during AL and a successor model trained on the labeled data, the benefits of AL can diminish. We show that our algorithm, despite using a smaller and faster acquisition model, is capable of training a more expressive successor model with higher performance.