mlsanityData to 7 Oct 2026

The Effects of Grouped Structural Global Pruning of Vision Transformers on Domain Generalisation

arXiv 2504.04196 ↗First posted 5 Apr 2025cs.CV cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

With the growing sizes of AI models like large language models (LLMs) and vision transformers, deploying them on devices with limited computational resources is a significant challenge particularly when addressing domain generalisation (DG) tasks. This paper introduces a novel grouped structural pruning method for pre-trained vision transformers (ViT, BeiT, and DeiT), evaluated on the PACS and Office-Home DG benchmarks. Our method uses dependency graph analysis to identify and remove redundant groups of neurons, weights, filters, or attention heads within transformers, using a range of selection metrics. Grouped structural pruning is applied at pruning ratios of 50%, 75% and 95% and the models are then fine-tuned on selected distributions from DG benchmarks to evaluate their overall performance in DG tasks. Results show significant improvements in inference speed and fine-tuning time with minimal trade-offs in accuracy and DG task performance. For instance, on the PACS benchmark, pruning ViT, BeiT, and DeiT models by 50% using the Hessian metric resulted in accuracy drops of only -2.94%, -1.42%, and -1.72%, respectively, while achieving speed boosts of 2.5x, 1.81x, and 2.15x. These findings demonstrate the effectiveness of our approach in balancing model efficiency with domain generalisation performance.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 31 of its 34 references that are in the map. First posted on arXiv 5 Apr 2025.

Builds on

31 of 34 references.

References · 31

  1. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  2. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
  3. 2023QLoRA: Efficient Finetuning of Quantized LLMscited by 3,355
  4. 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,250
  5. 2018DARTS: Differentiable Architecture Searchcited by 1,782
  6. 2017Deep Hashing Network for Unsupervised Domain Adaptationcited by 1,181
  7. 2016Pruning Filters for Efficient ConvNetscited by 1,129
  8. 2017Deeper, Broader and Artier Domain Generalizationcited by 983
  9. 2018SNIP: Single-shot Network Pruning based on Connection Sensitivitycited by 802
  10. 2021Generalizing to Unseen Domains: A Survey on Domain Generalizationcited by 762
  11. 2019Importance Estimation for Neural Network Pruningcited by 531
  12. 2019Rigging the Lottery: Making All Tickets Winnerscited by 491
19 more
  1. 2020Pruning neural networks without any data by iteratively conserving synaptic flowcited by 475
  2. 2020Picking Winning Tickets Before Training by Preserving Gradient Flowcited by 467
  3. 2024SliceGPT: Compress Large Language Models by Deleting Rows and Columnscited by 378
  4. 2018Soft Filter Pruning for Accelerating Deep Convolutional Neural Networkscited by 313
  5. 2014Exploiting Linear Structure Within Convolutional Networks for Efficient Evaluationcited by 304
  6. 2024A Survey on Knowledge Distillation of Large Language Modelscited by 276
  7. 2021Pruning and Quantization for Deep Neural Network Acceleration: A Surveycited by 259
  8. 2017Learning to Prune Deep Neural Networks via Layer-wise Optimal Brain Surgeoncited by 219
  9. 2023DepGraph: Towards Any Structural Pruningcited by 202
  10. 2023A Survey on Deep Neural Network Pruning-Taxonomy, Comparison, Analysis, and Recommendationscited by 200
  11. 2019Drawing Early-Bird Tickets: Towards More Efficient Training of Deep Networkscited by 160
  12. 2023Dataset Distillation: A Comprehensive Reviewcited by 126
  13. 2019Gate Decorator: Global Filter Pruning Method for Accelerating Deep Convolutional Neural Networkscited by 118
  14. 2017MorphNet: Fast & Simple Resource-Constrained Structure Learning of Deep Networkscited by 92
  15. 2023AI-Generated Content (AIGC): A Surveycited by 59
  16. 2020DSA: More Efficient Budgeted Pruning via Differentiable Sparsity Allocationcited by 47
  17. 2023PDP: Parameter-free Differentiable Pruning is All You Needcited by 12
  18. 2023Domain Generalisation with Bidirectional Encoder Representations from Vision Transformerscited by 2
  19. 2024Understanding Foundation Models: Are We Back in 1924?cited by 2

Built on by

Not cited yet.