Two-level Group Convolution
Youngkyu Lee, Jongho Park, Chang-Ock Lee

TL;DR
This paper introduces a two-level group convolution method that maintains high performance even with many groups, improving efficiency and scalability for multi-GPU systems in neural network training.
Contribution
It proposes a novel two-level group convolution approach inspired by numerical analysis, enhancing robustness and efficiency over traditional group convolution methods.
Findings
Robustness to increasing number of groups
Improved execution time and memory efficiency
Better performance compared to existing methods
Abstract
Group convolution has been widely used in order to reduce the computation time of convolution, which takes most of the training time of convolutional neural networks. However, it is well known that a large number of groups significantly reduce the performance of group convolution. In this paper, we propose a new convolution methodology called ``two-level'' group convolution that is robust with respect to the increase of the number of groups and suitable for multi-GPU parallel computation. We first observe that the group convolution can be interpreted as a one-level block Jacobi approximation of the standard convolution, which is a popular notion in the field of numerical analysis. In numerical analysis, there have been numerous studies on the two-level method that introduces an intergroup structure that resolves the performance degradation issue without disturbing parallel computation.…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStochastic Gradient Optimization Techniques · Sparse and Compressive Sensing Techniques · Tensor decomposition and applications
MethodsConvolution
