Efficient online algorithms for fast-rate regret bounds under sparsity