Efficient online algorithms for fast-rate regret bounds under sparsity

Open in new window