You are here: Home / Papers

Suggested Papers

Coin Betting and Parameter-Free Online Learning ---- Francesco Orabona, Dávid Pál

Connections between coin betting and online learning. There are links to Universal Coding and to Game Theoretic Probability (Shafer-Vovk)

Coin Betting and Parameter-Free Online Learning ---- Francesco Orabona, Dávid Pál - Read More…

Regret Minimization in Games with Incomplete Information ---- M. Zinkevich, M. Bowling, M. Johanson, C. Piccione.

This paper discusses using online learning methods for solving incomplete information games (like poker where you do not see the other players' cards). The method used (Regret Matching) is not quite the standard algorithm (Hedge) and I'd like to understand its advantage.

Regret Minimization in Games with Incomplete Information ---- M. Zinkevich, M. Bowling, M. Johanson, C. Piccione. - Read More…

No more pesky learning rates ---- Tom Schaul, Sixin Zhang, Yann LeCun

A chunk of research at CWI is devoted to learning the learning rate. So I am curious how this paper relates.

No more pesky learning rates ---- Tom Schaul, Sixin Zhang, Yann LeCun - Read More…

Sparse Adaptive Dirichlet-Multinomial-like Processes ---- Marcus Hutter

This paper is about predicting when the alphabet size is not known. Key ingredient is estimating the "escape probability" of an as-of-yet unseen symbol appearing. This is especially interesting to compare with the Good-Turing work of Orlitsky et al.

Sparse Adaptive Dirichlet-Multinomial-like Processes ---- Marcus Hutter - Read More…

Competitive Distribution Estimation: Why is Good-Turing Good ---- Alon Orlitsky and Ananda Theertha Suresh

I would love to understand the connection between Good-Turing and learning the alphabet size (i.e. paper by Hutter). Both are about estimating the probability of observing a yet unseen symbol.

Competitive Distribution Estimation: Why is Good-Turing Good ---- Alon Orlitsky and Ananda Theertha Suresh - Read More…