A sharp nonasymptotic bound and phase diagram of L₁/2 regularization
From MaRDI portal
Publication:477827
Recommendations
- The essential ability of sparse reconstruction of different compressive sensing strategies
- Some sharp performance bounds for least squares regression with L₁ regularization
- A constrained optimization reformulation and a feasible descent direction method for \(L_{1/2}\) regularization
- An l₁-l_p DC regularization method for compressed sensing
- Optimality conditions for the \(L_{1/2}\) regularization problem and a descent method
Cites work
- Additive logistic regression: a statistical view of boosting. (With discussion and a rejoinder by the authors)
- Atomic decomposition by basis pursuit
- Compressed sensing
- Decoding by Linear Programming
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- Estimating the dimension of a model
- High-dimensional centrally symmetric polytopes with neighborliness proportional to dimension
- scientific article; zbMATH DE number 5957506 (Why is no real title available?)
- scientific article; zbMATH DE number 3444596 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- Least angle regression. (With discussion)
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- Nonconcave penalized likelihood with a diverging number of parameters.
- Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization
- Piecewise linear regularized solution paths
- Regularization and Variable Selection Via the Elastic Net
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
- Simultaneous analysis of Lasso and Dantzig selector
- Some sharp performance bounds for least squares regression with L₁ regularization
- The Adaptive Lasso and Its Oracle Properties
- The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder).
- The essential ability of sparse reconstruction of different compressive sensing strategies
- The sparsity and bias of the LASSO selection in high-dimensional linear regression
- Uncertainty principles and ideal atomic decomposition
Cited in
(5)- Bayesian joint inference for multivariate quantile regression model with \(L_{1/2}\) penalty
- Manifold optimization-based analysis dictionary learning with an \(\ell_{1/2}\)-norm regularizer
- The essential ability of sparse reconstruction of different compressive sensing strategies
- A constrained optimization reformulation and a feasible descent direction method for \(L_{1/2}\) regularization
- Some sharp performance bounds for least squares regression with L₁ regularization
This page was built for publication: A sharp nonasymptotic bound and phase diagram of \(L_{1/2}\) regularization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q477827)
