Statistics – Machine Learning
Scientific paper
2011-01-05
Statistics
Machine Learning
No. RR-7504 (2011)
Scientific paper
We consider the problem of online linear regression on arbitrary deterministic sequences when the ambient dimension d can be much larger than the number of time rounds T. We introduce the notion of sparsity regret bound, which is a deterministic online counterpart of recent risk bounds derived in the stochastic setting under a sparsity scenario. We prove such regret bounds for an online-learning algorithm called SeqSEW and based on exponential weighting and data-driven truncation. In a second part we apply a parameter-free version of this algorithm to the stochastic setting (regression model with random design). This yields risk bounds of the same flavor as in Dalalyan and Tsybakov (2011) but which solve two questions left open therein. In particular our risk bounds are adaptive (up to a logarithmic factor) to the unknown variance of the noise if the latter is Gaussian. We also address the regression model with fixed design.
No associations
LandOfFree
Sparsity regret bounds for individual sequences in online linear regression does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Sparsity regret bounds for individual sequences in online linear regression, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Sparsity regret bounds for individual sequences in online linear regression will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-267623