mlsanityData to 14 Oct 2026

EMP: Enhance Memory in Data Pruning

arXiv 2408.16031 ↗First posted 28 Aug 2024cs.LG cs.AIcited by 0

Not on the map. Why?

Abstract (arXiv)

Recently, large language and vision models have shown strong performance, but due to high pre-training and fine-tuning costs, research has shifted towards faster training via dataset pruning. Previous methods used sample loss as an evaluation criterion, aiming to select the most "difficult" samples for training. However, when the pruning rate increases, the number of times each sample is trained becomes more evenly distributed, which causes many critical or general samples to not be effectively fitted. We refer to this as Low-Frequency Learning (LFL). In other words, LFL prevents the model from remembering most samples. In our work, we decompose the scoring function of LFL, provide a theoretical explanation for the inefficiency of LFL, and propose adding a memory term to the scoring function to enhance the model's memory capability, along with an approximation of this memory term. Similarly, we explore memory in Self-Supervised Learning (SSL), marking the first discussion on SSL memory. Using contrastive learning, we derive the memory term both theoretically and experimentally. Finally, we propose Enhance Memory Pruning (EMP), which addresses the issue of insufficient memory under high pruning rates by enhancing the model's memory of data, thereby improving its performance. We evaluated the performance of EMP in tasks such as image classification, natural language understanding, and model pre-training. The results show that EMP can improve model performance under extreme pruning rates. For example, in the CIFAR100-ResNet50 pre-training task, with 70% pruning, EMP outperforms current methods by 2.2%.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 43 of its 60 references that are in the map. First posted on arXiv 28 Aug 2024.

Builds on

43 of 60 references.

References · 43

  1. 2015Deep Residual Learning for Image Recognitioncited by 52,096
  2. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,399
  3. 2014Adam: A Method for Stochastic Optimizationcited by 37,240
  4. 2021Learning Transferable Visual Models From Natural Language Supervisioncited by 33,744
  5. 2023GPT-4 Technical Reportcited by 18,396
  6. 2023Llama 2: Open Foundation and Fine-Tuned Chat Modelscited by 13,028
  7. 2020A Simple Framework for Contrastive Learning of Visual Representationscited by 12,049
  8. 2018GLUE: A Multi-Task Benchmark and Analysis Platform for Natural Language Understandingcited by 4,899
  9. 2019XLNet: Generalized Autoregressive Pretraining for Language Understandingcited by 2,811
  10. 2021ViLT: Vision-and-Language Transformer Without Convolution or Region Supervisioncited by 1,230
  11. 2014How transferable are features in deep neural networks?cited by 1,225
  12. 2023Scaling Vision Transformers to 22 Billion Parameterscited by 694
31 more
  1. 2018An Empirical Study of Example Forgetting during Deep Neural Network Learningcited by 678
  2. 2016Making Deep Neural Networks Robust to Label Noise: a Loss Correction Approachcited by 665
  3. 2019Gradient based sample selection for online continual learningcited by 571
  4. 2017Large Batch Training of Convolutional Networkscited by 535
  5. 2021Deep Learning on a Data Diet: Finding Important Examples Early in Trainingcited by 533
  6. 2020What Neural Networks Memorize and Why: Discovering the Long Tail via Influence Estimationcited by 497
  7. 2019Does Learning Require Memorization? A Short Tale about a Long Tailcited by 460
  8. 2019Selection via Proxy: Efficient Data Selection for Deep Learningcited by 339
  9. 2020Are we done with ImageNet?cited by 333
  10. 2022Transformers in Medical Imaging: A Surveycited by 245
  11. 2020GLISTER: Generalization based Data Subset Selection for Efficient and Robust Learningcited by 226
  12. 2017Emergence of Invariance and Disentanglement in Deep Representationscited by 215
  13. 2023A Survey on Self-supervised Learning: Algorithms, Applications, and Future Trendscited by 207
  14. 2014Qualitatively characterizing neural network optimization problemscited by 188
  15. 2017Deep Learning is Robust to Massive Label Noisecited by 165
  16. 2018Adversarial Active Learning for Deep Networks: a Margin Based Approachcited by 158
  17. 2020Contextual Diversity for Active Learningcited by 139
  18. 2022Dataset Pruning: Reducing Training Data by Examining Generalization Influencecited by 133
  19. 2023InfoBatch: Lossless Training Speed Up by Unbiased Dynamic Data Pruningcited by 90
  20. 2020RobBERT: a Dutch RoBERTa-based Language Modelcited by 88
  21. 2022Understanding and Improving Visual Prompting: A Label-Mapping Perspectivecited by 87
  22. 2021On the geometry of generalization and memorization in deep neural networkscited by 73
  23. 2023Data Pruning via Moving-one-Sample-outcited by 67
  24. 2021Accelerating Deep Learning with Dynamic Data Pruningcited by 43
  25. 2020Improving Generalization by Controlling Label-Noise Information in Neural Network Weightscited by 35
  26. 2021Decomposed Mutual Information Estimation for Contrastive Representation Learningcited by 25
  27. 2023Understanding Contrastive Learning via Distributionally Robust Optimizationcited by 21
  28. 2024Memorization in deep learning: A surveycited by 15
  29. 2019Neural Network Memorization Dissectioncited by 7
  30. 2024DRoP: Distributionally Robust Data Pruningcited by 7
  31. 2024TED: Accelerate Model Training by Internal Generalizationcited by 1

Built on by

Not cited yet.