On the Conditions of Sparse Parameter Estimation via Log-Sum Penalty Regularization
arXiv:1308.6504
Abstract
For high-dimensional sparse parameter estimation problems, Log-Sum Penalty (LSP) regularization effectively reduces the sampling sizes in practice. However, it still lacks theoretical analysis to support the experience from previous empirical study. The analysis of this article shows that, like -regularization, sampling size is enough for proper LSP, where is the non-zero components of the true parameter. We also propose an efficient algorithm to solve LSP regularization problem. The solutions given by the proposed algorithm give consistent parameter estimations under less restrictive conditions than -regularization.
arXiv commentThis paper has been withdrawn by the author due to an error in the the proof of Theorem 1
References in corpus (6)
- Nearly unbiased variable selection under minimax concave penalty
- Simultaneous analysis of Lasso and Dantzig selector
- A General Iterative Shrinkage and Thresholding Algorithm for Non-convex Regularized Optimization Problems
- Enhanced imaging of microcalcifications in digital breast tomosynthesis through improved image-reconstruction algorithms
- Regularized M-estimators with nonconvexity: Statistical and algorithmic theory for local optima
- A General Framework of Dual Certificate Analysis for Structured Sparse Recovery Problems