Bandits Games and Clustering Foundations

Sébastien Bubeck 1, 2, 3
2 SEQUEL - Sequential Learning
LIFL - Laboratoire d'Informatique Fondamentale de Lille, LAGIS - Laboratoire d'Automatique, Génie Informatique et Signal, Inria Lille - Nord Europe
Abstract : This thesis takes place within the machine learning theory. In particular it focuses on three sub-domains, stochastic optimization, online learning and clustering. These subjects exist for decades, but all have been recently studied under a new perspective. For instance, bandits games now offer a unified framework for stochastic optimization and online learning. This point of view results in many new extensions of the basic game. In the first part of this thesis, we focus on the mathematical study of these extensions (as well as the classical game). On the other hand, in the second part we discuss two important theoretical concepts for clustering, namely the consistency of algorithms and the stability as a tool for model selection.
Complete list of metadatas

Cited literature [129 references]  Display  Hide  Download

https://tel.archives-ouvertes.fr/tel-00845565
Contributor : Philippe Preux <>
Submitted on : Wednesday, July 17, 2013 - 1:51:04 PM
Last modification on : Thursday, February 21, 2019 - 10:52:49 AM
Long-term archiving on: Friday, October 18, 2013 - 4:24:13 AM

Identifiers

  • HAL Id : tel-00845565, version 1

Citation

Sébastien Bubeck. Bandits Games and Clustering Foundations. Statistics [math.ST]. Université des Sciences et Technologie de Lille - Lille I, 2010. English. ⟨tel-00845565⟩

Share

Metrics

Record views

996

Files downloads

1997