Online nonparametric regression with adversarial data

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

• Pierre Gaillard (INRIA Paris)
• Friday 27 October 2017, 16:00-17:00
• MR12.

If you have a question about this talk, please contact Quentin Berthet.

In this talk, I will consider the problem of online nonparametric regression with arbitrary deterministic sequences. Using ideas from the chaining technique, I will design an algorithm that achieves a Dudley-type regret bound similar to the one obtained in a non-constructive fashion by Rakhlin and Sridharan (2014). The regret bound is expressed in terms of the metric entropy in the sup norm, which yields optimal guarantees when the metric and sequential entropies are of the same order of magnitude. In particular the algorithm is the first one that achieves optimal rates for online regression over Hölder balls.

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
• Machine Learning
• School of Physical Sciences
• Statistical Laboratory info aggregator
• Statistics
• Statistics Group
• bld31
• custom
• rp587

Note that ex-directory lists are not shown.