Multi-stage Convex Relaxation for Feature Selection

Details Multi-stage Convex Relaxation for Feature Selection Multi-stage Convex Relaxation for Feature Selection

2011-06-03

arxiv.org/abs/1106.0565v2

Statistics

Machine Learning

Scientific paper

A number of recent work studied the effectiveness of feature selection using Lasso. It is known that under the restricted isometry properties (RIP), Lasso does not generally lead to the exact recovery of the set of nonzero coefficients, due to the looseness of convex relaxation. This paper considers the feature selection property of nonconvex regularization, where the solution is given by a multi-stage convex relaxation scheme. Under appropriate conditions, we show that the local solution obtained by this procedure recovers the set of nonzero coefficients without suffering from the bias of Lasso relaxation, which complements parameter estimation results of this procedure.

Affiliated with

Also associated with

No associations

Rating

Multi-stage Convex Relaxation for Feature Selection does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Multi-stage Convex Relaxation for Feature Selection, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Multi-stage Convex Relaxation for Feature Selection will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-223281