Time-uniform concentration inequalities: Peeling, Mixture, and their application to Bandit problems.

In this talk, I will first discuss concentration inequalities that hold uniformly over time, and more specifically peeling and mixture techniques. I will then highlight some intriguing results. I will then present illustration and extension of these techniques in three application domains: bandits, change-point, and MDP learning.