Pierre Gaillard – Online nonparametric regression with adversarial data. Quand 4 décembre 2017 Ajouter au Calendrier Télécharger ICS Calendrier Google iCalendar Office 365 Outlook Live 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. The algorithm is the first one that achieves optimal rates for online regression over Hölder balls. We will also investigate if we can apply the same technique to other problems by changing the feedback (bandit feedback, ) or the loss function.[
