University of Cambridge > Talks.cam > Statistics > The aggregation problems in learning theory

  Browse A-Z

Log in

Googledetails Microsoftdetails

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

The aggregation problems in learning theory

Download to your calendar using vCal

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:

Note that ex-directory lists are not shown.

Other lists

Alison Richard Building, 7 West Road, ARB, 1st floor, room 138 LG19, The Law Faculty, 10 West Road, Cambridge CB3 9DZ Trinity College Cambridge public events

Other talks

FILM: One With The Whale Security Cooperation within Government and between Governments Rothschild Public Lecture: The Quantum Centenary: from Order to Chaos How Much Does Homology Really Know? Title to be confirmed Title to be confirmed
 

Š 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity