mlsanityData to 7 Oct 2026

Junk DNA Hypothesis: Pruning Small Pre-Trained Weights Irreversibly and Monotonically Impairs "Difficult" Downstream Tasks in LLMs

arXiv 2310.02277 ↗First posted 29 Sep 2023cs.LG cs.AIcited by 13

Not on the map. Why?

Abstract (arXiv)

We present Junk DNA Hypothesis by adopting a novel task-centric angle for the pre-trained weights of large language models (LLMs). It has been believed that weights in LLMs contain significant redundancy, leading to the conception that a considerable chunk of the parameters can be removed by pruning without compromising performance. Contrary to this belief, this paper presents a counter-argument: small-magnitude weights of pre-trained model weights encode vital knowledge essential for tackling difficult downstream tasks - manifested as the monotonic relationship between the performance drop of downstream tasks across the difficulty spectrum, as we prune more pre-trained weights by magnitude. Moreover, we reveal that these seemingly inconsequential weights can result in irreparable loss of knowledge and performance degradation in difficult tasks, even when downstream continual training is allowed. Interestingly, our evaluations show that the other popular compression, namely quantization, fails to exhibit similar monotonic effect and does not as convincingly disentangle this task-difficulty information. To study formally, we introduce several quantifiable metrics to gauge the downstream task difficulty: (1) within the same task category, and (2) across different task categories. Our extensive experiments substantiate the Junk DNA Hypothesis across a diverse range of model sizes, tasks, datasets, and even pruning methods. Codes are available at: https://github.com/VITA-Group/Junk_DNA_Hypothesis.git.

Key facts. Cited by 13 papers in the map (data through 7 Oct 2026). Builds on 46 of its 65 references that are in the map. First posted on arXiv 29 Sep 2023.

Builds on

46 of 65 references.

References · 46

  1. 2020Language Models are Few-Shot Learnerscited by 32,199
  2. 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,266
  3. 2020Measuring Massive Multitask Language Understandingcited by 7,768
  4. 2018GLUE: A Multi-Task Benchmark and Analysis Platform for Natural Language Understandingcited by 4,854
  5. 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,018
  6. 2019PIQA: Reasoning about Physical Commonsense in Natural Languagecited by 2,818
  7. 2015Deep Compression: Compressing Deep Neural Networks with Pruning, Trained Quantization and Huffman Codingcited by 2,291
  8. 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,250
  9. 2018Can a Suit of Armor Conduct Electricity? A New Dataset for Open Book Question Answeringcited by 2,114
  10. 2022GPTQ: Accurate Post-Training Quantization for Generative Pre-trained Transformerscited by 1,838
  11. 2023SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shotcited by 1,090
  12. 2023A Simple and Effective Pruning Approach for Large Language Modelscited by 776
34 more
  1. 2023Large Language Modelscited by 774
  2. 2023In-Context Retrieval-Augmented Language Modelscited by 694
  3. 2023LLM-Pruner: On the Structural Pruning of Large Language Modelscited by 643
  4. 2019Linear Mode Connectivity and the Lottery Ticket Hypothesiscited by 627
  5. 2019Rigging the Lottery: Making All Tickets Winnerscited by 491
  6. 2019The State of Sparsity in Deep Neural Networkscited by 471
  7. 2020Movement Pruning: Adaptive Sparsity by Fine-Tuningcited by 398
  8. 2023SpQR: A Sparse-Quantized Representation for Near-Lossless LLM Weight Compressioncited by 359
  9. 2017Scalable Training of Artificial Neural Networks with Adaptive Sparse Connectivity inspired by Network Sciencecited by 325
  10. 2020The Lottery Ticket Hypothesis for Pre-trained BERT Networkscited by 275
  11. 2021I-BERT: Integer-only BERT Quantizationcited by 250
  12. 2017Learning to Prune Deep Neural Networks via Layer-wise Optimal Brain Surgeoncited by 219
  13. 2019Parameter Efficient Training of Deep Convolutional Neural Networks by Dynamic Sparse Reparameterizationcited by 187
  14. 2021Learning N:M Fine-grained Structured Sparse Neural Networks From Scratchcited by 177
  15. 2021Block Pruning For Faster Transformerscited by 176
  16. 2023Few-shot Fine-tuning vs. In-context Learning: A Fair Comparison and Evaluationcited by 134
  17. 2022The Optimal BERT Surgeon: Scalable and Accurate Second-Order Pruning for Large Language Modelscited by 115
  18. 2021Do We Actually Need Dense Over-Parameterization? In-Time Over-Parameterization in Sparse Trainingcited by 107
  19. 2022The Unreasonable Effectiveness of Random Pruning: Return of the Most Naive Baseline for Sparse Trainingcited by 85
  20. 2022PLATON: Pruning Large Transformer Models with Upper Confidence Bound of Weight Importancecited by 79
  21. 2021MEST: Accurate and Fast Memory-Economic Sparse Training Framework on the Edgecited by 77
  22. 2019Playing the lottery with rewards and multiple languages: lottery tickets in RL and NLPcited by 73
  23. 2021Prune Once for All: Sparse Pre-Trained Language Modelscited by 66
  24. 2021M-FAC: Efficient Matrix-Free Approximations of Second-Order Informationcited by 54
  25. 2023The Emergence of Essential Sparsity in Large Pre-trained Models: The Weights that Mattercited by 42
  26. 2021Rethinking Network Pruning -- under the Pre-train and Fine-tune Paradigmcited by 40
  27. 2020A Tunable Robust Pruning Framework Through Dynamic Network Rewiring of DNNscited by 37
  28. 2019Stabilizing the Lottery Ticket Hypothesiscited by 36
  29. 2019Human vs. Muppet: A Conservative Estimate of Human Performance on the GLUE Benchmarkcited by 32
  30. 2023Sparsity May Cry: Let Us Fail (Current) Sparse Neural Networks Together!cited by 27
  31. 2022Training Your Sparse Neural Network Better with Any Maskcited by 26
  32. 2023Instant Soup: Cheap Pruning Ensembles in A Single Pass Can Draw Lottery Tickets from Large Modelscited by 20
  33. 2023Dynamic Sparsity Is Channel-Level Sparsity Learnercited by 17
  34. 2021Towards More Effective and Economic Sparsely-Activated Modelcited by 11

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2024: 9; 2025: 1; 2026: 3.

13 papers.

Sort:

By area: