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:
CoRR (2022)
Keyphrases
</>
regret bounds
online convex optimization
online learning
long run
convex optimization
lower bound
cost function
linear regression
newton method
efficient algorithms for solving
upper bound
bregman divergences
least squares
objective function
state space