Accelerating Minibatch Stochastic Gradient Descent using Typicality Sampling
Not on the map. Why?
Abstract (arXiv)
Machine learning, especially deep neural networks, has been rapidly developed in fields including computer vision, speech recognition and reinforcement learning. Although Mini-batch SGD is one of the most popular stochastic optimization methods in training deep networks, it shows a slow convergence rate due to the large noise in gradient approximation. In this paper, we attempt to remedy this problem by building more efficient batch selection method based on typicality sampling, which reduces the error of gradient estimation in conventional Minibatch SGD. We analyze the convergence rate of the resulting typical batch SGD algorithm and compare convergence properties between Minibatch SGD and the algorithm. Experimental results demonstrate that our batch selection scheme works well and more complex Minibatch SGD variants can benefit from the proposed batch selection strategy.
Key facts. Cited by 11 papers in the map (data through 7 Oct 2026). First posted on arXiv 11 Mar 2019.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 3; 2022: 1; 2023: 0; 2024: 2; 2025: 4; 2026: 1.
11 papers.
- 2024Learning in PINNs: Phase transition, diffusion equilibrium, and generalizationcited by 13
- 2022A Survey of Dataset Refinement for Problems in Computer Vision Datasetscited by 5
- 2025First-Passage Approach to Optimizing Perturbations for Improved Training of Machine Learning Modelscited by 3
- 2025Variance Matters: Improving Domain Adaptation via Stratified Samplingcited by 3
- 2026Order Matters: Improving Domain Adaptation by Reordering Datacited by 2
- 2021Understanding Short-Range Memory Effects in Deep Neural Networkscited by 1
- 2021Drill the Cork of Information Bottleneck by Inputting the Most Important Datacited by 1
- 2024Transfer Learning with Active Sampling for Rapid Training and Calibration in BCI-P300 Across Health States and Multi-centre Datacited by 1
- 2021Some like it tough: Improving model generalization via progressively increasing the training difficultycited by 0
- 2025Water Quality Data Imputation via A Fast Latent Factorization of Tensors with PID-based Optimizercited by 0
- 2025Convergence, Sticking and Escape: Stochastic Dynamics Near Critical Points in SGDcited by 0
- 2026Order Matters: Improving Domain Adaptation by Reordering Data6 May 2026
- 2025Variance Matters: Improving Domain Adaptation via Stratified Sampling4 Dec 2025
- 2025Convergence, Sticking and Escape: Stochastic Dynamics Near Critical Points in SGD24 May 2025
- 2025Water Quality Data Imputation via A Fast Latent Factorization of Tensors with PID-based Optimizer10 Mar 2025
- 2025First-Passage Approach to Optimizing Perturbations for Improved Training of Machine Learning Models6 Feb 2025
- 2024Transfer Learning with Active Sampling for Rapid Training and Calibration in BCI-P300 Across Health States and Multi-centre Data14 Dec 2024
- 2024Learning in PINNs: Phase transition, diffusion equilibrium, and generalization27 Mar 2024
- 2022A Survey of Dataset Refinement for Problems in Computer Vision Datasets21 Oct 2022
- 2021Some like it tough: Improving model generalization via progressively increasing the training difficulty25 Oct 2021
- 2021Drill the Cork of Information Bottleneck by Inputting the Most Important Data15 May 2021
- 2021Understanding Short-Range Memory Effects in Deep Neural Networks5 May 2021