Papers
Topics
Authors
Recent
Search
2000 character limit reached

Minibatch training of neural network ensembles via trajectory sampling

Published 23 Jun 2023 in cond-mat.stat-mech, cond-mat.dis-nn, and cs.LG | (2306.13442v2)

Abstract: 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.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (22)
  1. I. Goodfellow, Y. Bengio, and A. Courville, Deep Learning (MIT Press, 2016).
  2. Y. Wen, D. Tran, and J. Ba, Batchensemble: An alternative approach to efficient ensemble and lifelong learning, arXiv:2002.06715  (2020).
  3. J. F. Mair, D. C. Rose, and J. P. Garrahan, Training neural network ensembles via trajectory sampling, arXiv:2209.11116  (2022).
  4. D. Chandler and J. P. Garrahan, Dynamics on the Way to Forming Glass: Bubbles in Space-Time, Annu. Rev. Phys. Chem. 61, 191 (2010).
  5. H. Touchette, The large deviation approach to statistical mechanics, Phys. Rep. 478, 1 (2009).
  6. J. Grela, S. N. Majumdar, and G. Schehr, Non-intersecting brownian bridges in the flat-to-flat geometry, J. Stat. Phys. 183, 49 (2021).
  7. B. De Bruyne, S. N. Majumdar, and G. Schehr, Generating discrete-time constrained random walks and lévy flights, Phys. Rev. E 104, 024117 (2021).
  8. L. Bottou, Large-scale machine learning with stochastic gradient descent, in Proceedings of COMPSTAT’2010, edited by Y. Lechevallier and G. Saporta (Physica-Verlag HD, Heidelberg, 2010) pp. 177–186.
  9. A. Korattikara, Y. Chen, and M. Welling, Austerity in mcmc land: Cutting the metropolis-hastings budget, arXiv:1304.5299  (2014).
  10. R. Bardenet, A. Doucet, and C. Holmes, On markov chain monte carlo methods for tall data, J. Mach. Learn. Res. 18 (2017).
  11. L. Deng, The mnist database of handwritten digit images for machine learning research, IEEE Signal Processing Magazine 29, 141 (2012).
  12. G. Folena, A. Manacorda, and F. Zamponi, Introduction to the dynamics of disordered systems: Equilibrium and gradient descent, Physica A: , 128152 (2022).
  13. E. Bengio, J. Pineau, and D. Precup, Interference and generalization in temporal difference learning, arXiv:2003.06350  (2020).
  14. M. McCloskey and N. J. Cohen, Catastrophic interference in connectionist networks: The sequential learning problem (Academic Press, 1989) pp. 109–165.
  15. S. Mei, A. Montanari, and P.-M. Nguyen, A mean field view of the landscape of two-layer neural networks, Proc. Natl. Acad. Sci. USA 115, E7665 (2018).
  16. G. Rotskoff and E. Vanden-Eijnden, Trainability and accuracy of artificial neural networks: An interacting particle system approach, Commun. Pure. Appl. Math. 75, 1889 (2022).
  17. C. Baldassi and R. Zecchina, Efficiency of quantum vs. classical annealing in nonconvex learning problems, Proc. Natl. Acad. Sci. USA 115, 1457 (2018).
  18. J. Mair, TransitionPathSampling.jl, Available at https://github.com/JamieMair/TransitionPathSampling.jl  (a).
  19. J. Mair, MinibatchTPS.jl, Available at https://github.com/JamieMair/MinibatchTPS.jl  (b).
  20. T. Besard, C. Foket, and B. De Sutter, Effective extensible programming: Unleashing Julia on GPUs, IEEE Trans. Parallel. Distrib. Syst. 30, 827 (2018).
  21. S. Danisch and J. Krumbiegel, Makie.jl: Flexible high-performance data visualization for Julia, J. Open Source Softw. 6, 3349 (2021).
  22. J. Revels, M. Lubin, and T. Papamarkou, Forward-mode automatic differentiation in Julia, arXiv:1607.0789  (2016).

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.