mlsanityData to 7 Oct 2026

NTK-SAP: Improving neural network pruning by aligning training dynamics

arXiv 2304.02840 ↗First posted 6 Apr 2023cs.LG cs.CV stat.MLcited by 30

Not on the map. Why?

Abstract (arXiv)

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 fixed-weight-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.

Key facts. Cited by 30 papers in the map (data through 7 Oct 2026). Builds on 60 of its 76 references that are in the map. First posted on arXiv 6 Apr 2023.

Builds on

60 of 76 references.

References · 60

  1. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  2. 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,267
  3. 2018Neural Tangent Kernel: Convergence and Generalization in Neural Networkscited by 2,597
  4. 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,250
  5. 2015Learning both Weights and Connections for Efficient Neural Networkscited by 1,998
  6. 2018SNIP: Single-shot Network Pruning based on Connection Sensitivitycited by 802
  7. 2019Wide Neural Networks of Any Depth Evolve as Linear Models Under Gradient Descentcited by 732
  8. 2019Linear Mode Connectivity and the Lottery Ticket Hypothesiscited by 627
  9. 2018Rethinking the Value of Network Pruningcited by 595
  10. 2019On Exact Computation with an Infinitely Wide Neural Netcited by 572
  11. 2017Learning Sparse Neural Networks through L0 Regularizationcited by 571
  12. 2016Learning Structured Sparsity in Deep Neural Networkscited by 538
38 more
  1. 2019Importance Estimation for Neural Network Pruningcited by 531
  2. 2019Rigging the Lottery: Making All Tickets Winnerscited by 491
  3. 2020Pruning neural networks without any data by iteratively conserving synaptic flowcited by 475
  4. 2020Picking Winning Tickets Before Training by Preserving Gradient Flowcited by 467
  5. 2017Scalable Training of Artificial Neural Networks with Adaptive Sparse Connectivity inspired by Network Sciencecited by 325
  6. 2020Comparing Rewinding and Fine-tuning in Neural Network Pruningcited by 238
  7. 2016Dynamic Network Surgery for Efficient DNNscited by 233
  8. 2017NISP: Pruning Networks using Neuron Importance Score Propagationcited by 228
  9. 2017Learning to Prune Deep Neural Networks via Layer-wise Optimal Brain Surgeoncited by 219
  10. 2019Sparse Networks from Scratch: Faster Training without Losing Performancecited by 210
  11. 2021Zero-Cost Proxies for Lightweight NAScited by 194
  12. 2019Parameter Efficient Training of Deep Convolutional Neural Networks by Dynamic Sparse Reparameterizationcited by 187
  13. 2020Pruning Neural Networks at Initialization: Why are We Missing the Mark?cited by 181
  14. 2021Neural Architecture Search on ImageNet in Four GPU Hours: A Theoretically Inspired Perspectivecited by 168
  15. 2019Drawing Early-Bird Tickets: Towards More Efficient Training of Deep Networkscited by 160
  16. 2020Soft Threshold Weight Reparameterization for Learnable Sparsitycited by 150
  17. 2017Deep Rewiring: Training very sparse deep networkscited by 136
  18. 2017Resurrecting the sigmoid in deep learning through dynamical isometry: theory and practicecited by 132
  19. 2017Theoretical insights into the optimization landscape of over-parameterized shallow neural networkscited by 128
  20. 2021Do We Actually Need Dense Over-Parameterization? In-Time Over-Parameterization in Sparse Trainingcited by 107
  21. 2017Spurious Local Minima are Common in Two-Layer ReLU Neural Networkscited by 104
  22. 2019Winning the Lottery with Continuous Sparsificationcited by 99
  23. 2019A Signal Propagation Perspective for Pruning Neural Networks at Initializationcited by 96
  24. 2021Sparse Training via Boosting Pruning Plasticity with Neuroregenerationcited by 83
  25. 2020Gradient Flow in Sparse Neural Networks and How Lottery Tickets Wincited by 77
  26. 2018The Emergence of Spectral Universality in Deep Networkscited by 74
  27. 2020Operation-Aware Soft Channel Pruning using Differentiable Maskscited by 74
  28. 2016Training Sparse Neural Networkscited by 73
  29. 2020Dynamic Sparse Training: Find Efficient Sparse Network From Scratch With Trainable Masked Layerscited by 66
  30. 2020Progressive Skeletonization: Trimming more fat from a network at initializationcited by 64
  31. 2018Compressing Neural Networks using the Variational Information Bottleneckcited by 59
  32. 2020The Global Landscape of Neural Networks: An Overviewcited by 57
  33. 2021Effective Sparsification of Neural Networks with Global Sparsity Constraintcited by 45
  34. 2022Prospect Pruning: Finding Trainable Weights at Initialization using Meta-Gradientscited by 34
  35. 2019On Learning Over-parameterized Neural Networks: A Functional Approximation Perspectivecited by 28
  36. 2020Finding trainable sparse networks through Neural Tangent Transfercited by 28
  37. 2021NASI: Label- and Data-agnostic Neural Architecture Search at Initializationcited by 28
  38. 2018Understanding the Loss Surface of Neural Networks for Binary Classificationcited by 27

