主动学习的核离散
Nuclear Discrepancy for Active Learning
摘要:
主动学习算法提出应该查询哪些未标记的对象的标签,以最大限度地改善预测模型。我们研究主动学习者,最大限度地减少泛化界限,并发现这些界限之间的关系,导致一个改进的方法,主动学习。特别是,我们展示了国家的最先进的最大平均离散(MMD)主动学习者,离散的界限,和一个新的和松散的约束,我们称为核离散界之间的关系。我们激励这一约束的概率参数:我们认为它考虑的情况下,更有可能发生。我们的实验表明,主动学习使用最严格的离散边界执行最差的平方损失。总的来说,我们提出的loocampus核离散泛化界表现最好。我们证实了我们的概率论证经验:其他界限集中在更悲观的情况下,在实践中是罕见的。我们的结论是,紧密的界限并不总是主要的重要性,主动学习方法应该集中在现实的情况下,以提高性能。
英文摘要:
Active learning algorithms propose which unlabeled objects should be queried for their labels to improve a predictive model the most. We study active learners that minimize generalization bounds and uncover relationships between these bounds that lead to an improved approach to active learning. In particular we show the relation between the bound of the state-of-the-art Maximum Mean Discrepancy (MMD) active learner, the bound of the Discrepancy, and a new and looser bound that we refer to as the Nuclear Discrepancy bound. We motivate this bound by a probabilistic argument: we show it considers situations which are more likely to occur. Our experiments indicate that active learning using the tightest Discrepancy bound performs the worst in terms of the squared loss. Overall, our proposed loosest Nuclear Discrepancy generalization bound performs the best. We confirm our probabilistic argument empirically: the other bounds focus on more pessimistic scenarios that are rarer in practice. We conclude that tightness of bounds is not always of main importance and that active learning methods should concentrate on realistic scenarios in order to improve performance.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。