Results 271 to 280 of about 137,972 (308)
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nicolai Meinshausen
exaly +2 more sources
The lasso problem and uniqueness
The lasso is a popular tool for sparse linear regression, especially for problems in which the number of variables p exceeds the number of observations n. But when p > n, the lasso criterion is not strictly convex, and hence it may not have a unique minimum. An important question is: when is the lasso solution well-defined (unique)?
Ryan J Tibshirani
exaly +5 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Group lasso with overlap and graph lasso
Proceedings of the 26th Annual International Conference on Machine Learning, 2009We propose a new penalty function which, when used as regularization for empirical risk minimization procedures, leads to sparse estimators. The support of the sparse vector is typically a union of potentially overlapping groups of co-variates defined a priori, or a set of covariates which tend to be connected to each other when a graph of covariates ...
Laurent Jacob +2 more
openaire +1 more source
On the “degrees of freedom” of the lasso
We study the effective degrees of freedom of the lasso in the framework of Stein's unbiased risk estimation (SURE). We show that the number of nonzero coefficients is an unbiased estimate for the degrees of freedom of the lasso--a conclusion that requires no special assumption on the predictors.
Hui Zou +2 more
exaly +4 more sources
Proceedings of the AAAI Conference on Artificial Intelligence, 2013
Lasso-type variable selection has increasingly expanded its machine learning applications. In this paper, uncorrelated Lasso is proposed for variable selection, where variable de-correlation is considered simultaneously with variable selection, so that selected variables are uncorrelated as much as possible.
Sibao Chen 0001 +3 more
openaire +1 more source
Lasso-type variable selection has increasingly expanded its machine learning applications. In this paper, uncorrelated Lasso is proposed for variable selection, where variable de-correlation is considered simultaneously with variable selection, so that selected variables are uncorrelated as much as possible.
Sibao Chen 0001 +3 more
openaire +1 more source

