Login / Signup
Between Stochastic and Adversarial Online Convex Optimization: Improved Regret Bounds via Smoothness.
Sarah Sachs
Hédi Hadiji
Tim van Erven
Cristóbal Guzmán
Published in:
NeurIPS (2022)
Keyphrases
</>
regret bounds
online convex optimization
online learning
long run
convex optimization
cost function
linear regression
lower bound
upper bound
newton method
bregman divergences