Past events

Haipeng Luo | Efficient Second Order Online Learning via Sketching

Our visitor Haipeng Luo from Princeton will talk about his latest work.

• iCal

Cristóbal Guzmán | Efficient Noise-Tolerant Learning from Statistical Queries ---- Michael Kearns

The first paper on the statistical query model.

• iCal

Nishant Mehta | Learnability, Stability and Uniform Convergence

• iCal

Tom Sterkenburg | Prequential randomness and probability ---- Vovk and Shen

I will start with an accessible introduction to the philosophical/historical background of the problem of defining a randomness notion for infinite outcome sequences. Then I will present the main result of this paper: the equivalence of two different ways -- following the game-theoretic and the measure-theoretic paradigm, respectively -- of defining the randomness of sequences of prediction-outcome pairs. If time permits, we might discuss in some more detail the prequential approach to probability, that motivated this paper.

• iCal

Wouter Koolen | On the Complexity of Best Arm Identification in Multi-Armed Bandit Models ---- Kaufmann, Cappé and Garivier

This will be the first meeting of the CWI ML reading group. We will look at best arm identification, a particular stochastic bandit problem. We will see what these problems are, how their complexity is defined and what bounds we can get from algorithms and hard cases. --- Wouter

• iCal

Machine Learning Reading Group goes live

Empty test event

• iCal