Model Parallel Training and Transfer Learning for Convolutional Neural Networks by Domain Decomposition
Not on the map. Why?
Abstract (arXiv)
Deep convolutional neural networks (CNNs) have been shown to be very successful in a wide range of image processing applications. However, due to their increasing number of model parameters and an increasing availability of large amounts of training data, parallelization strategies to efficiently train complex CNNs are necessary. In previous work by the authors, a novel model parallel CNN architecture was proposed which is loosely inspired by domain decomposition. In particular, the novel network architecture is based on a decomposition of the input data into smaller subimages. For each of these subimages, local CNNs with a proportionally smaller number of parameters are trained in parallel and the resulting local classifications are then aggregated in a second step by a dense feedforward neural network (DNN). In the present work, we compare the resulting CNN-DNN architecture to less costly alternatives to combine the local classifications into a final, global decision. Additionally, we investigate the performance of the CNN-DNN trained as one coherent model as well as using a transfer learning strategy, where the parameters of the pre-trained local CNNs are used as initial values for a subsequently trained global coherent CNN-DNN model.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 5 of its 13 references that are in the map. First posted on arXiv 26 Aug 2024.
Builds on
5 of 13 references.
References · 5
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,267
- 2017Visualizing the Loss Landscape of Neural Netscited by 1,126
- 2018Demystifying Parallel and Distributed Deep Learning: An In-Depth Concurrency Analysiscited by 154
- 2020MosMedData: Chest CT Scans With COVID-19 Related Findings Datasetcited by 103
Built on by
Citing papers per year: 2024: 1; 2025: 0; 2026: 1.
2 papers.