Pruning networks at once via nuclear norm-based regularization and bi-level optimization

被引:0
|
作者
Lee, Donghyeon [1 ]
Lee, Eunho [1 ]
Kang, Jaehyuk [1 ]
Hwang, Youngbae [1 ]
机构
[1] Chungbuk Natl Univ, Dept Intelligent Syst & Robot, 1 Chungdae Ro, Cheongju 28644, South Korea
关键词
Network pruning; Pruning from scratch; Nuclear norm-based regularization; Shared pruning module;
D O I
10.1016/j.cviu.2024.104247
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Most network pruning methods focus on identifying redundant channels from pre-trained models, which is inefficient due to its three-step process: pre-training, pruning and fine-tuning, and reconfiguration. In this paper, we propose a pruning-from-scratch framework that unifies these processes into a single approach. We introduce nuclear norm-based regularization to maintain the representational capacity of large networks during pruning. Combining this with MACs-based regularization enhances the performance of the pruned network at the target compression rate. Our bi-level optimization approach simultaneously improves pruning efficiency and representation capacity. Experimental results show that our method achieves 75.4% accuracy on ImageNet without a pre-trained network, using only 41% of the original model's computational cost. It also attains 0.5% higher performance in compressing the SSD network for object detection. Furthermore, we analyze the effects of nuclear norm-based regularization.
引用
收藏
页数:11
相关论文
共 50 条
  • [1] Advancing Model Pruning via Bi-level Optimization
    Zhang, Yihua
    Yao, Yuguang
    Ram, Parikshit
    Zhao, Pu
    Chen, Tianlong
    Hong, Mingyi
    Wang, Yanzhi
    Liu, Sijia
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 35 (NEURIPS 2022), 2022,
  • [2] LABO: Towards Learning Optimal Label Regularization via Bi-level Optimization
    Lu, Peng
    Rashid, Ahmad
    Kobyzev, Ivan
    Rezagholizadeh, Mehdi
    Langlais, Philippe
    FINDINGS OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS, ACL 2023, 2023, : 5759 - 5774
  • [3] Joint filter and channel pruning of convolutional neural networks as a bi-level optimization problem
    Hassen Louati
    Ali Louati
    Slim Bechikh
    Elham Kariri
    Memetic Computing, 2024, 16 : 71 - 90
  • [4] Joint filter and channel pruning of convolutional neural networks as a bi-level optimization problem
    Louati, Hassen
    Louati, Ali
    Bechikh, Slim
    Kariri, Elham
    MEMETIC COMPUTING, 2024, 16 (01) : 71 - 90
  • [5] Efficient Architecture Search via Bi-Level Data Pruning
    Tu, Chongjun
    Ye, Peng
    Lin, Weihao
    Ye, Hancheng
    Yu, Chong
    Chen, Tao
    Li, Baopu
    Ouyang, Wanli
    IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY, 2025, 35 (02) : 1265 - 1275
  • [6] Robust Watermarking for Deep Neural Networks via Bi-level Optimization
    Yang, Peng
    Lao, Yingjie
    Li, Ping
    2021 IEEE/CVF INTERNATIONAL CONFERENCE ON COMPUTER VISION (ICCV 2021), 2021, : 14821 - 14830
  • [7] Efficient Regularization Parameter Selection for Latent Variable Graphical Models via Bi-Level Optimization
    Giesen, Joachim
    Nussbaum, Frank
    Schneider, Christopher
    PROCEEDINGS OF THE TWENTY-EIGHTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2019, : 2378 - 2384
  • [8] Pruning Parameterization with Bi-level Optimization for Efficient Semantic Segmentation on the Edge
    Yang, Changdi
    Zhao, Pu
    Li, Yanyu
    Niu, Wei
    Guan, Jiexiong
    Tang, Hao
    Qin, Minghai
    Ren, Bin
    Lin, Xue
    Wang, Yanzhi
    2023 IEEE/CVF CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR), 2023, : 15402 - 15412
  • [9] Tensor Nuclear Norm-Based Low-Rank Approximation With Total Variation Regularization
    Chen, Yongyong
    Wang, Shuqin
    Zhou, Yicong
    IEEE JOURNAL OF SELECTED TOPICS IN SIGNAL PROCESSING, 2018, 12 (06) : 1364 - 1377
  • [10] Bi-Level Optimization Model for Greener Transportation by Vehicular Networks
    Liu, Kun
    Li, Jianqing
    Li, Wenting
    Zheng, Zhigao
    MOBILE NETWORKS & APPLICATIONS, 2023, 28 (04): : 1349 - 1361