Network Flow Algorithms for Structured Sparsity

Details Network Flow Algorithms for Structured Sparsity Network Flow Algorithms for Structured Sparsity

2010-08-31

arxiv.org/abs/1008.5209v1

Computer Science

Learning

accepted for publication in Adv. Neural Information Processing Systems, 2010

Scientific paper

We consider a class of learning problems that involve a structured sparsity-inducing norm defined as the sum of $\ell_\infty$-norms over groups of variables. Whereas a lot of effort has been put in developing fast optimization methods when the groups are disjoint or embedded in a specific hierarchical structure, we address here the case of general overlapping groups. To this end, we show that the corresponding optimization problem is related to network flow optimization. More precisely, the proximal problem associated with the norm we consider is dual to a quadratic min-cost flow problem. We propose an efficient procedure which computes its solution exactly in polynomial time. Our algorithm scales up to millions of variables, and opens up a whole new range of applications for structured sparse models. We present several experiments on image and video data, demonstrating the applicability and scalability of our approach for various problems.

Affiliated with

Also associated with

No associations

Rating

Network Flow Algorithms for Structured Sparsity 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 Network Flow Algorithms for Structured Sparsity, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Network Flow Algorithms for Structured Sparsity will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-179452