%0 Journal Article %1 noauthororeditor %A Gaillard, Pierre %A Wintenberger, Olivier %D 2018 %K bounds online-learning sparsity theory %T Efficient online algorithms for fast-rate regret bounds under sparsity %U https://papers.nips.cc/paper/7934-efficient-online-algorithms-for-fast-rate-regret-bounds-under-sparsity.pdf

@article{noauthororeditor, added-at = {2019-04-25T12:50:06.000+0200}, author = {Gaillard, Pierre and Wintenberger, Olivier}, biburl = {https://www.bibsonomy.org/bibtex/2495c02e311acf3efe3349a3638312b8f/kirk86}, description = {Efficient online algorithms for fast-rate regret bounds under sparsity}, interhash = {50f15a83e6e1308b6a18302d433d42eb}, intrahash = {495c02e311acf3efe3349a3638312b8f}, keywords = {bounds online-learning sparsity theory}, timestamp = {2019-04-25T12:50:06.000+0200}, title = {Efficient online algorithms for fast-rate regret bounds under sparsity}, url = {https://papers.nips.cc/paper/7934-efficient-online-algorithms-for-fast-rate-regret-bounds-under-sparsity.pdf}, year = 2018 }