The aggregation problems in learning theory

Add to your list(s) Download to your calendar using vCal

• Guillaume Lecue, CNRS, Universite Paris-Est Marne-la-vallee
• Friday 18 November 2011, 16:00-17:00
• MR12, CMS, Wilberforce Road, Cambridge, CB3 0WB.

If you have a question about this talk, please contact Richard Samworth.

Given a finite class F of functions there are three aggregation problems: 1) the problem of Model Selection aggregation: construct a procedure having a risk as close as possible to the best element in F, 2) the problem of Convex aggregation: construct a procedure having a risk as close as possible to the best element in the convex hull of F, 3) the problem of Linear aggregation: construct a procedure having a risk as close as possible to the best element in the linear span of F.

We will prove that empirical risk minimization is optimal for the Convex and Linear aggregation problems but sub-optimal for the Model Selection aggregation problem. Then we will construct an optimal aggregation procedure for the Model Selection aggregation.

This talk is part of the Statistics series.

This talk is included in these lists:

• All CMS events
• All Talks (aka the CURE list)
• CMS Events
• Cambridge Forum of Science and Humanities
• Cambridge Language Sciences
• Cambridge talks
• Chris Davis' list
• DPMMS Lists
• DPMMS info aggregator
• DPMMS lists
• Guy Emerson's list
• Hanchen DaDaDash
• Interested Talks
• MR12, CMS, Wilberforce Road, Cambridge, CB3 0WB
• Machine Learning
• School of Physical Sciences
• Statistical Laboratory info aggregator
• Statistics
• Statistics Group
• bld31
• custom
• rp587

Note that ex-directory lists are not shown.