mlsanityData to 7 Oct 2026

TED: Accelerate Model Training by Internal Generalization

arXiv 2405.03228 ↗First posted 6 May 2024cs.LGcited by 1

Not on the map. Why?

Abstract (arXiv)

Large language models have demonstrated strong performance in recent years, but the high cost of training drives the need for efficient methods to compress dataset sizes. We propose TED pruning, a method that addresses the challenge of overfitting under high pruning ratios by quantifying the model's ability to improve performance on pruned data while fitting retained data, known as Internal Generalization (IG). TED uses an optimization objective based on Internal Generalization Distance (IGD), measuring changes in IG before and after pruning to align with true generalization performance and achieve implicit regularization. The IGD optimization objective was verified to allow the model to achieve the smallest upper bound on generalization error. The impact of small mask fluctuations on IG is studied through masks and Taylor approximation, and fast estimation of IGD is enabled. In analyzing continuous training dynamics, the prior effect of IGD is validated, and a progressive pruning strategy is proposed. Experiments on image classification, natural language understanding, and large language model fine-tuning show TED achieves lossless performance with 60-70% of the data. Upon acceptance, our code will be made publicly available.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 30 of its 40 references that are in the map. First posted on arXiv 6 May 2024.

Builds on

30 of 40 references.

References · 30

  1. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
  2. 2021Learning Transferable Visual Models From Natural Language Supervisioncited by 33,456
  3. 2023GPT-4 Technical Reportcited by 18,132
  4. 2023Llama 2: Open Foundation and Fine-Tuned Chat Modelscited by 12,865
  5. 2020Measuring Massive Multitask Language Understandingcited by 7,768
  6. 2018GLUE: A Multi-Task Benchmark and Analysis Platform for Natural Language Understandingcited by 4,854
  7. 2018Neural Tangent Kernel: Convergence and Generalization in Neural Networkscited by 2,597
  8. 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,250
  9. 2018SNIP: Single-shot Network Pruning based on Connection Sensitivitycited by 802
  10. 2018An Empirical Study of Example Forgetting during Deep Neural Network Learningcited by 669
  11. 2019Gradient based sample selection for online continual learningcited by 568
  12. 2021Deep Learning on a Data Diet: Finding Important Examples Early in Trainingcited by 529
18 more
  1. 2020Dataset Condensation with Gradient Matchingcited by 510
  2. 2019Selection via Proxy: Efficient Data Selection for Deep Learningcited by 337
  3. 2020The Lottery Ticket Hypothesis for Pre-trained BERT Networkscited by 275
  4. 2022Transformers in Medical Imaging: A Surveycited by 245
  5. 2020GLISTER: Generalization based Data Subset Selection for Efficient and Robust Learningcited by 224
  6. 2019A Tail-Index Analysis of Stochastic Gradient Noise in Deep Neural Networkscited by 213
  7. 2014Qualitatively characterizing neural network optimization problemscited by 186
  8. 2018Adversarial Active Learning for Deep Networks: a Margin Based Approachcited by 155
  9. 2020Contextual Diversity for Active Learningcited by 139
  10. 2022Dataset Pruning: Reducing Training Data by Examining Generalization Influencecited by 132
  11. 2023InfoBatch: Lossless Training Speed Up by Unbiased Dynamic Data Pruningcited by 90
  12. 2022Understanding and Improving Visual Prompting: A Label-Mapping Perspectivecited by 86
  13. 2023Data Pruning via Moving-one-Sample-outcited by 67
  14. 2021Mind Your Outliers! Investigating the Negative Impact of Outliers on Active Learning for Visual Question Answeringcited by 62
  15. 2022GradViT: Gradient Inversion of Vision Transformerscited by 52
  16. 2021Accelerating Deep Learning with Dynamic Data Pruningcited by 43
  17. 2018Theory of Curriculum Learning, with Convex Loss Functionscited by 33
  18. 2021Core-set Sampling for Efficient Neural Architecture Searchcited by 23

Built on by

Cited by year

Citing papers per year: 2024: 1.

1 paper.