mlsanityData to 7 Oct 2026

Accelerating Minibatch Stochastic Gradient Descent using Typicality Sampling

arXiv 1903.04192 ↗First posted 11 Mar 2019cs.LG math.OC stat.MLcited by 11

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

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 3; 2022: 1; 2023: 0; 2024: 2; 2025: 4; 2026: 1.

11 papers.