Material Detail

Matching pursuit algorithms in machine learning

Matching pursuit algorithms in machine learning

This video was recorded at Workshop on Sparsity and Inverse Problems in Statistical Theory and Econometrics, Berlin 2008. 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 classification (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.


  • User Rating
  • Comments
  • Learning Exercises
  • Bookmark Collections
  • Course ePortfolios
  • Accessibility Info

More about this material


Log in to participate in the discussions or sign up if you are not already a MERLOT member.