Machine learning with kernel methods

Jean-Philippe Vert, Mines ParisTech

MSc Mathematics, Vision, Learning (ENS Cachan), Spring 2009

Results

Slides (last update: Jan 12, 2009)

Internships / PhD

Outline

Many problems in computational biology and chemistry can be formalized as classical statistical problems, e.g., pattern recognition, regression or dimension reduction, with the caveat that the data are often not vectors. Indeed objects such as gene sequences, small molecules, protein 3D structures or phylogenetic trees, to name just a few, have particular structures which contain relevant information for the statistical problem but can hardly be encoded into finite-dimensional vector representations.

Kernel methods are a class of algorithms well suited for such problems. Indeed they extend the applicability of many statistical methods initially designed for vectors to virtually any type of data, without the need for explicit vectorization of the data. The price to pay for this extension to non-vectors is the need to define a positive definite kernel between the objects, formally equivalent to an implicit vectorization of the data. The "art" of kernel design for various objects have witnessed important advances in recent years, resulting in many state-of-the-art algorithms in computational biology and chemistry, as well as many other fields.

The goal of this course is to present the mathematical foundations of kernel methods, as well as the main approaches that have emerged so far in kernel design. The relevance of these methods will be illustrated by several examples in computational biology and chemistry.

Schedule and Homework

Lecture take place usually in room C103 (ENS Cachan, building Cournot), 10am-12:30pm.

Homeworks are due at the begining of the following lecture, by hard copy or (better) e-mail to Jean-Philippe.Vert@ensmp.fr. Implementations can be done in the programming language of your choice, e.g., the free R language, or Matlab and its free clone Octave

DateTopicSlidesHomeworkData
Jan 12, 2009Positive definite Kernels, RKHS1-36Homework 1
Jan 19, 2009Kernel trick, first kernel algorithms37-49Homework 2
Feb 2, 2009Representer theorem, kernel PCA, kernel ridge regression Cancelled
Feb 9, 2009Representer theorem, kernel PCA50-72Homework 3xtrain.txt, ytrain.txt, xtest.txt, ytest.txt
Mar 2, 2009Kernel ridge regression, pattern recognition, SVM73-114No homework!
Mar 9, 2009SVM, Mercer kernel115-152Homework 4data.txt,labels.txt
Mar 16, 2009Mercer kernels, Green functions, Semigroup kernelsHomework 5
Mar 23, 2009Kernel for stringsHomework 6
Mar 30, 2009Kernels on graphs

Results

The final note will be an average of the homeworks.
Vert Jean-Philippe
Last modified: Wed May 28 12:01:55 CEST 2008