Relaxed sparse eigenvalue conditions for sparse estimation via non-convex regularized regression
From MaRDI portal
Cites work
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A general theory of concave regularization for high-dimensional sparse estimation problems
- A Probabilistic and RIPless Theory of Compressed Sensing
- A unified framework for high-dimensional analysis of M-estimators with decomposable regularizers
- Adaptive Lasso for sparse high-dimensional regression models
- Analysis of multi-stage convex relaxation for sparse regularization
- Atomic Decomposition by Basis Pursuit
- Coordinate descent algorithms for nonconvex penalized regression, with applications to biological feature selection
- Decoding by Linear Programming
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- Likelihood-based selection and sharp parameter estimation
- Multi-stage convex relaxation for feature selection
- Nearly unbiased variable selection under minimax concave penalty
- On constrained and regularized high-dimensional regression
- On Recovery of Sparse Signals Via $\ell _{1}$ Minimization
- Rate minimaxity of the Lasso and Dantzig selector for the \(l_{q}\) loss in \(l_{r}\) balls
- Relaxed Conditions for Sparse Signal Recovery With General Concave Priors
- Restricted Isometry Constants Where $\ell ^{p}$ Sparse Recovery Can Fail for $0≪ p \leq 1$
- Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
- Simultaneous analysis of Lasso and Dantzig selector
- Sparse Recovery With Orthogonal Matching Pursuit Under RIP
- SparseNet: coordinate descent with nonconvex penalties
- Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
- The Adaptive Lasso and Its Oracle Properties
- The Dantzig selector and sparsity oracle inequalities
- The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder).
- Variable selection using MM algorithms
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
Cited in
(8)- Weak fault detection of tapered rolling bearing based on penalty regularization approach
- Bias versus non-convexity in compressed sensing
- Weaker regularity conditions and sparse recovery in high-dimensional regression
- Non-negative least squares for high-dimensional linear models: consistency and sparse recovery without regularization
- Nonbifurcating Phylogenetic Tree Inference via the Adaptive LASSO
- An unbiased approach to compressed sensing
- A theoretical understanding of self-paced learning
- A perturbation inequality for concave functions of singular values and its applications in low-rank matrix recovery
This page was built for publication: Relaxed sparse eigenvalue conditions for sparse estimation via non-convex regularized regression
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1677029)
