In this paper, we propose an online convex optimization method with two
different levels of adaptivity. On a higher level, our method is agnostic to
the specific type and curvature of the loss functions, while at a lower level,
it can exploit the niceness of the environments and attain