Programme

Read the
abstracts of plenary talks and posters
The slides are now available - please click on the title of the desired talk
Wednesday,          May 31
09:00 - 09:55 Registration and coffee-break
09:55 - 10:00 Opening remarks
10:00 - 10:50 Emmanuel Candes
The Dantzig Selector: Statistical Estimation when p is Larger than n
11:00 - 11:30 Coffee-break
11:30 - 12:20 Franck Barthe
About Talagrand's Concentration Inequality for Exponential Measures
12:30 - 14:30 Lunch break
14:30 - 15:20 Dean Foster
Deterministic Calibration and Nash Equilibrium
15:30 - 16:20 Neri Merhav
On Context-tree Prediction of Individual Sequences
16:30 - 17:00 Coffee-break
17:00 - 17:50 Peter Grünwald
Suboptimality of MDL and Bayes in Classification under Misspecification
18:00 - 19:30 Poster session        (check the abstracts at the end of this file)
19:30 - 21:30 Light welcoming buffet
   
   
Thursday, June 1
09:00 - 09:50 Ofer Zeitouni
A Correlation Inequality for Nonlinear Reconstruction
10:00 - 10:30 Coffee-break
10:30 - 11:20 Ehud Lehrer
Bayesian and Non-Bayesian Learning in Games
11:30 - 12:20 Ingo Steinwart
Learning from Dependent Observations
12:30 - 14:30 Lunch break
14:30 - 15:20 Z.D. Bai
Statistical Analysis for Rounding Data
15:30 - 16:20 Shie Mannor
An Isoperimetric Inequality with Applications to Learning
16:30 - 17:00 Coffee-break
   
   
Friday, June 2
09:00 - 09:50 John Shawe-Taylor
Statistical Analysis of Subspace Methods and Associated Learning Algorithms
10:00 - 10:30 Coffee-break
10:30 - 11:20 Tong Zhang
Theory and Algorithms for Large Scaling Ranking Problems
11:30 - 12:20 Vladimir Koltchinskii
Sparsity in High-Dimensional Learning Problems
12:30 - 14:30 Lunch break
14:30 - 15:20 Jean-Philippe Vert
Regularization of Kernel Methods by Decreasing the Bandwidth of the Gaussian Kernel
15:30 - 16:20 Nicolò Cesa-Bianchi
Learning and Randomization
16:30 - 17:00 Coffee-break
17:00 - 17:50 Vladimir Temlyakov
On Optimal and Universal Estimators in Learning Theory
   
   
Saturday, June 3
10:00 - 10:30 Coffee-break
10:30 - 12:00 Nathan Linial
Complexity of Sign Matrices and its Many Aspects
12:00 - 14:00 Buffet lunch
14:00 - 14:50 Nicolas Vayatis
Is There Life beyond the Classification Problem?
15:00 - 15:50 Peter Bartlett
Asymptotic Properties of Convex Optimization Methods for Multiclass Classification
16:00 - 17:00 Final coffee-break