Structured Sparsity of Convolutional Neural Networks via Nonconvex Sparse Group Regularization

• Published in: Frontiers in applied mathematics and statistics Vol. 6
• Main Authors: Bui, Kevin, Park, Fredrick, Zhang, Shuai, Qi, Yingyong, Xin, Jack
• Format: Journal Article
• Language: English
• Published: Frontiers Media S.A 24-02-2021
• Subjects: deep learning; feature selection; nonconvex optimization; sparse group lasso; sparsity
• ISSN: 2297-4687; 2297-4687
• DOI: 10.3389/fams.2020.529564

Convolutional neural networks (CNN) have been hugely successful recently with superior accuracy and performance in various imaging applications, such as classification, object detection, and segmentation. However, a highly accurate CNN model requires millions of parameters to be trained and utilized. Even to increase its performance slightly would require significantly more parameters due to adding more layers and/or increasing the number of filters per layer. Apparently, many of these weight parameters turn out to be redundant and extraneous, so the original, dense model can be replaced by its compressed version attained by imposing inter- and intra-group sparsity onto the layer weights during training. In this paper, we propose a nonconvex family of sparse group lasso that blends nonconvex regularization (e.g., transformed
ℓ
1
,
ℓ
1
−
ℓ
2
, and
ℓ
0
) that induces sparsity onto the individual weights and
ℓ
2,1
regularization onto the output channels of a layer. We apply variable splitting onto the proposed regularization to develop an algorithm that consists of two steps per iteration: gradient descent and thresholding. Numerical experiments are demonstrated on various CNN architectures showcasing the effectiveness of the nonconvex family of sparse group lasso in network sparsification and test accuracy on par with the current state of the art.