Newton methods based convolution neural networks using parallel processing
Not on the map. Why?
Abstract (arXiv)
Training of convolutional neural networks is a high dimensional and a non-convex optimization problem. At present, it is inefficient in situations where parametric learning rates can not be confidently set. Some past works have introduced Newton methods for training deep neural networks. Newton methods for convolutional neural networks involve complicated operations. Finding the Hessian matrix in second-order methods becomes very complex as we mainly use the finite differences method with the image data. Newton methods for convolutional neural networks deals with this by using the sub-sampled Hessian Newton methods. In this paper, we have used the complete data instead of the sub-sampled methods that only handle partial data at a time. Further, we have used parallel processing instead of serial processing in mini-batch computations. The results obtained using parallel processing in this study, outperform the time taken by the previous approach.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 9 of its 56 references that are in the map. First posted on arXiv 2 Dec 2021.
Builds on
9 of 56 references.
References · 9
- 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,267
- 2017Practical Gauss-Newton Optimisation for Deep Learningcited by 139
- 2017Non-convex Optimization for Machine Learningcited by 132
- 2019Learning Internal Representations (COLT 1995)cited by 25
- 2018A Newton-CG Algorithm with Complexity Guarantees for Smooth Unconstrained Optimizationcited by 23
- 2013Training Neural Networks with Stochastic Hessian-Free Optimizationcited by 9
- 2018Distributed Newton Methods for Deep Neural Networkscited by 2
- 2018Newton Methods for Convolutional Neural Networkscited by 2
- 2016Distributed Hessian-Free Optimization for Deep Neural Networkcited by 1
Built on by
Not cited yet.