Optimistic lower bounds for convex regularized least-squares

arXiv1703.01332MaRDI QIDQ6283872FDOQ6283872

Authors: Pierre C. Bellec 

Publication date: 3 March 2017

Abstract: Minimax lower bounds are pessimistic in nature: for any given estimator, minimax lower bounds yield the existence of a worst-case target vector $$ for which the prediction error of the given estimator is bounded from below. However, minimax lower bounds shed no light on the prediction error of the given estimator for target vectors different than $$. A characterization of the prediction error of any convex regularized least-squares is given. This characterization provide both a lower bound and an upper bound on the prediction error. This produces lower bounds that are applicable for any target vector and not only for a single, worst-case $$. Finally, these lower and upper bounds on the prediction error are applied to the Lasso is sparse linear regression. We obtain a lower bound involving the compatibility constant for any tuning parameter, matching upper and lower bounds for the universal choice of the tuning parameter, and a lower bound for the Lasso with small tuning parameter.

This page was built for publication: Optimistic lower bounds for convex regularized least-squares

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6283872)