(PASS) Visual Prompt Locates Good Structure Sparsity through a Recurrent HyperNetwork
Tianjin Huang, Fang Meng, Li Shen, Fan Liu, Yulong Pei, Mykola Pechenizkiy, Shiwei Liu, Tianlong Chen

TL;DR
This paper introduces PASS, a hyper-network framework that uses visual prompts to identify effective channel sparsity in neural networks, enhancing efficiency and accuracy across various architectures and datasets.
Contribution
PASS is a novel recurrent hyper-network that leverages visual prompts and weight statistics to determine layer-wise channel sparsity, considering layer dependencies.
Findings
PASS achieves 1-3% better accuracy at the same FLOPs on Food101.
PASS subnetworks are 0.35x faster with similar accuracy compared to baselines.
Demonstrates superior performance across multiple architectures and datasets.
Abstract
Large-scale neural networks have demonstrated remarkable performance in different domains like vision and language processing, although at the cost of massive computation resources. As illustrated by compression literature, structural model pruning is a prominent algorithm to encourage model efficiency, thanks to its acceleration-friendly sparsity patterns. One of the key questions of structural pruning is how to estimate the channel significance. In parallel, work on data-centric AI has shown that prompting-based techniques enable impressive generalization of large language models across diverse downstream tasks. In this paper, we investigate a charming possibility - \textit{leveraging visual prompts to capture the channel importance and derive high-quality structural sparsity}. To this end, we propose a novel algorithmic framework, namely \texttt{PASS}. It is a tailored hyper-network…
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
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
MethodsPruning
