Minimizing Regret in Unconstrained Online Convex Optimization.

Tatiana Tatarenko Maryam Kamgarpour

Published in: ECC (2018)

Keyphrases

online convex optimization
online learning
long run
convex optimization
newton method
cost function
efficient algorithms for solving
regret bounds
sensitivity analysis
least squares
upper bound
linear equations
optimality conditions