mlsanityData to 7 Oct 2026

On the prediction loss of the lasso in the partially labeled setting

arXiv 1606.06179 ↗First posted 20 Jun 2016math.ST stat.ML stat.THcited by 3

Not on the map. Why?

Abstract (arXiv)

In this paper we revisit the risk bounds of the lasso estimator in the context of transductive and semi-supervised learning. In other terms, the setting under consideration is that of regression with random design under partial labeling. The main goal is to obtain user-friendly bounds on the off-sample prediction risk. To this end, the simple setting of bounded response variable and bounded (high-dimensional) covariates is considered. We propose some new adaptations of the lasso to these settings and establish oracle inequalities both in expectation and in deviation. These results provide non-asymptotic upper bounds on the risk that highlight the interplay between the bias due to the mis-specification of the linear model, the bias due to the approximate sparsity and the variance. They also demonstrate that the presence of a large number of unlabeled features may have significant positive impact in the situations where the restricted eigenvalue of the design matrix vanishes or is very small.

Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). First posted on arXiv 20 Jun 2016.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2021: 1; 2022: 0; 2023: 1; 2024: 1.

3 papers.