Convex Sparse Matrix Factorizations

Details Convex Sparse Matrix Factorizations Convex Sparse Matrix Factorizations

2008-12-10

arxiv.org/abs/0812.1869v1

Computer Science

Learning

Scientific paper

We present a convex formulation of dictionary learning for sparse signal decomposition. Convexity is obtained by replacing the usual explicit upper bound on the dictionary size by a convex rank-reducing term similar to the trace norm. In particular, our formulation introduces an explicit trade-off between size and sparsity of the decomposition of rectangular matrices. Using a large set of synthetic examples, we compare the estimation abilities of the convex and non-convex approaches, showing that while the convex formulation has a single local minimum, this may lead in some cases to performance which is inferior to the local minima of the non-convex formulation.

Affiliated with

Also associated with

No associations

Rating

Convex Sparse Matrix Factorizations 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 Convex Sparse Matrix Factorizations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Convex Sparse Matrix Factorizations will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-527379