Relaxed sparse eigenvalue conditions for sparse estimation via non-convex regularized regression
From MaRDI portal
Publication:1677029
DOI10.1016/j.patcog.2014.06.018OpenAlexW2963088180MaRDI QIDQ1677029
Publication date: 10 November 2017
Published in: Pattern Recognition (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1306.3343
Related Items (6)
Bias versus non-convexity in compressed sensing ⋮ A perturbation inequality for concave functions of singular values and its applications in low-rank matrix recovery ⋮ Weak fault detection of tapered rolling bearing based on penalty regularization approach ⋮ An unbiased approach to compressed sensing ⋮ A theoretical understanding of self-paced learning ⋮ Nonbifurcating Phylogenetic Tree Inference via the Adaptive LASSO
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Coordinate descent algorithms for nonconvex penalized regression, with applications to biological feature selection
- Nearly unbiased variable selection under minimax concave penalty
- The Adaptive Lasso and Its Oracle Properties
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- On constrained and regularized high-dimensional regression
- The Dantzig selector and sparsity oracle inequalities
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
- Simultaneous analysis of Lasso and Dantzig selector
- Multi-stage convex relaxation for feature selection
- The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder).
- Variable selection using MM algorithms
- SparseNet: Coordinate Descent With Nonconvex Penalties
- Decoding by Linear Programming
- Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
- Atomic Decomposition by Basis Pursuit
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- Relaxed Conditions for Sparse Signal Recovery With General Concave Priors
- Likelihood-Based Selection and Sharp Parameter Estimation
- Restricted Isometry Constants Where $\ell ^{p}$ Sparse Recovery Can Fail for $0≪ p \leq 1$
- On Recovery of Sparse Signals Via $\ell _{1}$ Minimization
- A Probabilistic and RIPless Theory of Compressed Sensing
- Sparse Recovery With Orthogonal Matching Pursuit Under RIP
- A unified framework for high-dimensional analysis of \(M\)-estimators with decomposable regularizers
- A general theory of concave regularization for high-dimensional sparse estimation problems
This page was built for publication: Relaxed sparse eigenvalue conditions for sparse estimation via non-convex regularized regression
