TL;DR
The paper introduces Frank-Wolfe Network (F-W Net), an interpretable deep architecture inspired by the Frank-Wolfe algorithm for non-sparse $L_p$-norm constrained coding, with learnable $p$ and applications in image processing.
Contribution
It proposes a novel deep network architecture based on unrolling the Frank-Wolfe algorithm for $L_p$-norm constrained coding, including a learnable $p$ parameter and a convolutional variant for image tasks.
Findings
F-W Net effectively solves non-sparse coding problems.
The learnable $p$ parameter enhances flexibility and performance.
F-W Net performs well in digit recognition, denoising, and super-resolution.
Abstract
The problem of -norm constrained coding is to convert signal into code that lies inside an -ball and most faithfully reconstructs the signal. Previous works under the name of sparse coding considered the cases of and norms. The cases with values, i.e. non-sparse coding studied in this paper, remain a difficulty. We propose an interpretable deep structure namely Frank-Wolfe Network (F-W Net), whose architecture is inspired by unrolling and truncating the Frank-Wolfe algorithm for solving an -norm constrained problem with . We show that the Frank-Wolfe solver for the -norm constraint leads to a novel closed-form nonlinear unit, which is parameterized by and termed . The unit links the conventional pooling, activation, and normalization operations, making F-W Net distinct from existing deep networks either heuristically…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
