DeepAI AI Chat
Log In Sign Up

Relaxed Sparse Eigenvalue Conditions for Sparse Estimation via Non-convex Regularized Regression

by   Zheng Pan, et al.
Tsinghua University

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.


page 1

page 2

page 3

page 4


First Order Methods take Exponential Time to Converge to Global Minimizers of Non-Convex Functions

Machine learning algorithms typically perform optimization over a class ...

Lass-0: sparse non-convex regression by local search

We compute approximate solutions to L0 regularized linear regression usi...

A Unifying Framework of High-Dimensional Sparse Estimation with Difference-of-Convex (DC) Regularizations

Under the linear regression framework, we study the variable selection p...

Ultrahigh-dimensional Robust and Efficient Sparse Regression using Non-Concave Penalized Density Power Divergence

We propose a sparse regression method based on the non-concave penalized...

The basins of attraction of the global minimizers of the non-convex sparse spikes estimation problem

The sparse spike estimation problem consists in estimating a number of o...

A General Theory of Concave Regularization for High Dimensional Sparse Estimation Problems

Concave regularization methods provide natural procedures for sparse rec...

Regularized deep learning with a non-convex penalty

Regularization methods are often employed in deep learning neural networ...