mlsanityData to 7 Oct 2026

Finding trainable sparse networks through Neural Tangent Transfer

arXiv 2006.08228 ↗First posted 15 Jun 2020cs.LG cs.NE stat.MLcited by 28

Not on the map. Why?

Abstract (arXiv)

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.

Key facts. Cited by 28 papers in the map (data through 7 Oct 2026). First posted on arXiv 15 Jun 2020.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2021: 4; 2022: 7; 2023: 10; 2024: 3; 2025: 4.

28 papers.

Sort:

By area:

  1. 2022Monarch: Expressive Structured Matrices for Efficient and Accurate Trainingcited by 100
  2. 2022The Unreasonable Effectiveness of Random Pruning: Return of the Most Naive Baseline for Sparse Trainingcited by 85
  3. 2021Sparse Training via Boosting Pruning Plasticity with Neuroregenerationcited by 83
  4. 2021Pixelated Butterfly: Simple and Efficient Sparse training for Neural Network Modelscited by 75
  5. 2022The State of Sparse Training in Deep Reinforcement Learningcited by 60
  6. 2023NTK-SAP: Improving neural network pruning by aligning training dynamicscited by 30
  7. 2021Keep the Gradients Flowing: Using Gradient Flow to Study Sparse Network Optimizationcited by 22
  8. 2024Multi-Layer Transformers Gradient Can be Approximated in Almost Linear Timecited by 22
  9. 2024A Tighter Complexity Analysis of SparseGPTcited by 19
  10. 2021A Unified Paths Perspective for Pruning at Initializationcited by 14
  11. 2022Dimensionality Reduced Training by Pruning and Freezing Parts of a Deep Neural Network, a Surveycited by 12
  12. 2022On the Neural Tangent Kernel Analysis of Randomly Pruned Neural Networkscited by 9
16 more
  1. 2025Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transformcited by 9
  2. 2023Balanced Training for Sparse GANscited by 8
  3. 2022LilNetX: Lightweight Networks with EXtreme Model Compression and Structured Sparsificationcited by 7
  4. 2025Only Large Weights (And Not Skip Connections) Can Prevent the Perils of Rank Collapsecited by 7
  5. 2023Streaming Kernel PCA Algorithm With Small Spacecited by 5
  6. 2023Training-Free Neural Active Learning with Initialization-Robustness Guaranteescited by 5
  7. 2023Pruning Before Training May Improve Generalization, Provablycited by 3
  8. 2023An Infinite-Width Analysis on the Jacobian-Regularised Training of a Neural Networkcited by 3
  9. 2024"Lossless" Compression of Deep Neural Networks: A High-dimensional Neural Tangent Kernel Approachcited by 3
  10. 2023Neural Networks with Sparse Activation Induced by Large Bias: Tighter Analysis with Bias-Generalized NTKcited by 2
  11. 2023Pruning at Initialization -- A Sketching Perspectivecited by 2
  12. 2025Theoretical Foundation of Flow-Based Time Series Generation: Provable Approximation, Generalization, and Efficiencycited by 2
  13. 2025The Graphon Limit Hypothesis: Understanding Neural Network Pruning via Infinite Width Analysiscited by 2
  14. 2022Finding Dynamics Preserving Adversarial Winning Ticketscited by 1
  15. 2023Self-Distillation for Gaussian Process Regression and Classificationcited by 1
  16. 2023Kernels, Data & Physicscited by 0