Neural Network Pruning Denoises the Features and Makes Local Connectivity Emerge in Visual Tasks
Franco Pellegrini, Giulio Biroli
Abstract
Pruning methods can considerably reduce the size of artificial neural networks without harming their performance and in some cases they can even uncover sub-networks that, when trained in isolation, match or surpass the test accuracy of their dense counterparts. Here, we characterize the inductive bias that pruning imprints in such "winning lottery tickets": focusing on visual tasks, we analyze the architecture resulting from iterative magnitude pruning of a simple fully connected network. We show that the surviving node connectivity is local in input space, and organized in patterns reminiscent of the ones found in convolutional networks. We investigate the role played by data and tasks in shaping the architecture of the pruned sub-network. We find that pruning performances, and the ability to sift out the noise and make local features emerge improve by increasing the size of the training set, and the semantic value of the data. We also study different pruning procedures, and find that iterative magnitude pruning is particularly effective in distilling meaningful connectivity out of features present in the original task. Our results suggest the possibility to automatically discover new and efficient architectural inductive biases in other datasets and tasks.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 02dd4845-309f-4f09-b480-dfd1b51031f1Cited by top-tier papers2
- Understanding MLP-Mixer as a wide and sparse MLPTomohiro Hayase, Ryo KarakidaICML 2024 · 9 citations
- NTK-SAP: Improving neural network pruning by aligning training dynamicsYite Wang, Dawei Li, Ruoyu SunICLR 2023 · 2 citations
Builds on11
- Language Models are Few-Shot LearnersTom B. Brown, Benjamin Mann, Nick Ryder, Melanie Subbiah et al.NeurIPS 2020 · 64,255 citations
- MLP-Mixer: An all-MLP Architecture for VisionIlya O. Tolstikhin, Neil Houlsby, Alexander Kolesnikov, Lucas Beyer et al.NeurIPS 2021 · 3,862 citations
- Pruning neural networks without any data by iteratively conserving synaptic flowHidenori Tanaka, Daniel Kunin, Daniel L. K. Yamins, Surya GanguliNeurIPS 2020 · 884 citations
- Linear Mode Connectivity and the Lottery Ticket HypothesisJonathan Frankle, Gintare Karolina Dziugaite, Daniel M. Roy, Michael CarbinICML 2020 · 750 citations
- Picking Winning Tickets Before Training by Preserving Gradient FlowChaoqi Wang, Guodong Zhang, Roger B. GrosseICLR 2020 · 743 citations
Related papers
- Unmasking the Lottery Ticket Hypothesis: What's Encoded in a Winning Ticket's Mask?Mansheej Paul, Feng Chen, Brett W. Larsen, Jonathan Frankle et al.ICLR 2023 · 2 citations
- Rare Gems: Finding Lottery Tickets at InitializationKartik Sreenivasan, Jy-yong Sohn, Liu Yang, Matthew Grinde et al.NeurIPS 2022 · 52 citations
- Lottery Tickets on a Data Diet: Finding Initializations with Sparse Trainable NetworksMansheej Paul, Brett W. Larsen, Surya Ganguli, Jonathan Frankle et al.NeurIPS 2022 · 27 citations
- Efficient Lottery Ticket Finding: Less Data is MoreZhenyu Zhang, Xuxi Chen, Tianlong Chen, Zhangyang WangICML 2021 · 58 citations
- Winning Lottery Tickets in Deep Generative ModelsNeha Mukund Kalibhat, Yogesh Balaji, Soheil FeiziAAAI 2021 · 44 citations
