mlsanityData to 14 Oct 2026

AdaSelection: Accelerating Deep Learning Training through Data Subsampling

arXiv 2306.10728 ↗First posted 19 Jun 2023cs.LGcited by 3

Not on the map. Why?

Abstract (arXiv)

In this paper, we introduce AdaSelection, an adaptive sub-sampling method to identify the most informative sub-samples within each minibatch to speed up the training of large-scale deep learning models without sacrificing model performance. Our method is able to flexibly combines an arbitrary number of baseline sub-sampling methods incorporating the method-level importance and intra-method sample-level importance at each iteration. The standard practice of ad-hoc sampling often leads to continuous training with vast amounts of data from production environments. To improve the selection of data instances during forward and backward passes, we propose recording a constant amount of information per instance from these passes. We demonstrate the effectiveness of our method by testing it across various types of inputs and tasks, including the classification tasks on both image and language datasets, as well as regression tasks. Compared with industry-standard baselines, AdaSelection consistently displays superior performance.

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

Builds on

18 of 25 references.

References · 18

  1. 2017Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networkscited by 4,897
  2. 2016Pointer Sentinel Mixture Modelscited by 3,096
  3. 2017A Closer Look at Memorization in Deep Networkscited by 942
  4. 2022Beyond neural scaling laws: beating power law scaling via data pruningcited by 528
  5. 2014SAGA: A Fast Incremental Gradient Method With Support for Non-Strongly Convex Composite Objectivescited by 402
  6. 2018Not All Samples Are Created Equal: Deep Learning with Importance Samplingcited by 328
  7. 2022Prioritized Training on Points that are Learnable, Worth Learning, and Not Yet Learntcited by 236
  8. 2019Accelerating Deep Learning by Focusing on the Biggest Loserscited by 94
  9. 2014Stochastic Optimization with Importance Samplingcited by 91
  10. 2015Variance Reduction in SGD by Distributed Importance Samplingcited by 79
  11. 2020Meta-Learning with Adaptive Hyperparameterscited by 79
  12. 2018Bayesian Coreset Construction via Greedy Iterative Geodesic Ascentcited by 68
6 more
  1. 2019Bayesian Batch Active Learning as Sparse Subset Approximationcited by 68
  2. 2019Learning to Balance: Bayesian Meta-Learning for Imbalanced and Out-of-distribution Taskscited by 48
  3. 2015Variance Reduced Stochastic Gradient Descent with Neighborscited by 39
  4. 2020Choosing the Sample with Lowest Loss makes SGD Robustcited by 26
  5. 2021One Backward from Ten Forward, Subsampling for Large-Scale Deep Learningcited by 4
  6. 2013AdaBoost and Forward Stagewise Regression are First-Order Convex Optimization Methodscited by 2

Built on by

Cited by year

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

3 papers.