paper-with-me

홈 › Papers

Reproducibility Study: Comparing Rewinding and Fine-tuning in Neural Network Pruning

2021-09-20 · Szymon Mikler

Scope of reproducibility: We are reproducing Comparing Rewinding and Fine-tuning in Neural Networks from arXiv:2003.02389. In this work the authors compare three different approaches to retraining neural networks after pruning: 1) fine-tuning, 2) rewinding weights as in arXiv:1803.03635 and 3) a new, original method involving learning rate rewinding, building upon Lottery Ticket Hypothesis. We reproduce the results of all three approaches, but we focus on verifying their approach, learning rate rewinding, since it is newly proposed and is described as a universal alternative to other methods. We used CIFAR10 for most reproductions along with additional experiments on the larger CIFAR100, which extends the results originally provided by the authors. We have also extended the list of tested network architectures to include Wide ResNets. The new experiments led us to discover the limitations of learning rate rewinding which can worsen pruning results on large architectures. Results: We were able to reproduce the exact results reported by the authors in all originally reported scenarios. However, extended results on larger Wide Residual Networks have demonstrated the limitations of the newly proposed learning rate rewinding -- we observed a previously unreported accuracy degradation for low sparsity ranges. Nevertheless, the general conclusion of the paper still holds and was indeed reproduced.

📄 PDF Abstract BibTeX arXiv:2109.09670

Code (1)

gahaalt/reproducing-comparing-rewinding-and-finetuning 공식 구현 tf

Tasks

Network Pruning

Methods 이 논문이 사용한 방법론

Pruning 설명 없음

Similar Papers 제목 키워드 기반

Comparing Rewinding and Fine-tuning in Neural Network Pruning

2020-03-05 · ICLR 2020 1 · 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 standar…

Network Pruning

Network Pruning That Matters: A Case Study on Retraining Variants

2021-05-07 · ICLR 2021 1 · Duong H. Le, Binh-Son Hua

Network pruning is an effective method to reduce the computational expense of over-parameterized neural networks for deployment on low-resource systems. Recent state-of-the-art techniques for retraining pruned networks s…

Network PruningSentence

Pre-training vs. Fine-tuning: A Reproducibility Study on Dense Retrieval Knowledge Acquisition

2025-05-12 · Zheng Yao, Shuai Wang, Guido Zuccon

Dense retrievers utilize pre-trained backbone language models (e.g., BERT, LLaMA) that are fine-tuned via contrastive learning to perform the task of encoding text into sense representations that can be then compared via…

Contrastive LearningDecoderNatural QuestionsRetrieval

PEFT-Arena: Understanding Parameter-Efficient Finetuning from a Stability-Plasticity Perspective

2026-05-27 · Yangyi Huang, Ruotian Peng, Zeju Qiu, Jiale Kang 외 arxiv

Parameter-efficient finetuning (PEFT) has become the standard approach for adapting large language models, yet evaluations largely emphasize downstream accuracy while overlooking the retention of pretrained capabilities.…

HPO-B: A Large-Scale Reproducible Benchmark for Black-Box HPO based on OpenML

2021-06-11 · Sebastian Pineda Arango, Hadi S. Jomaa, Martin Wistuba, Josif Grabocka

Hyperparameter optimization (HPO) is a core problem for the machine learning community and remains largely unsolved due to the significant computational resources required to evaluate hyperparameter configurations. As a …

Hyperparameter OptimizationTransfer Learning