Grow-push-prune: Aligning deep discriminants for effective structural network compression

被引:7
作者
Tian, Qing [1 ,2 ]
Arbel, Tal [2 ]
Clark, James J. [2 ]
机构
[1] Bowling Green State Univ, Dept Comp Sci, Hayes Hall, Bowling Green, OH 43403 USA
[2] McGill Univ, Ctr Intelligent Machines, 3480 Univ St, Montreal, PQ H3A 0E9, Canada
基金
美国国家科学基金会;
关键词
Deep neural network pruning; Deep discriminant analysis; Deep representation learning; NEURAL-NETWORKS; ACCELERATION;
D O I
10.1016/j.cviu.2023.103682
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Most of today's popular deep architectures are hand-engineered to be generalists. However, this design procedure usually leads to massive redundant, useless, or even harmful features for specific tasks. Unnecessarily high complexities render deep nets impractical for many real-world applications, especially those without powerful GPU support. In this paper, we attempt to derive task-dependent compact models from a deep discriminant analysis perspective. We propose an iterative and proactive approach for classification tasks which alternates between specialIntscript a pushing step, with an objective to simultaneously maximize class separation, penalize co-variances, and push deep discriminants into alignment with a compact set of neurons, and specialIntscript a pruning step, which discards less useful or even interfering neurons. Deconvolution is adopted to reverse 'unimportant' filters' effects and recover useful contributing sources. A simple network growing strategy based on the basic Inception module is proposed for challenging tasks requiring larger capacity than what the base net can offer. Experiments on the MNIST, CIFAR10, and ImageNet datasets demonstrate our approach's efficacy. On ImageNet, by pushing and pruning our grown Inception-88 model, we achieve more accurate models than Inception nets generated during growing, residual nets, and popular compact nets at similar sizes. We also show that our grown Inception nets (without hard-coded dimension alignment) clearly outperform residual nets of similar complexities.
引用
收藏
页数:14
相关论文
共 96 条
[1]  
[Anonymous], 2013, PMLR
[2]  
Anwar S, 2015, Arxiv, DOI [arXiv:1512.08571, DOI 10.48550/ARXIV.1512.08571]
[3]  
Baker B, 2017, Arxiv, DOI arXiv:1611.02167
[4]  
Belilovsky E, 2019, PR MACH LEARN RES, V97
[5]   Towards Efficient Model Compression via Learned Global Ranking [J].
Chin, Ting-Wu ;
Ding, Ruizhou ;
Zhang, Cha ;
Marculescu, Diana .
2020 IEEE/CVF CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR), 2020, :1515-1525
[6]   Xception: Deep Learning with Depthwise Separable Convolutions [J].
Chollet, Francois .
30TH IEEE CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR 2017), 2017, :1800-1807
[7]  
Courbariaux M, 2015, ADV NEUR IN, V28
[8]  
Denton E, 2014, ADV NEUR IN, V27
[9]  
Eldan Ronen, 2016, C LEARNING THEORY, P907
[10]   The use of multiple measurements in taxonomic problems [J].
Fisher, RA .
ANNALS OF EUGENICS, 1936, 7 :179-188