The Propensity for Density in Feed-forward Models

Nandi Schoots, Alex Jackson, Ali Kholmovaia, Peter McBurney, Murray Shanahan
10/18/2024
cs.LGcs.AI

No confident code implementation found for this paper.

Abstract

Does the process of training a neural network to solve a task tend to use all of the available weights even when the task could be solved with fewer weights? To address this question we study the effects of pruning fully connected, convolutional and residual models while varying their widths. We find that the proportion of weights that can be pruned without degrading performance is largely invariant to model size. Increasing the width of a model has little effect on the density of the pruned model relative to the increase in absolute size of the pruned network. In particular, we find substantial prunability across a large range of model sizes, where our biggest model is 50 times as wide as our smallest model. We explore three hypotheses that could explain these findings.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{schoots2024propensity,
  title  = {The Propensity for Density in Feed-forward Models},
  author = {Nandi Schoots and Alex Jackson and Ali Kholmovaia and Peter McBurney and Murray Shanahan},
  year   = {2024},
  eprint = {2410.14461},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2410.14461v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2410.14461.svg)](https://codeofpaper.com/paper/2410.14461)

Discussion