cs.CVOct 31, 2026

Structured Channel Network Pruning with Bi-Sparse Matrix Factorization

Authors: Jingjing Liu, Ziyang Wang, Xianchao Xiu, Wanquan Liu

Organizations: School of Microelectronics, Shanghai Key Laboratory of Chips and Systems for Intelligent Connected Vehicle, Shanghai University, Shanghai 200444, China · State Key Laboratory of Integrated Chips and Systems, Fudan University, Shanghai 201203, China · School of Mechatronic Engineering and Automation, Shanghai University, Shanghai 200444, China · School of Intelligent Systems Engineering, Sun Yat-sen University, Shenzhen 510275, China

Abstract

Structured channel pruning for convolutional neural networks (CNNs) plays an important role in pattern recognition and deep learning. Nevertheless, existing methods usually calculate channel importance scores based on the magnitudes of individual filters, making it difficult to distinguish shared redundancy from individual channel contributions. To tackle this limitation, we propose a novel structured channel pruning method termed bi-sparse matrix factorization (BSMF). Specifically, BSMF characterizes the convolutional weight matrix as output-channel coefficients over a shared basis with row-wise ℓ2,p\ell_{2,p}-norm and column-wise ℓ2,q\ell_{2,q}-norm regularization terms, respectively. Note that p,q∈[0,1)p,q\in[0,1), which, to our best knowledge, has not been explored in the literature. To solve the resulting non-convex optimization problem, we develop an efficient update scheme built upon the alternating direction method of multipliers (ADMM), in which all subproblems admit closed-form solutions. After that, a compact CNN is obtained by reconstructing the convolutional filters from the learned factors and discarding the redundant channels. Extensive experiments on the CIFAR-10 and ImageNet-1K datasets demonstrate that our proposed BSMF achieves significant network compression while maintaining high reconstruction accuracy. The source code is publicly available at https://github.com/xianchaoxiu/BSMF

Figures & tables

Explore similar work

CardsList
  1. Bonsai: A Framework for Convolutional Neural Network Acceleration Using Criterion-Based Pruning

    Feb 19, 2026Joseph Bingham, Sam HelmichNeural Network PruningEfficient Neural Network Inference

  2. BaCP: Backbone Contrastive Pruning for Preserving Representations in Extremely Sparse Neural Networks

    Oct 1, 2026Mohammad Haroon Khawaja, Muhammad Haseeb, Mohammad Fatim Shoaib +1Neural Network PruningSparse Neural Networks

  3. BMuon: Budgeting Muon's Spectral Geometry for Structured Compressibility

    Oct 16, 2026Rida Assalouh, Tom Jacobs, Rebekka Burkholz +2Muon OptimizerStructured Sparsity