Relaxed Sparse Eigenvalue Conditions for Sparse Estimation via Non-convex Regularized Regression
Non-convex regularizers usually improve the performance of sparse estimation in practice. To prove this fact, we study the conditions of sparse estimations for the sharp concave regularizers which are a general family of non-convex regularizers including many existing regularizers. For the global solutions of the regularized regression, our sparse eigenvalue based conditions are weaker than that of L1-regularization for parameter estimation and sparseness estimation. For the approximate global and approximate stationary (AGAS) solutions, almost the same conditions are also enough. We show that the desired AGAS solutions can be obtained by coordinate descent (CD) based methods. Finally, we perform some experiments to show the performance of CD methods on giving AGAS solutions and the degree of weakness of the estimation conditions required by the sharp concave regularizers.
Code (0)
등록된 구현이 없습니다.
Tasks
parameter estimationregressionSimilar Papers 제목 키워드 기반
Absolute Eigenvalues-Based Covariance Matrix Estimation for a Sparse Array
The ensemble covariance matrix of a wide sense stationary signal spatially sampled by a full linear array is positive semi-definite and Toeplitz. However, the direct augmented covariance matrix of an augmentable sparse a…
Sparse estimation via $\ell_q$ optimization method in high-dimensional linear regression
In this paper, we discuss the statistical properties of the $\ell_q$ optimization methods $(0<q\leq 1)$, including the $\ell_q$ minimization method and the $\ell_q$ regularization method, for estimating a sparse paramete…
regressionVocal Bursts Intensity PredictionThresholding Procedures for High Dimensional Variable Selection and Statistical Estimation
Given $n$ noisy samples with $p$ dimensions, where $n \ll p$, we show that the multi-stage thresholding procedures can accurately estimate a sparse vector $\beta \in \R^p$ in a linear model, under the restricted eigenval…
Model SelectionVariable SelectionVocal Bursts Intensity PredictionEigenmatrix for unstructured sparse recovery
This note considers the unstructured sparse recovery problems in a general form. Examples include rational approximation, spectral function estimation, Fourier inversion, Laplace inversion, and sparse deconvolution. The …
Exact Recovery of Hard Thresholding Pursuit
The Hard Thresholding Pursuit (HTP) is a class of truncated gradient descent methods for finding sparse solutions of $\ell_0$-constrained loss minimization problems. The HTP-style methods have been shown to have strong a…
parameter estimation