mlsanityData to 7 Oct 2026

One Backward from Ten Forward, Subsampling for Large-Scale Deep Learning

arXiv 2104.13114 ↗First posted 27 Apr 2021cs.LGcited by 4

Not on the map. Why?

Abstract (arXiv)

Deep learning models in large-scale machine learning systems are often continuously trained with enormous data from production environments. The sheer volume of streaming training data poses a significant challenge to real-time training subsystems and ad-hoc sampling is the standard practice. Our key insight is that these deployed ML systems continuously perform forward passes on data instances during inference, but ad-hoc sampling does not take advantage of this substantial computational effort. Therefore, we propose to record a constant amount of information per instance from these forward passes. The extra information measurably improves the selection of which data instances should participate in forward and backward passes. A novel optimization framework is proposed to analyze this problem and we provide an efficient approximation algorithm under the framework of Mini-batch gradient descent as a practical solution. We also demonstrate the effectiveness of our framework and algorithm on several large-scale classification and regression tasks, when compared with competitive baselines widely used in industry.

Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 33 of its 62 references that are in the map. First posted on arXiv 27 Apr 2021.

Builds on

33 of 62 references.

References · 33

  1. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  2. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
  3. 2018MobileNetV2: Inverted Residuals and Linear Bottleneckscited by 4,773
  4. 2017MobileNets: Efficient Convolutional Neural Networks for Mobile Vision Applicationscited by 3,827
  5. 2015FaceNet: A Unified Embedding for Face Recognition and Clusteringcited by 2,833
  6. 2016Inception-v4, Inception-ResNet and the Impact of Residual Connections on Learningcited by 1,509
  7. 2015Prioritized Experience Replaycited by 1,070
  8. 2016An overview of gradient descent optimization algorithmscited by 1,021
  9. 2018MnasNet: Platform-Aware Neural Architecture Search for Mobilecited by 937
  10. 2016Training Region-based Object Detectors with Online Hard Example Miningcited by 577
  11. 2018Not All Samples Are Created Equal: Deep Learning with Importance Samplingcited by 323
  12. 2020Coresets via Bilevel Optimization for Continual Learning and Streamingcited by 191
21 more
  1. 2015Online Batch Selection for Faster Training of Neural Networkscited by 121
  2. 2018Learning Tree-based Deep Model for Recommender Systemscited by 99
  3. 2019Accelerating Deep Learning by Focusing on the Biggest Loserscited by 94
  4. 2014Stochastic Optimization with Importance Samplingcited by 91
  5. 2015Variance Reduction in SGD by Distributed Importance Samplingcited by 79
  6. 2016Coresets for Scalable Bayesian Logistic Regressioncited by 79
  7. 2018Bayesian Coreset Construction via Greedy Iterative Geodesic Ascentcited by 68
  8. 2019Bayesian Batch Active Learning as Sparse Subset Approximationcited by 68
  9. 2019RecVAE: a New Variational Autoencoder for Top-N Recommendations with Implicit Feedbackcited by 63
  10. 2017Automated Scalable Bayesian Inference via Hilbert Coresetscited by 55
  11. 2019Small-GAN: Speeding Up GAN Training Using Core-setscited by 40
  12. 2013A Statistical Perspective on Algorithmic Leveragingcited by 38
  13. 2019Joint Optimization of Tree-based Index and Deep Model for Recommender Systemscited by 37
  14. 2017Optimal Subsampling for Large Sample Logistic Regressioncited by 28
  15. 2020Choosing the Sample with Lowest Loss makes SGD Robustcited by 26
  16. 2018Are All Training Examples Created Equal? An Empirical Studycited by 16
  17. 2013Local case-control sampling: Efficient subsampling in imbalanced data setscited by 13
  18. 2019Coresets for Clustering in Graphs of Bounded Treewidthcited by 9
  19. 2014Fast and Robust Least Squares Estimation in Corrupted Linear Modelscited by 8
  20. 2019Lsh-sampling Breaks the Computation Chicken-and-egg Loop in Adaptive Stochastic Gradient Estimationcited by 2
  21. 2015Optimal Subsampling Approaches for Large Sample Linear Regressioncited by 1

Built on by

Cited by year

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

4 papers.