The Sample Complexity of Learning the Kernel
published: Dec. 20, 2008, recorded: December 2008, views: 4621
Report a problem or upload filesIf you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
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 diﬀerent types of data, such as unlabeled examples and examples labeled by a diﬀerent (but related) tasks. Part of this work is joint with Nati Srebro.
Link this pageWould you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !