Tanvi S. Nayak

Improved Bounds For Online Convex Optimization

In this paper, we consider the problem of online learning with convex objectives. Most of the existing work shows that static and dynamic regrets scale logarithmically or sub-linearly with the time horizon T. On the contrary, for the strongly convex setting, it is shown that the static and dynamic r…