arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2110.09585cs.LG
收藏

A-最优主动学习

A-Optimal Active Learning

University of British Columbia(不列颠哥伦比亚大学)

Tue Boesen, Eldad Haber

摘要:

在这项工作中,我们讨论的问题,主动学习。我们提出了一种基于不适定问题的A-最优实验设计的方法,并展示了如何通过部分探测来最佳地标记数据集,并使用它来训练深度网络。我们提出了两种方法,对数据集做出不同的假设。第一个是基于贝叶斯解释的半监督学习问题与用于先验分布的图拉普拉斯算子,第二个是基于频率论的方法,更新估计的偏差项的基础上恢复的标签。我们证明了这种方法可以高效地估计标签和训练深度网络。

英文摘要:

In this work we discuss the problem of active learning. We present an approach that is based on A-optimal experimental design of ill-posed problems and show how one can optimally label a data set by partially probing it, and use it to train a deep network. We present two approaches that make different assumptions on the data set. The first is based on a Bayesian interpretation of the semi-supervised learning problem with the graph Laplacian that is used for the prior distribution and the second is based on a frequentist approach, that updates the estimation of the bias term based on the recovery of the labels. We demonstrate that this approach can be highly efficient for estimating labels and training a deep network.

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

↑