Bubeck 2/9 - Some geometric aspects of randomized online decision making

Réalisation : 1 juillet 2019 Mise en ligne : 1 juillet 2019
  • document 1 document 2 document 3
  • niveau 1 niveau 2 niveau 3
  • audio 1 audio 2 audio 3

This course is concerned with some of the canonical non-stochastic models of online decision making. These models have their origin in works from the 1950's and 1960's, and went through a resurgence in the mid-2000's due to many applications in the internet economy. This course focuses on a set of challenging conjectures around these models from the 1980's and 1990's. We present a unified approach based on a combination of convex optimization techniques together with powerful probabilistic tools, which will allow us to derive state of the art results in online learning, bandit optimization, as well as some classical online computing problems (k-server and metrical task systems). Special emphasis are given to proper introduction of the mathematical/algorithmic tools: gradient descent, mirror descent (i.e., Riemannian gradient descent), probabilistic embedding of metric spaces, some basic results in convex geometry, etc.

Date de réalisation
Lieu de réalisation
École Normale Supérieure, Paris, France.
Langue :
Claire Boyer (Production), Djalil Chafaï (Production), Joseph Lehec (Production)
Conditions d'utilisation
Droit commun de la propriété intellectuelle
Citer cette ressource:
CEREMADE. (2019, 1 juillet). Bubeck 2/9 - Some geometric aspects of randomized online decision making. [Vidéo]. Canal-U. (Consultée le 22 janvier 2022)

Avec les mêmes intervenants

Sur le même thème