mlsanityData to 14 Oct 2026

Not All Data Matters: An End-to-End Adaptive Dataset Pruning Framework for Enhancing Model Performance and Efficiency

arXiv 2312.05599 ↗First posted 9 Dec 2023cs.AI cs.LGcited by 3

Not on the map. Why?

Abstract (arXiv)

While deep neural networks have demonstrated remarkable performance across various tasks, they typically require massive training data. Due to the presence of redundancies and biases in real-world datasets, not all data in the training dataset contributes to the model performance. To address this issue, dataset pruning techniques have been introduced to enhance model performance and efficiency by eliminating redundant training samples and reducing computational and memory overhead. However, previous works most rely on manually crafted scalar scores, limiting their practical performance and scalability across diverse deep networks and datasets. In this paper, we propose AdaPruner, an end-to-end Adaptive DAtaset PRUNing framEwoRk. AdaPruner can perform effective dataset pruning without the need for explicitly defined metrics. Our framework jointly prunes training data and fine-tunes models with task-specific optimization objectives. AdaPruner leverages (1) An adaptive dataset pruning (ADP) module, which iteratively prunes redundant samples to an expected pruning ratio; and (2) A pruning performance controller (PPC) module, which optimizes the model performance for accurate pruning. Therefore, AdaPruner exhibits high scalability and compatibility across various datasets and deep networks, yielding improved dataset distribution and enhanced model performance. AdaPruner can still significantly enhance model performance even after pruning up to 10-30% of the training data. Notably, these improvements are accompanied by substantial savings in memory and computation costs. Qualitative and quantitative experiments suggest that AdaPruner outperforms other state-of-the-art dataset pruning methods by a large margin.

Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 19 of its 35 references that are in the map. First posted on arXiv 9 Dec 2023.

Builds on

19 of 35 references.

References · 19

  1. 2015Faster R-CNN: Towards Real-Time Object Detection with Region Proposal Networkscited by 9,639
  2. 2016Wide Residual Networkscited by 3,070
  3. 2017Understanding Black-box Predictions via Influence Functionscited by 1,741
  4. 2017Improved Regularization of Convolutional Neural Networks with Cutoutcited by 1,628
  5. 2019A Comprehensive Survey on Transfer Learningcited by 1,160
  6. 2018An Empirical Study of Example Forgetting during Deep Neural Network Learningcited by 678
  7. 2019Deep Double Descent: Where Bigger Models and More Data Hurtcited by 672
  8. 2021Deep Learning on a Data Diet: Finding Important Examples Early in Trainingcited by 533
  9. 2017A Downsampled Variant of ImageNet as an Alternative to the CIFAR datasetscited by 377
  10. 2018Why ReLU networks yield high-confidence predictions far away from the training data and how to mitigate the problemcited by 323
  11. 2018A disciplined approach to neural network hyper-parameters: Part 1 -- learning rate, batch size, momentum, and weight decaycited by 226
  12. 2020GLISTER: Generalization based Data Subset Selection for Efficient and Robust Learningcited by 226
7 more
  1. 2022DeepCore: A Comprehensive Library for Coreset Selection in Deep Learningcited by 147
  2. 2022Dataset Pruning: Reducing Training Data by Examining Generalization Influencecited by 133
  3. 2020SS-IL: Separated Softmax for Incremental Learningcited by 126
  4. 2018Turning Big data into tiny data: Constant-size coresets for k-means, PCA and projective clusteringcited by 94
  5. 2018AutoPruner: An End-to-End Trainable Filter Pruning Method for Efficient Deep Model Inferencecited by 77
  6. 2020ScaIL: Classifier Weights Scaling for Class Incremental Learningcited by 47
  7. 2023Data Valuation Without Training of a Modelcited by 35

Built on by

Cited by year

Citing papers per year: 2024: 1; 2025: 2.

3 papers.