Vijay Srinivas Tida, Sai Venkatesh Chilukoti, X. Hei, Sonya Hsu
{"title":"核分离转置卷积运算","authors":"Vijay Srinivas Tida, Sai Venkatesh Chilukoti, X. Hei, Sonya Hsu","doi":"10.48550/arXiv.2209.03704","DOIUrl":null,"url":null,"abstract":"Transpose convolution has shown prominence in many deep learning applications. However, transpose convolution layers are computationally intensive due to the increased feature map size due to adding zeros after each element in each row and column. Thus, convolution operation on the expanded input feature map leads to poor utilization of hardware resources. The main reason for unnecessary multiplication operations is zeros at predefined positions in the input feature map. We propose an algorithmic-level optimization technique for the effective transpose convolution implementation to solve these problems. Based on kernel activations, we segregated the original kernel into four sub-kernels. This scheme could reduce memory requirements and unnecessary multiplications. Our proposed method was $3.09 (3.02) \\times$ faster computation using the Titan X GPU (Intel Dual Core CPU) with a flower dataset from the Kaggle website. Furthermore, the proposed optimization method can be generalized to existing devices without additional hardware requirements. A simple deep learning model containing one transpose convolution layer was used to evaluate the optimization method. It showed $2.2 \\times$ faster training using the MNIST dataset with an Intel Dual-core CPU than the conventional implementation.","PeriodicalId":74512,"journal":{"name":"Proceedings of the ... Annual Hawaii International Conference on System Sciences. Annual Hawaii International Conference on System Sciences","volume":"60 1","pages":"6934-6943"},"PeriodicalIF":0.0000,"publicationDate":"2022-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Kernel-Segregated Transpose Convolution Operation\",\"authors\":\"Vijay Srinivas Tida, Sai Venkatesh Chilukoti, X. Hei, Sonya Hsu\",\"doi\":\"10.48550/arXiv.2209.03704\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Transpose convolution has shown prominence in many deep learning applications. However, transpose convolution layers are computationally intensive due to the increased feature map size due to adding zeros after each element in each row and column. Thus, convolution operation on the expanded input feature map leads to poor utilization of hardware resources. The main reason for unnecessary multiplication operations is zeros at predefined positions in the input feature map. We propose an algorithmic-level optimization technique for the effective transpose convolution implementation to solve these problems. Based on kernel activations, we segregated the original kernel into four sub-kernels. This scheme could reduce memory requirements and unnecessary multiplications. Our proposed method was $3.09 (3.02) \\\\times$ faster computation using the Titan X GPU (Intel Dual Core CPU) with a flower dataset from the Kaggle website. Furthermore, the proposed optimization method can be generalized to existing devices without additional hardware requirements. A simple deep learning model containing one transpose convolution layer was used to evaluate the optimization method. It showed $2.2 \\\\times$ faster training using the MNIST dataset with an Intel Dual-core CPU than the conventional implementation.\",\"PeriodicalId\":74512,\"journal\":{\"name\":\"Proceedings of the ... Annual Hawaii International Conference on System Sciences. Annual Hawaii International Conference on System Sciences\",\"volume\":\"60 1\",\"pages\":\"6934-6943\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-09-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the ... Annual Hawaii International Conference on System Sciences. Annual Hawaii International Conference on System Sciences\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.48550/arXiv.2209.03704\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the ... Annual Hawaii International Conference on System Sciences. Annual Hawaii International Conference on System Sciences","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.48550/arXiv.2209.03704","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
摘要
转置卷积在许多深度学习应用中表现突出。然而,转置卷积层的计算量很大,因为由于在每行和每列的每个元素后面添加零而增加了特征映射的大小。因此,对扩展后的输入特征图进行卷积运算,会导致硬件资源利用率较低。不必要的乘法操作的主要原因是输入特征映射中预定义位置的零。为了解决这些问题,我们提出了一种有效的转置卷积算法级优化技术。基于内核激活,我们将原始内核划分为四个子内核。该方案可以减少内存需求和不必要的乘法。我们提出的方法使用Titan X GPU(英特尔双核CPU)和来自Kaggle网站的花数据集,计算速度提高了3.09(3.02)倍。此外,所提出的优化方法可以推广到现有的设备,而不需要额外的硬件要求。使用一个包含一个转置卷积层的简单深度学习模型来评估优化方法。它显示使用MNIST数据集和英特尔双核CPU的训练速度比传统实现快2.2倍。
Transpose convolution has shown prominence in many deep learning applications. However, transpose convolution layers are computationally intensive due to the increased feature map size due to adding zeros after each element in each row and column. Thus, convolution operation on the expanded input feature map leads to poor utilization of hardware resources. The main reason for unnecessary multiplication operations is zeros at predefined positions in the input feature map. We propose an algorithmic-level optimization technique for the effective transpose convolution implementation to solve these problems. Based on kernel activations, we segregated the original kernel into four sub-kernels. This scheme could reduce memory requirements and unnecessary multiplications. Our proposed method was $3.09 (3.02) \times$ faster computation using the Titan X GPU (Intel Dual Core CPU) with a flower dataset from the Kaggle website. Furthermore, the proposed optimization method can be generalized to existing devices without additional hardware requirements. A simple deep learning model containing one transpose convolution layer was used to evaluate the optimization method. It showed $2.2 \times$ faster training using the MNIST dataset with an Intel Dual-core CPU than the conventional implementation.