50 most cited of 60 All 60 (JSON)

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2023: 6; 2024: 9; 2025: 10; 2026: 5.

30 papers.

Sort:

By area:

  1. 2023A Survey on Deep Neural Network Pruning-Taxonomy, Comparison, Analysis, and Recommendationscited by 200
  2. 2024SwitchTab: Switched Autoencoders Are Effective Tabular Learnerscited by 37
  3. 2025SepPrune: Structured Pruning for Efficient Deep Speech Separationcited by 31
  4. 2023LEMON: Lossless model expansioncited by 23
  5. 2024Deconstructing The Ethics of Large Language Models from Long-standing Issues to New-emerging Dilemmas: A Surveycited by 23
  6. 2025Efficient Model Editing with Task-Localized Sparse Fine-tuningcited by 16
  7. 2024MULTIFLOW: Shifting Towards Task-Agnostic Vision-Language Pruningcited by 13
  8. 2024Finding Lottery Tickets in Vision Models via Data-driven Spectral Foresight Pruningcited by 10
  9. 2023DNNShifter: An Efficient DNN Pruning System for Edge Computingcited by 8
  10. 2024Inductive Gradient Adjustment For Spectral Bias In Implicit Neural Representationscited by 8
  11. 2023On the Opportunities of Green Computing: A Surveycited by 7
  12. 2025NIRVANA: Structured Pruning Reimagined for Large Language Model Compressioncited by 6
18 more
  1. 2026You Need an Encoder for Native Position-Independent Cachingcited by 6
  2. 2024BadCLM: Backdoor Attack in Clinical Language Models for Electronic Health Recordscited by 5
  3. 2024Train Faster, Perform Better: Modular Adaptive Training in Over-Parameterized Modelscited by 3
  4. 2025Fast Generalized Neural Tangent Kernel Statistics via Trace Estimationcited by 3
  5. 2023Understanding Sparse Neural Networks from their Topology via Multipartite Graph Representationscited by 2
  6. 2023Pruning at Initialization -- A Sketching Perspectivecited by 2
  7. 2025Neural Tangent Knowledge Distillation for Optical Convolutional Networkscited by 2
  8. 2025The Graphon Limit Hypothesis: Understanding Neural Network Pruning via Infinite Width Analysiscited by 2
  9. 2024Probability Distribution Learning and Its Application in Deep Learningcited by 1
  10. 2026Prune Once: Retraining-Free Task-Agnostic Pruning for Vision-Language Modelscited by 1
  11. 2024Accelerating Inference of Networks in the Frequency Domaincited by 0
  12. 2025Towards Understanding the Optimization Mechanisms in Deep Learningcited by 0
  13. 2025Hyperflux: Pruning Reveals Importancecited by 0
  14. 2025Compact Vision Transformer by Reduction of Kernel Complexitycited by 0
  15. 2025A Second-Order Perspective on Pruning at Initialization and Knowledge Transfercited by 0
  16. 2026Learnability and Privacy Vulnerability are Entangled in a Few Critical Weightscited by 0
  17. 2026Physics-Informed Foresight Pruning for Sparse PINN Solvers of Nonlinear PDEscited by 0
  18. 2026LILA: Calibration-Free Structured Pruning of Large Language Models via Latent Spectral Geometrycited by 0