NTK-SAP: Improving neural network pruning by aligning training dynamics
Yite Wang, Dawei Li, Ruoyu Sun
摘要
Pruning neural networks before training has received increasing interest due to its potential to reduce training time and memory. One popular method is to prune the connections based on a certain metric, but it is not entirely clear what metric is the best choice. Recent advances in neural tangent kernel (NTK) theory suggest that the training dynamics of large enough neural networks is closely related to the spectrum of the NTK. Motivated by this finding, we propose to prune the connections that have the least influence on the spectrum of the NTK. This method can help maintain the NTK spectrum, which may help align the training dynamics to that of its dense counterpart. However, one possible issue is that the fixedweight-NTK corresponding to a given initial point can be very different from the NTK corresponding to later iterates during the training phase. We further propose to sample multiple realizations of random weights to estimate the NTK spectrum. Note that our approach is weight-agnostic, which is different from most existing methods that are weight-dependent. In addition, we use random inputs to compute the fixed-weight-NTK, making our method data-agnostic as well. We name our foresight pruning algorithm Neural Tangent Kernel Spectrum-Aware Pruning (NTK-SAP). Empirically, our method achieves better performance than all baselines on multiple datasets. Our code is available at https://github. com/YiteWang/NTK-SAP .
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper14
- SwitchTab: Switched Autoencoders Are Effective Tabular LearnersJing Wu, Suiyao Chen, Qi Zhao, Renat Sergazinov 等AAAI 2024 · 被引用 60 次
- LEMON: Lossless model expansionYite Wang, Jiahao Su, Hanlin Lu, Cong Xie 等ICLR 2024 · 被引用 25 次
- Balanced Training for Sparse GANsYite Wang, Jing Wu, Naira Hovakimyan, Ruoyu SunNeurIPS 2023 · 被引用 16 次
- Train Faster, Perform Better: Modular Adaptive Training in Over-Parameterized ModelsYubin Shi, Yixuan Chen, Mingzhi Dong, Xiaochen Yang 等NeurIPS 2023 · 被引用 5 次
- SepPrune: Structured Pruning for Efficient Deep Speech SeparationYuqi Li, Kai Li, Xin Yin, Zhifei Yang 等AAAI 2026 · 被引用 4 次
它引用的顶会 Paper27
- Pruning neural networks without any data by iteratively conserving synaptic flowHidenori Tanaka, Daniel Kunin, Daniel L. K. Yamins, Surya GanguliNeurIPS 2020 · 被引用 884 次
- Linear Mode Connectivity and the Lottery Ticket HypothesisJonathan Frankle, Gintare Karolina Dziugaite, Daniel M. Roy, Michael CarbinICML 2020 · 被引用 750 次
- Picking Winning Tickets Before Training by Preserving Gradient FlowChaoqi Wang, Guodong Zhang, Roger B. GrosseICLR 2020 · 被引用 743 次
- Rigging the Lottery: Making All Tickets WinnersUtku Evci, Trevor Gale, Jacob Menick, Pablo Samuel Castro 等ICML 2020 · 被引用 723 次
- Comparing Rewinding and Fine-tuning in Neural Network PruningAlex Renda, Jonathan Frankle, Michael CarbinICLR 2020 · 被引用 437 次
相关 Paper
- Finding Lottery Tickets in Vision Models via Data-Driven Spectral Foresight PruningLeonardo Iurada, Marco Ciccone, Tatiana TommasiCVPR 2024
- Neural Architecture Search on ImageNet in Four GPU Hours: A Theoretically Inspired PerspectiveWuyang Chen, Xinyu Gong, Zhangyang WangICLR 2021 · 被引用 51 次
- The Surprising Effectiveness of Infinite-Width NTKs for Characterizing and Improving Model TrainingJoshua DeOliveira, Walter Gerych, Elke A. RundensteinerAAAI 2025 · 被引用 1 次
- The Graphon Limit Hypothesis: Understanding Neural Network Pruning via Infinite Width AnalysisHoang Pham, The Anh Ta, Tom Jacobs, Rebekka Burkholz 等NeurIPS 2025 · 被引用 2 次
- PHEW : Constructing Sparse Networks that Learn Fast and Generalize Well without Training DataShreyas Malakarjun Patil, Constantine DovrolisICML 2021 · 被引用 26 次
