# Depth-wise Decomposition for Accelerating Separable Convolutions in Efficient Convolutional Neural Networks

Source: [Depth-wise Decomposition for Accelerating Separable Convolutions in Efficient Convolutional Neural Networks](<https://www.sota2.com/research/paper/68fa767a1e209131cea6d4b3>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2025-10-26T03:55:27.100Z

Authors: Yihui He, Jianing Qian, Jianren Wang, Cindy X. Le, Congrui Hetang, Qi Lyu, Wenping Wang, Tianwei Yue

Published: 2019-10-21T15:37:53.000Z

## Abstract

Very deep convolutional neural networks (CNNs) have been firmly established as the primary methods for many computer vision tasks. However, most state-of-the-art CNNs are large, which results in high inference latency. Recently, depth-wise separable convolution has been proposed for image recognition tasks on computationally limited platforms such as robotics and self-driving cars. Though it is much faster than its counterpart, regular convolution, accuracy is sacrificed. In this paper, we propose a novel decomposition approach based on SVD, namely depth-wise decomposition, for expanding regular convolutions into depthwise separable convolutions while maintaining high accuracy. We show our approach can be further generalized to the multi-channel and multi-layer cases, based on Generalized Singular Value Decomposition (GSVD) \[59\]. We conduct thorough experiments with the latest ShuffleNet V2 model \[47\] on both random synthesized dataset and a large-scale image recognition dataset: ImageNet \[10\]. Our approach outperforms channel decomposition \[73\] on all datasets. More importantly, our approach improves the Top-1 accuracy of ShuffleNet V2 by ~2%.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/1910.09455>)

[PDF](<https://arxiv.org/pdf/1910.09455.pdf>)
