June 16, 2008
13:50-14:35	Sanjoy Dasgupta	Random projection trees and low-dimensional manifolds (semiplenary talk)
14:40-15:25	Sasha Rakhlin	Online learning with limited feedback
15:30-16:00	Coffee break
16:00-16:45	Adam Klivans	Efficient algorithms for agnostic learning
16:50-17:35	Mihail Belkin	Spectral and geometric methods in learning
June 17, 2008
13:50-14:35	Ding-Xuan Zhou	Analysis of some learning algorithms with Gaussians
14:40-15:25	Massi Pontil	Spectral regularization for transfer learning
15:30-16:00	Coffee break
16:00-16:45	Mehryar Mohri	Learning to rank with Quicksort (semiplenary talk)
16:50-17:35	Andrea Caponnetto	Properties of regularization operators in learning theory
June 18, 2008
13:50-14:35	Sham Kakade	On the complexity of linear prediction: risk bounds, margin bounds, and regularization
14:40-15:25	Peter Auer	Analysis of optimistic algorithms for the exploration/exploitation trade-off (semiplenary talk)
15:30-16:00	Coffee break
16:00-16:45	Ingo Steinwart	Estimating conditional quantiles
16:50-17:35	Claudio Gentile	Linear algorithms for on-line multitask/multiview learning