mlsanityData to 14 Oct 2026

PAC-Net: A Model Pruning Approach to Inductive Transfer Learning

arXiv 2206.05703 ↗First posted 12 Jun 2022cs.LG cs.AI physics.comp-phcited by 6

Not on the map. Why?

Abstract (arXiv)

Inductive transfer learning aims to learn from a small amount of training data for the target task by utilizing a pre-trained model from the source task. Most strategies that involve large-scale deep learning models adopt initialization with the pre-trained model and fine-tuning for the target task. However, when using over-parameterized models, we can often prune the model without sacrificing the accuracy of the source task. This motivates us to adopt model pruning for transfer learning with deep learning models. In this paper, we propose PAC-Net, a simple yet effective approach for transfer learning based on pruning. PAC-Net consists of three steps: Prune, Allocate, and Calibrate (PAC). The main idea behind these steps is to identify essential weights for the source task, fine-tune on the source task by updating the essential weights, and then calibrate on the target task by updating the remaining redundant weights. Under the various and extensive set of inductive transfer learning experiments, we show that our method achieves state-of-the-art performance by a large margin.

Key facts. Cited by 6 papers in the map (data through 14 Oct 2026). Builds on 28 of its 51 references that are in the map. First posted on arXiv 12 Jun 2022.

Builds on

28 of 51 references.

References · 28

  1. 2015Deep Residual Learning for Image Recognitioncited by 52,096
  2. 2014Adam: A Method for Stochastic Optimizationcited by 37,240
  3. 2016SQuAD: 100,000+ Questions for Machine Comprehension of Textcited by 4,148
  4. 2018Neural Ordinary Differential Equationscited by 3,779
  5. 2015Delving Deep into Rectifiers: Surpassing Human-Level Performance on ImageNet Classificationcited by 3,611
  6. 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,262
  7. 2015Learning both Weights and Connections for Efficient Neural Networkscited by 2,031
  8. 2018Group Normalizationcited by 1,524
  9. 2017Adversarial Discriminative Domain Adaptationcited by 1,311
  10. 2014How transferable are features in deep neural networks?cited by 1,225
  11. 2016Deep CORAL: Correlation Alignment for Deep Domain Adaptationcited by 1,200
  12. 2017PackNet: Adding Multiple Tasks to a Single Network by Iterative Pruningcited by 898
16 more
  1. 2017Unified Deep Supervised Domain Adaptation and Generalizationcited by 323
  2. 2018An Intriguing Failing of Convolutional Neural Networks and the CoordConv Solutioncited by 307
  3. 2018Explicit Inductive Bias for Transfer Learning with Convolutional Networkscited by 227
  4. 2020Proving the Lottery Ticket Hypothesis: Pruning is All You Needcited by 201
  5. 2017Central Moment Discrepancy (CMD) for Domain-Invariant Representation Learningcited by 192
  6. 2020Recall and Learn: Fine-tuning Deep Pretrained Language Models with Less Forgettingcited by 170
  7. 2017Mind the Class Weight Bias: Weighted Maximum Mean Discrepancy for Unsupervised Domain Adaptationcited by 151
  8. 2019DELTA: DEep Learning Transfer using Feature Map with Attention for Convolutional Networkscited by 80
  9. 2014Domain-Adversarial Neural Networkscited by 79
  10. 2020Distance-Based Regularisation of Deep Networks for Fine-Tuningcited by 48
  11. 2021Improved Regularization and Robustness for Fine-tuning in Neural Networkscited by 45
  12. 2019d-SNE: Domain Adaptation using Stochastic Neighborhood Embeddingcited by 40
  13. 2020A Gradient Flow Framework For Analyzing Network Pruningcited by 36
  14. 2020Time-Reversal Symmetric ODE Networkcited by 19
  15. 2021A Novel Approach for Semiconductor Etching Process with Inductive Biasescited by 3
  16. 2022Restructuring TCAD System: Teaching Traditional TCAD New Trickscited by 2

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2022: 2; 2023: 1; 2024: 0; 2025: 1; 2026: 2.

6 papers.