CS Forum: Prof François Laviolette, Laval University

2017-03-29 14:15:00 2017-03-29 15:00:00 Europe/Helsinki CS Forum: Prof François Laviolette, Laval University CS department's public guest lecture on 'Sparsity, interpretability and sample compression in Machine Learning: Application to omic data'. The lecture is open to everyone free-of-charge. http://old.cs.aalto.fi/en/midcom-permalink-1e70d57060cbb4e0d5711e7bf5643adc3c3de0dde0d Otakaari 2, 02150, Espoo

CS department's public guest lecture on 'Sparsity, interpretability and sample compression in Machine Learning: Application to omic data'. The lecture is open to everyone free-of-charge.

29.03.2017 / 14:15 - 15:00

3fb1dd3.jpeg

 

 

Speaker: Professor François Laviolette
Affiliation: Laval University, Quebec City, Canada
Host: Professor Juho Rousu
Time: 14:15 (coffee at 14:00)
Venue: A136 (T6), CS building

 

Sparsity, interpretability and sample compression in Machine Learning: Application to omic data

Abstract

We will investigate the Machine Learning subject called the Fat Data paradigm, a setting where the dimension of the feature space is much bigger than the number of training examples. This is a situation often encountered in data arising from life science. In such situations, there is a real risk of overfitting, even if one makes use of highly regularized learning algorithms. To overcome the lack of examples and even achieve good generalization performances, one solution consists in including prior knowledge of the domain into the learning algorithm. Another approach is to look for predictors that will be interpretable by experts in the domain, who in turn will help to validate the prediction.

The Set Covering Machine, introduced by Mario Marchand and John Shawe-Taylor more than a decade ago, is a learning algorithm that can be used to produce such interpretable predictors. We will present the original version of this algorithm together with a new one, specialized for genomic data. We will also show some results, based on the sample compression theory, that show why such a learning algorithm can alleviate overfitting, even in the fat data situation.

Bio

François Laviolette is a full Professor at the department of Computer Science and Software Engineering of Laval University. He received his doctorate in graph theory at the University of Montreal in 1995. His thesis solved an old problem that had been studied among others by the mathematician Paul Erdos. For over 10 years, his main area of research has been Machine Learning. More specifically, he develops learning algorithms to solve new types of learning problems, including problems relating to genomics and proteomics. He is currently the director of the new Big Data Research Center at Laval University.

**

Prof. Francois Laviolette acts as  the opponent in Mr. Huibin Shen’s PhD defence on March 30, 2017.

Prof. Laviolette visits the KEPACO research group the week of March 27-April 1. He will be avalable for discussion (contact Juho Rousu to set up a meeting).