Batch-Expansion Training: An Efficient Optimization Framework
Not on the map. Why?
Abstract (arXiv)
We propose Batch-Expansion Training (BET), a framework for running a batch optimizer on a gradually expanding dataset. As opposed to stochastic approaches, batches do not need to be resampled i.i.d. at every iteration, thus making BET more resource efficient in a distributed setting, and when disk-access is constrained. Moreover, BET can be easily paired with most batch optimizers, does not require any parameter-tuning, and compares favorably to existing stochastic and batch methods. We show that when the batch size grows exponentially with the number of outer iterations, BET achieves optimal O(1/ε) data-access convergence rate for strongly convex objectives. Experiments in parallel and distributed settings show that BET performs better than standard batch and stochastic approaches.
Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). First posted on arXiv 22 Apr 2017.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 2; 2022: 1; 2023: 0; 2024: 1.
4 papers.
- 2021LocalNewton: Reducing Communication Bottleneck for Distributed Learningcited by 15
- 2022Stochastic Variance-Reduced Newton: Accelerating Finite-Sum Minimization with Large Batchescited by 9
- 2024Second-order Information Promotes Mini-Batch Robustness in Variance-Reduced Gradientscited by 3
- 2021Exploiting Local Convergence of Quasi-Newton Methods Globally: Adaptive Sample Size Approachcited by 2
- 2024Second-order Information Promotes Mini-Batch Robustness in Variance-Reduced Gradients23 Apr 2024
- 2022Stochastic Variance-Reduced Newton: Accelerating Finite-Sum Minimization with Large Batches6 Jun 2022
- 2021Exploiting Local Convergence of Quasi-Newton Methods Globally: Adaptive Sample Size Approach10 Jun 2021
- 2021LocalNewton: Reducing Communication Bottleneck for Distributed Learning16 May 2021