Accelerating Stochastic Gradient Descent Using Antithetic Sampling
Not on the map. Why?
Abstract (arXiv)
(Mini-batch) Stochastic Gradient Descent is a popular optimization method which has been applied to many machine learning applications. But a rather high variance introduced by the stochastic gradient in each step may slow down the convergence. In this paper, we propose the antithetic sampling strategy to reduce the variance by taking advantage of the internal structure in dataset. Under this new strategy, stochastic gradients in a mini-batch are no longer independent but negatively correlated as much as possible, while the mini-batch stochastic gradient is still an unbiased estimator of full gradient. For the binary classification problems, we just need to calculate the antithetic samples in advance, and reuse the result in each iteration, which is practical. Experiments are provided to confirm the effectiveness of the proposed method.
Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). First posted on arXiv 7 Oct 2018.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2025: 1; 2026: 3.
4 papers.
- 2025Variance Matters: Improving Domain Adaptation via Stratified Samplingcited by 3
- 2026Order Matters: Improving Domain Adaptation by Reordering Datacited by 2
- 2026Variance-reduced Domain Adaptation using Paired Samplingcited by 0
- 2026Online Variance Reduction for Domain Adaptation on Streaming Datacited by 0
- 2026Online Variance Reduction for Domain Adaptation on Streaming Data22 Jul 2026
- 2026Variance-reduced Domain Adaptation using Paired Sampling22 Jul 2026
- 2026Order Matters: Improving Domain Adaptation by Reordering Data6 May 2026
- 2025Variance Matters: Improving Domain Adaptation via Stratified Sampling4 Dec 2025