paper-with-me

홈 › Papers

Finding Stable Subnetworks at Initialization with Dataset Distillation

2025-03-23 · Luke McDermott, Rahul Parhi

Recent works have shown that Dataset Distillation, the process for summarizing the training data, can be leveraged to accelerate the training of deep learning models. However, its impact on training dynamics, particularly in neural network pruning, remains largely unexplored. In our work, we use distilled data in the inner loop of iterative magnitude pruning to produce sparse, trainable subnetworks at initialization -- more commonly known as lottery tickets. While using 150x less training points, our algorithm matches the performance of traditional lottery ticket rewinding on ResNet-18 & CIFAR-10. Previous work highlights that lottery tickets can be found when the dense initialization is stable to SGD noise (i.e. training across different ordering of the data converges to the same minima). We extend this discovery, demonstrating that stable subnetworks can exist even within an unstable dense initialization. In our linear mode connectivity studies, we find that pruning with distilled data discards parameters that contribute to the sharpness of the loss landscape. Lastly, we show that by first generating a stable sparsity mask at initialization, we can find lottery tickets at significantly higher sparsities than traditional iterative magnitude pruning.

📄 PDF Abstract BibTeX arXiv:2503.17905

Code (0)

등록된 구현이 없습니다.

Tasks

Dataset DistillationLinear Mode ConnectivityNetwork Pruning

Methods 이 논문이 사용한 방법론

Pruning 설명 없음
SGD Stochastic Gradient Descent is an iterative optimization technique that uses minibatches of data to form an expectation of the gradient, rather than the full gradient using…

Similar Papers 제목 키워드 기반

Rare Gems: Finding Lottery Tickets at Initialization

2022-02-24 · Kartik Sreenivasan, Jy-yong Sohn, Liu Yang, Matthew Grinde 외

Large neural networks can be pruned to a small fraction of their original size, with little loss in accuracy, by following a time-consuming "train, prune, re-train" approach. Frankle & Carbin conjecture that we can avoid…

You Can Have Better Graph Neural Networks by Not Training Weights at All: Finding Untrained GNNs Tickets

2022-11-28 · Tianjin Huang, Tianlong Chen, Meng Fang, Vlado Menkovski 외

Recent works have impressively demonstrated that there exists a subnetwork in randomly initialized convolutional neural networks (CNNs) that can match the performance of the fully trained dense networks at initialization…

AllOut-of-Distribution Detection

Winning the Lottery by Preserving Network Training Dynamics with Concrete Ticket Search

2025-12-08 · Tanay Arora, Christof Teuscher arxiv

The Lottery Ticket Hypothesis asserts the existence of highly sparse, trainable subnetworks ('winning tickets') within dense, randomly initialized neural networks. However, state-of-the-art methods of drawing these ticke…

Knowledge DistillationImage Classification

Linear Mode Connectivity and the Lottery Ticket Hypothesis

2019-12-11 · ICML 2020 1 · Jonathan Frankle, Gintare Karolina Dziugaite, Daniel M. Roy, Michael Carbin

We study whether a neural network optimizes to the same, linearly connected minimum under different samples of SGD noise (e.g., random data order and augmentation). We find that standard vision models become stable to SG…

Linear Mode Connectivity

When Layers Play the Lottery, all Tickets Win at Initialization

2023-01-25 · Artur Jordao, George Correa de Araujo, Helena de Almeida Maia, Helio Pedrini

Pruning is a standard technique for reducing the computational cost of deep networks. Many advances in pruning leverage concepts from the Lottery Ticket Hypothesis (LTH). LTH reveals that inside a trained dense network e…

All