- Date de réalisation : 2 Juillet 2019
- Lieu de réalisation : École Normale Supérieure, Paris, France.
- Durée du programme : 56 min
- Classification Dewey : Probabilités et mathématiques appliquées, Prise de décision et gestion de l'information, Algorithmes, Mathématiques
- Auteur(s) : Bubeck Sébastien
- producteur : Boyer Claire, Chafaï Djalil, Lehec Joseph
Dans la même collectionTropp 9/9 - Random matrix theory and computational linear algebra Tropp 8/9 - Random matrix theory and computational linear algebra Carpentier - Introduction to some problems of composite and minimax hypothesis testing Tropp 7/9 - Random matrix theory and computational linear algebra Tropp 6/9 - Random matrix theory and computational linear algebra Bubeck 9/9 - Some geometric aspects of randomized online decision making
Bubeck 4/9 - Some geometric aspects of randomized online decision making
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.