0


学习内核的样本复杂性

The Sample Complexity of Learning the Kernel
课程网址: http://videolectures.net/lkasok08_david_tscol/  
主讲教师: Shai Ben-David
开课单位: 滑铁卢大学
开课时间: 2008-12-20
课程语种: 英语
中文简介:
基于内核的学习算法的成功取决于内核对学习任务的适用性。理想情况下,内核的选择应基于学习者关于手头任务的先验信息。但是,实际上,正在根据可用的训练数据调整内核参数。我将讨论与这种“学习内核”场景相关的示例复杂性开销。我将讨论内核选择的训练数据是目标标记示例的设置,以及此训练基于不同类型的数据的设置,例如未标记的示例和由不同(但相关)任务标记的示例。这项工作的一部分是与Nati Srebro合作。
课程简介: The success of kernel based learning algorithms depends upon the suitability of the kernel to the learning task. Ideally, the choice of a kernel should based on prior information of the learner about the task at hand. However, in practice, kernel parameters are being tuned based on available training data. I will discuss the sample complexity overhead associated with such ”learning the kernel” scenarios. I will address the setting in which the training data for the kernel selection is target labeled examples, as well as settings in which this training is based on different types of data, such as unlabeled examples and examples labeled by a different (but related) tasks. Part of this work is joint with Nati Srebro.
关 键 词: 内核; 训练数据; 任务标记
课程来源: 视频讲座网
最后编审: 2019-05-14:lxf
阅读次数: 69