0


活跃的学习:改变被动为主动改进标签的复杂性

Activized Learning: Transforming Passive to Active with Improved Label Complexity
课程网址: http://videolectures.net/cmulls08_hanneke_altp/  
主讲教师: Steve Hanneke
开课单位: 卡内基梅隆大学
开课时间: 2009-01-15
课程语种: 英语
中文简介:
在主动学习中, 学习算法被允许访问大量未标记的示例, 并允许以交互方式请求该池中任何特定示例的标签。在经验驱动的研究中, 设计新的主动学习算法最常见的技术之一是将现有的被动学习算法作为子例程, 并通过仔细选择信息, 积极构建该方法的训练集要标记的示例。因此, 所产生的主动学习算法能够继承基础被动算法的测试和真实的学习偏差, 而与随机采样相比, 通常需要更少的标签来实现给定的精度。 这自然提出了一个理论问题, 即每一个被动学习算法是否都可以 "激活", 或者转换为主动学习算法, 使用较少数量的标签来实现给定的精度。在今次的发言中, 我将准确地讨论这个问题。特别是, 我将解释如何使用任何被动学习算法作为子例程来构造主动学习算法, 可以证明实现严格优越的渐近标签复杂性。在这一过程中, 我还将描述最近在正式研究主动学习的潜在好处方面取得的许多进展。
课程简介: In active learning, a learning algorithm is given access to a large pool of unlabeled examples, and is allowed to request the labels of any particular examples in that pool, interactively. In empirically driven research, one of the most common techniques for designing new active learning algorithms is to use an existing passive learning algorithm as a subroutine, and actively construct a training set for that method by carefully choosing informative examples to label. The resulting active learning algorithms are thus able to inherit the tried-and-true learning bias of the underlying passive algorithm, while often requiring significantly fewer labels to achieve a given accuracy compared to random sampling. This naturally raises the theoretical question of whether every passive learning algorithm can be "activized", or transformed into an active learning algorithm that uses a smaller number of labels to achieve a given accuracy. In this talk, I will address precisely this question. In particular, I will explain how to use any passive learning algorithm as a subroutine to construct an active learning algorithm that provably achieves a strictly superior asymptotic label complexity. Along the way, I will also describe many of the recent advances in the formal study of the potential benefits of active learning in general.
关 键 词: 计算机科学; 机器学习; 主动学习
课程来源: 视频讲座网
最后编审: 2020-06-05:魏雪琼(课程编辑志愿者)
阅读次数: 36