Linear Mode Connectivity in Sparse Neural Networks

Luke McDermott, Daniel Cummings
10/28/2023
cs.LGcs.AI

No confident code implementation found for this paper.

Abstract

With the rise in interest of sparse neural networks, we study how neural network pruning with synthetic data leads to sparse networks with unique training properties. We find that distilled data, a synthetic summarization of the real data, paired with Iterative Magnitude Pruning (IMP) unveils a new class of sparse networks that are more stable to SGD noise on the real data, than either the dense model, or subnetworks found with real data in IMP. That is, synthetically chosen subnetworks often train to the same minima, or exhibit linear mode connectivity. We study this through linear interpolation, loss landscape visualizations, and measuring the diagonal of the hessian. While dataset distillation as a field is still young, we find that these properties lead to synthetic subnetworks matching the performance of traditional IMP with up to 150x less training points in settings where distilled data applies.

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{mcdermott2023linear,
  title  = {Linear Mode Connectivity in Sparse Neural Networks},
  author = {Luke McDermott and Daniel Cummings},
  year   = {2023},
  eprint = {2310.18769},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2310.18769v1}
}

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/2310.18769.svg)](https://codeofpaper.com/paper/2310.18769)

Discussion