NIPS Proceedingsβ

Pierre Gaillard

3 Papers

  • Efficient online learning with kernels for adversarial large scale problems (2019)
  • Efficient online algorithms for fast-rate regret bounds under sparsity (2018)
  • Mirror Descent Meets Fixed Share (and feels no regret) (2012)