Fully Unconstrained Online Learning

Neural Information Processing Systems 

T is roughly linear in T. Thus, at a high level it matches the optimal bound in all cases in which one can achieve sublinear regret.