Feature-Learning from Pairs of Examples in Collections of Supervised Learning Tasks
published: Feb. 25, 2007, recorded: February 2005, views: 75
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.
We present an algorithm which uses example pairs of equal or unequal class labels to select a projection on a kernel-induced Hilbert space. A representation of .nite dimensional projections as bounded lin- ear functionals on a space of Hilbert-Schmidt operators is exploited to give bounds on the Rademacher complexity of the class of hypotheses searched, leading to PAC-type performance guarantees for the resulting feature maps. The proposed algorithm returns the projection onto the span of the principal eigenvectors of an empirical operator constructed in terms of the example pairs. Experiments demonstrate an e¤ective trans- fer of knowledge between di¤erent but related learning tasks.
Link this pageWould you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !