mlsanityData to 7 Oct 2026

A Unified Paths Perspective for Pruning at Initialization

arXiv 2101.10552 ↗First posted 26 Jan 2021cs.LGcited by 14

Not on the map. Why?

Abstract (arXiv)

A number of recent approaches have been proposed for pruning neural network parameters at initialization with the goal of reducing the size and computational burden of models while minimally affecting their training dynamics and generalization performance. While each of these approaches have some amount of well-founded motivation, a rigorous analysis of the effect of these pruning methods on network training dynamics and their formal relationship to each other has thus far received little attention. Leveraging recent theoretical approximations provided by the Neural Tangent Kernel, we unify a number of popular approaches for pruning at initialization under a single path-centric framework. We introduce the Path Kernel as the data-independent factor in a decomposition of the Neural Tangent Kernel and show the global structure of the Path Kernel can be computed efficiently. This Path Kernel decomposition separates the architectural effects from the data-dependent effects within the Neural Tangent Kernel, providing a means to predict the convergence dynamics of a network from its architecture alone. We analyze the use of this structure in approximating training and generalization performance of networks in the absence of data across a number of initialization pruning approaches. Observing the relationship between input data and paths and the relationship between the Path Kernel and its natural norm, we additionally propose two augmentations of the SynFlow algorithm for pruning at initialization.

Key facts. Cited by 14 papers in the map (data through 7 Oct 2026). Builds on 12 of its 14 references that are in the map. First posted on arXiv 26 Jan 2021.

Builds on

12 of 14 references.

References · 12

  1. 2018Neural Tangent Kernel: Convergence and Generalization in Neural Networkscited by 2,597
  2. 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,250
  3. 2018SNIP: Single-shot Network Pruning based on Connection Sensitivitycited by 802
  4. 2013Exact solutions to the nonlinear dynamics of learning in deep linear neural networkscited by 748
  5. 2019Fine-Grained Analysis of Optimization and Generalization for Overparameterized Two-Layer Neural Networkscited by 562
  6. 2020Pruning neural networks without any data by iteratively conserving synaptic flowcited by 475
  7. 2020Picking Winning Tickets Before Training by Preserving Gradient Flowcited by 467
  8. 2020Kernel and Rich Regimes in Overparametrized Modelscited by 302
  9. 2019A Signal Propagation Perspective for Pruning Neural Networks at Initializationcited by 96
  10. 2018How Important Is a Neuron?cited by 73
  11. 2020Finding trainable sparse networks through Neural Tangent Transfercited by 28
  12. 2018G-SGD: Optimizing ReLU Neural Networks in its Positively Scale-Invariant Spacecited by 26

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 2; 2022: 3; 2023: 3; 2024: 2; 2025: 3; 2026: 1.

14 papers.

Sort: