Interpretable Lightweight Transformer via Unrolling of Learned Graph Smoothness Priors
Tam Thuc Do, Parham Eftekhar, Seyed Alireza Hosseini, Gene Cheung,, Philip Chou

TL;DR
This paper introduces an interpretable, lightweight transformer-like neural network built by unrolling iterative optimization algorithms that minimize graph smoothness priors, resulting in a parameter-efficient model with competitive image interpolation performance.
Contribution
It proposes a novel unrolled network architecture that replaces traditional self-attention with shallow CNNs and graph smoothness priors, significantly reducing parameters while maintaining performance.
Findings
Outperforms conventional transformers in image interpolation tasks
Achieves high restoration quality with fewer parameters
Demonstrates robustness to covariate shift
Abstract
We build interpretable and lightweight transformer-like neural networks by unrolling iterative optimization algorithms that minimize graph smoothness priors -- the quadratic graph Laplacian regularizer (GLR) and the -norm graph total variation (GTV) -- subject to an interpolation constraint. The crucial insight is that a normalized signal-dependent graph learning module amounts to a variant of the basic self-attention mechanism in conventional transformers. Unlike "black-box" transformers that require learning of large key, query and value matrices to compute scaled dot products as affinities and subsequent output embeddings, resulting in huge parameter sets, our unrolled networks employ shallow CNNs to learn low-dimensional features per node to establish pairwise Mahalanobis distances and construct sparse similarity graphs. At each layer, given a learned graph, the target…
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.
Videos
Taxonomy
TopicsRough Sets and Fuzzy Logic · Neural Networks and Applications
