Unconstrained Online Linear Learning in Hilbert Spaces: Minimax Algorithms and Normal Approximations

3 Mar 2014H. Brendan McMahanFrancesco Orabona

We study algorithms for online linear optimization in Hilbert spaces, focusing on the case where the player is unconstrained. We develop a novel characterization of a large class of minimax algorithms, recovering, and even improving, several previous results as immediate corollaries... (read more)

PDF Abstract

Code


No code implementations yet. Submit your code now

Tasks


Results from the Paper


  Submit results from this paper to get state-of-the-art GitHub badges and help the community compare results to other papers.