Generalized Thresholding Sparsity-Aware Online Learning in a Union of Subspaces

Details Generalized Thresholding Sparsity-Aware Online Learning in a Union of Subspaces Generalized Thresholding Sparsity-Aware Online Learning in a Union of Subspaces

2011-12-03

arxiv.org/abs/1112.0665v2

Computer Science

Information Theory

Scientific paper

This paper studies a non-convexly constrained, sparse inverse problem in time-varying environments from a set theoretic estimation perspective. A new theory is developed that allows for the incorporation, in a unifying way, of different thresholding rules to promote sparsity, that may be even related to non-convex penalty functions. The resulted generalized thresholding operator is embodied in an efficient online, sparsity-aware learning scheme. The algorithm is of low computational complexity exhibiting a linear dependence on the number of free parameters. A convergence analysis of the proposed algorithm is conducted, and extensive experiments are also exhibited in order to validate the novel methodology.

Affiliated with

Also associated with

No associations

Rating

Generalized Thresholding Sparsity-Aware Online Learning in a Union of Subspaces 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 Generalized Thresholding Sparsity-Aware Online Learning in a Union of Subspaces, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Generalized Thresholding Sparsity-Aware Online Learning in a Union of Subspaces will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-698254