Minibatch training of neural network ensembles via trajectory sampling
Not on the map. Why?
Abstract (arXiv)
Most iterative neural network training methods use estimates of the loss function over small random subsets (or minibatches) of the data to update the parameters, which aid in decoupling the training time from the (often very large) size of the training datasets. Here, we show that a minibatch approach can also be used to train neural network ensembles (NNEs) via trajectory methods in a highly efficient manner. We illustrate this approach by training NNEs to classify images in the MNIST datasets. This method gives an improvement to the training times, allowing it to scale as the ratio of the size of the dataset to that of the average minibatch size which, in the case of MNIST, gives a computational improvement typically of two orders of magnitude. We highlight the advantage of using longer trajectories to represent NNEs, both for improved accuracy in inference and reduced update cost in terms of the samples needed in minibatch updates.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 19 of its 44 references that are in the map. First posted on arXiv 23 Jun 2023.
Builds on
19 of 44 references.
References · 19
- 2023LLaMA: Open and Efficient Foundation Language Modelscited by 14,132
- 2022Self-Instruct: Aligning Language Models with Self-Generated Instructionscited by 2,724
- 2021Scaling Language Models: Methods, Analysis & Insights from Training Gophercited by 1,202
- 2018A Mean Field View of the Landscape of Two-Layers Neural Networkscited by 466
- 2020BatchEnsemble: An Alternative Approach to Efficient Ensemble and Lifelong Learningcited by 371
- 2020Towards Continual Reinforcement Learning: A Review and Perspectivescited by 274
- 2023Summary of ChatGPT-Related Research and Perspective Towards the Future of Large Language Modelscited by 154
- 2018Trainability and Accuracy of Neural Networks: An Interacting Particle System Approachcited by 106
- 2015On Markov chain Monte Carlo methods for tall datacited by 50
- 2022Phase diagram of Stochastic Gradient Descent in high-dimensional two-layer neural networkscited by 50
- 2020Interference and Generalization in Temporal Difference Learningcited by 42
- 2020Wisdom of Committees: An Overlooked Approach To Faster and More Accurate Modelscited by 39
7 more
- 2013Austerity in MCMC Land: Cutting the Metropolis-Hastings Budgetcited by 24
- 2017Effective Extensible Programming: Unleashing Julia on GPUscited by 16
- 2016An Efficient Minibatch Acceptance Test for Metropolis-Hastingscited by 11
- 2020Correspondence between neuroevolution and gradient descentcited by 11
- 2017Efficiency of quantum versus classical annealing in non-convex learning problemscited by 8
- 2023Machine learning in and out of equilibriumcited by 5
- 2022Training neural network ensembles via trajectory samplingcited by 2
Built on by
Not cited yet.