NIPS Proceedings^β

Pierre Gaillard

2 Papers

Efficient online algorithms for fast-rate regret bounds under sparsity (2018)

Mirror Descent Meets Fixed Share (and feels no regret) (2012)