Papers › Comparing Rewinding and Fine-tuning in Neural Network Pruning

Comparing Rewinding and Fine-tuning in Neural Network Pruning

5 Mar 2020ICLR 2020 1arXiv:2003.02389archive 2025-07-28

Alex Renda, Jonathan Frankle, Michael Carbin

Many neural network pruning algorithms proceed in three steps: train the network to completion, remove unwanted structure to compress the network, and retrain the remaining structure to recover lost accuracy. The standard retraining technique, fine-tuning, trains the unpruned weights from their final trained values using a small fixed learning rate. In this paper, we compare fine-tuning to alternative retraining techniques. Weight rewinding (as proposed by Frankle et al., (2019)), rewinds unpruned weights to their values from earlier in training and retrains them from there using the original training schedule. Learning rate rewinding (which we propose) trains the unpruned weights from their final values using the same learning rate schedule as weight rewinding. Both rewinding techniques outperform fine-tuning, forming the basis of a network-agnostic pruning algorithm that matches the accuracy and compression ratios of several more network-specific state-of-the-art techniques.

PaperPDFConference PDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2003.02389")

Code

Syntology Ran 6 of 6 code samples harvested from 1 repository linked to this paper; 0 have no recorded run. Of those that ran: 2 ran · honoured contract; 4 ran · our draft was wrong.

By repository: official repository: 6 samples from 1 repository, 6 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

lottery-ticket/rewinding-iclr20-public officialmentioned in papertf report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

6 samples harvested; 6 ran; 2 honoured the contract we drafted; 0 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

2ran · honoured contract
4ran · our draft was wrong

Licence: 6 of the 6 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from lottery-ticket/rewinding-iclr20-public. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

aggregate_trials lottery-ticket/rewinding-iclr20-public/vision/plot/common.py official repository ran · honoured contract no licence file found · pointer only · 4bb442f2ca92f56b · report
bias_name_of_base_name lottery-ticket/rewinding-iclr20-public/gnmt/model/nmt/lottery/lottery.py official repository ran · our draft was wrong fingerprinted no licence file found · pointer only · eb9b5f8723fa9304 · report
fmt_of_method lottery-ticket/rewinding-iclr20-public/vision/plot/common.py official repository ran · our draft was wrong no licence file found · pointer only · 617c0419b06f337d · report
mask_name_of_base_name lottery-ticket/rewinding-iclr20-public/gnmt/model/nmt/lottery/lottery.py official repository ran · our draft was wrong fingerprinted no licence file found · pointer only · ad3ffba2b9c58c92 · report
ms_of_method lottery-ticket/rewinding-iclr20-public/vision/plot/common.py official repository ran · honoured contract no licence file found · pointer only · c5ac62e39a802ae4 · report
weight_name_of_base_name lottery-ticket/rewinding-iclr20-public/gnmt/model/nmt/lottery/lottery.py official repository ran · our draft was wrong fingerprinted no licence file found · pointer only · f40e4115e09f1b77 · report

Tasks

Network Pruning

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

Pruning

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections