The Lasso problem and uniqueness (Q1951165)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	The Lasso problem and uniqueness	scientific article

Statements

scholarly article

0 references

The Lasso problem and uniqueness (English)

0 references

zbMATH Open document ID

0 references

10.1214/13-EJS815

0 references

Ryan J. Tibshirani

0 references

Electronic Journal of Statistics

0 references

publication date

29 May 2013

0 references

full work available at URL

https://arxiv.org/abs/1206.0313

0 references

https://projecteuclid.org/euclid.ejs/1369148600

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

zbMATH DE Number

0 references

zbMATH Keywords

Lasso

0 references

high-dimensional

0 references

uniqueness

0 references

LARS

0 references

describes a project that uses

0 references

MaRDI profile type

MaRDI publication profile

0 references

0 references

Simultaneous analysis of Lasso and Dantzig selector

0 references

Near-ideal model selection by \(\ell _{1}\) minimization

0 references

Atomic Decomposition by Basis Pursuit

0 references

For most large underdetermined systems of linear equations the minimal 𝓁<sub>1</sub>‐norm solution is also the sparsest solution

0 references

A necessary and sufficient condition for exact sparse recovery by \(\ell_1\) minimization

0 references

Least angle regression. (With discussion)

0 references

Recovery of Exact Sparse Representations in the Presence of Bounded Noise

0 references

Analysis of backtrack algorithms for listing all vertices and all faces of a convex polyhedron.

0 references

The Dantzig selector and sparsity oracle inequalities

0 references

Sparsity in penalized empirical risk minimization

0 references

A unified framework for high-dimensional analysis of \(M\)-estimators with decomposable regularizers

0 references

A new approach to variable selection in least squares problems

0 references

Convex Analysis

0 references

0 references

0 references

The solution path of the generalized lasso

0 references

Degrees of freedom in lasso problems

0 references

On the conditions used to prove oracle results for the Lasso

0 references

Sharp Thresholds for High-Dimensional and Noisy Sparsity Recovery Using $\ell _{1}$-Constrained Quadratic Programming (Lasso)

0 references

0 references

Regularization and Variable Selection Via the Elastic Net

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1951165

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1951165&oldid=35334100"