Efficient online algorithms for fast-rate regret bounds under sparsity

NeurIPS 2018 Pierre GaillardOlivier Wintenberger

We consider the online convex optimization problem. In the setting of arbitrary sequences and finite set of parameters, we establish a new fast-rate quantile regret bound... (read more)

PDF Abstract NeurIPS 2018 PDF NeurIPS 2018 Abstract


No code implementations yet. Submit your code now


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.

Methods used in the Paper

🤖 No Methods Found Help the community by adding them if they're not listed; e.g. Deep Residual Learning for Image Recognition uses ResNet