We derive the degrees of freedom of the lasso fit, placing no assumptions on the predictor matrix X. Like the well-known result of Zou, Hastie and Tibshirani [Ann. Statist. 35 (2007) 2173–2192], which gives the degrees of freedom of the lasso fit when X has full column rank, we express our result in terms of the active set of a lasso solution. We extend this result to cover the degrees of freedom of the generalized lasso fit for an arbitrary predictor matrix X (and an arbitrary penalty matrix D). Though our focus is degrees of freedom, we establish some intermediate results on the lasso and generalized lasso that may be interesting on their own.</p
This paper studies the sensitivity to the observations of the block/group Lasso solution to an overd...
This paper studies the sensitivity to the observations of the block/group Lasso solution to an overd...
In this paper, we are concerned with regression problems where covariates can be grouped in nonoverl...
In this paper, we investigate the degrees of freedom ($\dof$) of penalized $\ell_1$ minimization (al...
Previously entitled "The degrees of freedom of penalized l1 minimization"International audienceIn th...
Previously entitled "The degrees of freedom of penalized l1 minimization"International audienceIn th...
In this paper, we investigate the degrees of freedom ($\dof$) of penalized $\ell_1$ minimization (al...
In this paper, we investigate the degrees of freedom (df) of penalized l1 minimization (also known a...
In this paper, we investigate the degrees of freedom (df) of penalized `1 minimization (also known ...
International audienceIn this paper, we investigate the degrees of freedom (df) of penalized l1 mini...
International audienceIn this paper, we investigate the degrees of freedom (df) of penalized l1 mini...
We study the degrees of freedom of the Lasso in the framework of Stein's unbiased risk estimati...
International audienceThis paper studies the sensitivity to the observations of the block/group Lass...
International audienceThis paper studies the sensitivity to the observations of the block/group Lass...
We present a path algorithm for the generalized lasso problem. This problem penalizes the `1 norm of...
This paper studies the sensitivity to the observations of the block/group Lasso solution to an overd...
This paper studies the sensitivity to the observations of the block/group Lasso solution to an overd...
In this paper, we are concerned with regression problems where covariates can be grouped in nonoverl...
In this paper, we investigate the degrees of freedom ($\dof$) of penalized $\ell_1$ minimization (al...
Previously entitled "The degrees of freedom of penalized l1 minimization"International audienceIn th...
Previously entitled "The degrees of freedom of penalized l1 minimization"International audienceIn th...
In this paper, we investigate the degrees of freedom ($\dof$) of penalized $\ell_1$ minimization (al...
In this paper, we investigate the degrees of freedom (df) of penalized l1 minimization (also known a...
In this paper, we investigate the degrees of freedom (df) of penalized `1 minimization (also known ...
International audienceIn this paper, we investigate the degrees of freedom (df) of penalized l1 mini...
International audienceIn this paper, we investigate the degrees of freedom (df) of penalized l1 mini...
We study the degrees of freedom of the Lasso in the framework of Stein's unbiased risk estimati...
International audienceThis paper studies the sensitivity to the observations of the block/group Lass...
International audienceThis paper studies the sensitivity to the observations of the block/group Lass...
We present a path algorithm for the generalized lasso problem. This problem penalizes the `1 norm of...
This paper studies the sensitivity to the observations of the block/group Lasso solution to an overd...
This paper studies the sensitivity to the observations of the block/group Lasso solution to an overd...
In this paper, we are concerned with regression problems where covariates can be grouped in nonoverl...