Finding trainable sparse networks through Neural Tangent Transfer
Tianlin Liu, Friedemann Zenke
Abstract
Deep neural networks have dramatically transformed machine learning, but their memory and energy demands are substantial. The requirements of real biological neural networks are rather modest in comparison, and one feature that might underlie this austerity is their sparse connectivity. In deep learning, trainable sparse networks that perform well on a specific task are usually constructed using label-dependent pruning criteria. In this article, we introduce Neural Tangent Transfer, a method that instead finds trainable sparse networks in a label-free manner. Specifically, we find sparse networks whose training dynamics, as characterized by the neural tangent kernel, mimic those of dense networks in function space. Finally, we evaluate our label-agnostic approach on several standard classification tasks and show that the resulting sparse networks achieve higher classification performance while converging faster.
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 7a469d89-17cc-450b-9e92-bc8bf924d913Cited by top-tier papers15
- Pruning Neural Networks at Initialization: Why Are We Missing the Mark?Jonathan Frankle, Gintare Karolina Dziugaite, Daniel M. Roy, Michael CarbinICLR 2021 · 261 citations
- Sparse Training via Boosting Pruning Plasticity with NeuroregenerationShiwei Liu, Tianlong Chen, Xiaohan Chen, Zahra Atashgahi et al.NeurIPS 2021 · 145 citations
- The Unreasonable Effectiveness of Random Pruning: Return of the Most Naive Baseline for Sparse TrainingShiwei Liu, Tianlong Chen, Xiaohan Chen, Li Shen et al.ICLR 2022 · 141 citations
- Monarch: Expressive Structured Matrices for Efficient and Accurate TrainingTri Dao, Beidi Chen, Nimit Sharad Sohoni, Arjun D. Desai et al.ICML 2022 · 125 citations
- Pixelated Butterfly: Simple and Efficient Sparse training for Neural Network ModelsBeidi Chen, Tri Dao, Kaizhao Liang, Jiaming Yang et al.ICLR 2022 · 94 citations
Builds on3
- Rigging the Lottery: Making All Tickets WinnersUtku Evci, Trevor Gale, Jacob Menick, Pablo Samuel Castro et al.ICML 2020 · 723 citations
- Neural Tangents: Fast and Easy Infinite Neural Networks in PythonRoman Novak, Lechao Xiao, Jiri Hron, Jaehoon Lee et al.ICLR 2020 · 254 citations
- A Signal Propagation Perspective for Pruning Neural Networks at InitializationNamhoon Lee, Thalaiyasingam Ajanthan, Stephen Gould, Philip H. S. TorrICLR 2020 · 174 citations
Related papers
- SparseProp: Efficient Sparse Backpropagation for Faster Training of Neural Networks at the EdgeMahdi Nikdan, Tommaso Pegolotti, Eugenia Iofinova, Eldar Kurtic et al.ICML 2023 · 14 citations
- The Graphon Limit Hypothesis: Understanding Neural Network Pruning via Infinite Width AnalysisHoang Pham, The Anh Ta, Tom Jacobs, Rebekka Burkholz et al.NeurIPS 2025 · 2 citations
- PHEW : Constructing Sparse Networks that Learn Fast and Generalize Well without Training DataShreyas Malakarjun Patil, Constantine DovrolisICML 2021 · 26 citations
- NTK-SAP: Improving neural network pruning by aligning training dynamicsYite Wang, Dawei Li, Ruoyu SunICLR 2023 · 2 citations
- Neural Architecture Search on ImageNet in Four GPU Hours: A Theoretically Inspired PerspectiveWuyang Chen, Xinyu Gong, Zhangyang WangICLR 2021 · 51 citations
