Theoretical Computer Science Spring School: Machine Learning / Ecole de Printemps d'Informatique Théorique : Apprentissage Automatique

Collection Theoretical Computer Science Spring School: Machine Learning / Ecole de Printemps d'Informatique Théorique : Apprentissage Automatique

Organizer(s) Cappé, Olivier ; Garivier, Aurélien ; Gribonval, Rémi ; Kaufmann, Emilie ; Vernade, Claire
Date(s) 23/05/2022 - 27/05/2022
linked URL https://conferences.cirm-math.fr/2542.html
00:00:00 / 00:00:00
1 5

In this tutorial I will discuss recent advances in theory of multi-armed bandits and reinforcement learning, in particular the upper confidence bound (UCB) and Thompson Sampling (TS) techniques for algorithm design and analysis.

Information about the video

Citation data

Last related questions on MathOverflow

You have to connect your Carmin.tv account with mathoverflow to add question

Ask a question on MathOverflow




Register

  • Bookmark videos
  • Add videos to see later &
    keep your browsing history
  • Comment with the scientific
    community
  • Get notification updates
    for your favorite subjects
Give feedback