Login / Signup
Efficient online algorithms for fast-rate regret bounds under sparsity.
Pierre Gaillard
Olivier Wintenberger
Published in:
NeurIPS (2018)
Keyphrases
</>
online algorithms
online learning
machine learning
lower bound
high dimensional
special case
linear space