Matching pursuit algorithms in machine learning
published: Dec. 18, 2008, recorded: December 2008, views: 768
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.
I will describe a generic matching pursuit algorithm that can be used in machine learning for regression, subspace methods (kernel PCA and kernel CCA) and classiﬁcation (given time). I will also describe some generalisa- tion error bounds upper bounding their loss. Some of these bounds will be formed using standard sample compression bounds whilst others will be amalgamations of traditional learning theory techniques such as VC theory and Rademacher complexities. This is joint work with John Shawe-Taylor.
Link this pageWould you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !