Improved Strongly Adaptive Online Learning using Coin Betting

14 Oct 2016  ·  Kwang-Sung Jun, Francesco Orabona, Rebecca Willett, Stephen Wright ·

This paper describes a new parameter-free online learning algorithm for changing environments. In comparing against algorithms with the same time complexity as ours, we obtain a strongly adaptive regret bound that is a factor of at least $\sqrt{\log(T)}$ better, where $T$ is the time horizon... Empirical results show that our algorithm outperforms state-of-the-art methods in learning with expert advice and metric learning scenarios. read more

PDF Abstract
No code implementations yet. Submit your code now


  Add Datasets introduced or used in this paper

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.


No methods listed for this paper. Add relevant methods here