Efficient online algorithms for fast-rate regret bounds under sparsity

23 May 2018

Papers citing "Efficient online algorithms for fast-rate regret bounds under sparsity"

6 / 6 papers shown

Title
Introduction to Online Convex Optimization Elad Hazan OffRL 198 1,940 0 07 Sep 2019
Combining Adversarial Guarantees and Stochastic Fast Rates in Online Learning Wouter M. Koolen Peter Grünwald T. Erven 69 38 0 20 May 2016
Fast rates in statistical and online learning T. Erven Peter Grünwald Nishant A. Mehta Mark D. Reid Robert C. Williamson 199 109 0 09 Jul 2015
Online Nonparametric Regression with General Loss Functions Alexander Rakhlin Karthik Sridharan 58 34 0 26 Jan 2015
Lower bounds on the performance of polynomial-time algorithms for sparse linear regression Yuchen Zhang Martin J. Wainwright Michael I. Jordan 182 130 0 09 Feb 2014
Sparsity regret bounds for individual sequences in online linear regression Sébastien Gerchinovitz 227 108 0 05 Jan 2011