Fetching the paper…
Reading the bibliography…
We propose a novel network pruning approach by information preserving of pre-trained network weights (filters).
Y. LeCun, J. S. Denker, and S. A. Solla, “Optimal brain damage,” in Proceedings of the Advances in Neural Information Processing Systems (NeurIPS) , 1990, pp. 598–605
1990
Earlier work this paper cites.
B. Hassibi and D. G. Stork, “Second order derivatives for network pruning: optimal brain surgeon,” in Proceedings of the Advances in Neural Information Processing Systems (NeurIPS) , 1992, pp. 164–171
1992
Earlier work this paper cites.
J. Sum, L.-w. Chan, C.-s. Leung, and G. H. Young, “Extended kalman filter–based pruning method for recurrent neural networks,” Neural Computation , vol. 10, no. 6, pp. 1481–1505, 1998
1998
Earlier work this paper cites.
J. Sum, C.-s. Leung, G. H. Young, and W.-k. Kan, “On the kalman filtering method in neural network training and pruning,” IEEE Transactions on Neural Networks and Learning Systems (TNNLS) , vol. 10, no. 1, pp. 161–166, 1999
1999
Earlier work this paper cites.
J. Sum, C.-s. Leung, G. H. Young, L.-w. Chan, and W.-k. Kan, “An adaptive bayesian pruning for neural networks in a non-stationary environment,” Neural Computation , vol. 11, no. 4, pp. 965–976, 1999
1999
Earlier work this paper cites.
P. Drineas and R. Kannan, “Pass efficient algorithms for approximating large matrices.” in Proceedings of the ACM-SIAM Symposium On Discrete Algorithms (SODA) , 2003, pp. 223–232
2003
Earlier work this paper cites.
A. Frieze, R. Kannan, and S. Vempala, “Fast monte-carlo algorithms for finding low-rank approximations,” Journal of the ACM (JACM) , vol. 51, no. 6, pp. 1025–1041, 2004
2004
Earlier work this paper cites.
T. Sarlos, “Improved approximation algorithms for large matrices via random projections,” in Proceedings of the IEEE Symposium on Foundations of Computer Science (FOCS) , 2006, pp. 143–152
2006
Earlier work this paper cites.
A. Krizhevsky, G. Hinton et al. , “Learning multiple layers of features from tiny images,” University of Toronto, Toronto, ON, Canada, Tech. Rep., 01 2009
2009
Earlier work this paper cites.
X. Glorot and Y. Bengio, “Understanding the difficulty of training deep feedforward neural networks,” in Proceedings of the International Conference on Artificial Intelligence and Statistics (AISTATS) , 2010, pp. 249–256
2010
Earlier work this paper cites.
E. Liberty, “Simple and deterministic matrix sketching,” in Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (ACM SIGKDD) , 2013, pp. 581–588
2013
Earlier work this paper cites.
2015
Earlier work this paper cites.
S. Han, J. Pool, J. Tran, and W. Dally, “Learning both weights and connections for efficient neural network,” in Proceedings of the Advances in Neural Information Processing Systems (NeurIPS) , 2015, pp. 1135–1143
2015
Earlier work this paper cites.
A. Polyak and L. Wolf, “Channel-level acceleration of deep face representations,” IEEE Access , no. 3, pp. 2163–2175, 2015
2015
Earlier work this paper cites.
K. He, X. Zhang, S. Ren, and J. Sun, “Delving deep into rectifiers: Surpassing human-level performance on imagenet classification,” in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR) , 2015, pp. 1026–1034
2015
Earlier work this paper cites.
C. Szegedy, W. Liu, Y. Jia, P. Sermanet, S. Reed, D. Anguelov, D. Erhan, V. Vanhoucke, and A. Rabinovich, “Going deeper with convolutions,” in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR) , 2015, pp. 1–9
2015
Earlier work this paper cites.
O. Russakovsky, J. Deng, H. Su, J. Krause, S. Satheesh, S. Ma, Z. Huang, A. Karpathy, A. Khosla, M. Bernstein et al. , “Imagenet large scale visual recognition challenge,” Proceedings of the International Journal of Computer Vision (IJCV) , vol. 115, no. 3, pp. 211–252, 2015
2015
Earlier work this paper cites.
2016
Earlier work this paper cites.
J. M. Alvarez and M. Salzmann, “Learning the number of neurons in deep networks,” in Proceedings of the Advances in Neural Information Processing Systems (NeurIPS) , 2016, pp. 2270–2278
2016
Earlier work this paper cites.
K. He, X. Zhang, S. Ren, and J. Sun, “Deep residual learning for image recognition,” in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR) , 2016, pp. 770–778
2016
Cited alongside, same era.
J. Cheng, J. Wu, C. Leng, Y. Wang, and Q. Hu, “Quantized cnn: A unified approach to accelerate and compress convolutional networks,” IEEE Transactions on Neural Networks and Learning Systems (TNNLS) , vol. 29, no. 10, pp. 4730–4743, 2017
2017
Cited alongside, same era.
Z. Liu, J. Li, Z. Shen, G. Huang, S. Yan, and C. Zhang, “Learning efficient convolutional networks through network slimming,” in Proceedings of the IEEE International Conference on Computer Vision (ICCV) , 2017, pp. 2736–2744
2017
Cited alongside, same era.
H. Li, A. Kadav, I. Durdanovic, H. Samet, and H. P. Graf, “Pruning filters for efficient convnets,” in Proceedings of the International Conference on Learning Representations (ICLR) , 2017
2017
Cited alongside, same era.
S. Lin, R. Ji, C. Yan, B. Zhang, L. Cao, Q. Ye, F. Huang, and D. Doermann, “Towards optimal structured cnn pruning via generative adversarial learning,” in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR) , 2019, pp. 2790–2799
2019
Later among the works it cites.
J. Zhang, Z. Feng, Y. Su, and M. Xing, “Discriminative saliency-pose-attention covariance for action recognition,” in Proceedings of the IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP) . IEEE, 2019, pp. 2132–2136
2019
Later among the works it cites.
C.-X. Ren, J. Feng, D.-Q. Dai, and S. Yan, “Heterogeneous domain adaptation via covariance structured feature translators,” IEEE Transactions on Cybernetics (T-Cybernetics) , 2019
2019
Later among the works it cites.
J. Frankle and M. Carbin, “The lottery ticket hypothesis: Finding sparse, trainable neural networks,” in Proceedings of the International Conference on Learning Representations (ICLR) , 2019
2019
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Y. He, X. Zhang, and J. Sun, “Channel pruning for accelerating very deep neural networks,” in Proceedings of the IEEE International Conference on Computer Vision (ICCV) , 2017, pp. 1389–1397
2017
Cited alongside, same era.
J.-H. Luo, J. Wu, and W. Lin, “Thinet: A filter level pruning method for deep neural network compression,” in Proceedings of the IEEE International Conference on Computer Vision (ICCV) , 2017, pp. 5058–5066
2017
Cited alongside, same era.
Y. Sun, L. Zheng, W. Deng, and S. Wang, “Svdnet for pedestrian retrieval,” in Proceedings of the IEEE International Conference on Computer Vision (ICCV) , 2017, pp. 3800–3808
2017
Cited alongside, same era.
X. Dong, S. Chen, and S. Pan, “Learning to prune deep neural networks via layer-wise optimal brain surgeon,” in Proceedings of the Advances in Neural Information Processing Systems (NeurIPS) , 2017, pp. 4857–4867
2017
Cited alongside, same era.
Z. Huang and N. Wang, “Data-driven sparse structure selection for deep neural networks,” in Proceedings of the European Conference on Computer Vision (ECCV) , 2018, pp. 304–320
2018
Cited alongside, same era.
J.-H. Kim, J. Jun, and B.-T. Zhang, “Bilinear attention networks,” in Proceedings of the Advances in Neural Information Processing Systems (NeurIPS) , 2018, pp. 1564–1574
2018
Cited alongside, same era.
Z. Liu, J. Xu, X. Peng, and R. Xiong, “Frequency-domain dynamic pruning for convolutional neural networks,” in Proceedings of the Advances in Neural Information Processing Systems (NeurIPS) , 2018, pp. 1043–1053
2018
Cited alongside, same era.
R. Yu, A. Li, C.-F. Chen, J.-H. Lai, V. I. Morariu, X. Han, M. Gao, C.-Y. Lin, and L. S. Davis, “Nisp: Pruning networks using neuron importance score propagation,” in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR) , 2018, pp. 9194–9203
2018
Cited alongside, same era.
Later among the works it cites.
X. Ding, G. Ding, Y. Guo, and J. Han, “Centripetal sgd for pruning very deep convolutional networks with complicated structure,” in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR) , 2019, pp. 4943–4953
2019
Later among the works it cites.
C. Wang, R. Grosse, S. Fidler, and G. Zhang, “Eigendamage: Structured pruning in the kronecker-factored eigenbasis,” in Proceedings of the International Conference on Machine Learning (ICML) , 2019, pp. 6566–6575
2019
Later among the works it cites.
Y. He, P. Liu, Z. Wang, Z. Hu, and Y. Yang, “Filter pruning via geometric median for deep convolutional neural networks acceleration,” in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR) , 2019, pp. 4340–4349
2019
Later among the works it cites.
H. Peng, J. Wu, S. Chen, and J. Huang, “Collaborative channel pruning for deep networks,” in Proceedings of the International Conference on Machine Learning (ICML) , 2019, pp. 5113–5122
2019
Later among the works it cites.
Z. He and D. Fan, “Simultaneously optimizing weight and quantizer of ternary neural network using truncated gaussian approximation,” in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR) , 2019, pp. 11 438–11 446
2019
Later among the works it cites.
2019
Later among the works it cites.
Z. Liu, H. Mu, X. Zhang, Z. Guo, X. Yang, K.-T. Cheng, and J. Sun, “Metapruning: Meta learning for automatic neural network channel pruning,” in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR) , 2019, pp. 3296–3305
2019
Later among the works it cites.
X. Ding, G. Ding, Y. Guo, J. Han, and C. Yan, “Approximated oracle filter pruning for destructive cnn width optimization,” in Proceedings of the International Conference on Machine Learning (ICML) , 2019, pp. 1607–1616
2019
Later among the works it cites.
2019
Later among the works it cites.
P. Wang, X. He, Q. Chen, A. Cheng, Q. Liu, and J. Cheng, “Unsupervised network quantization via fixed-point factorization,” IEEE Transactions on Neural Networks and Learning Systems (TNNLS) , 2020
2020
Closest in time.
Z. Chen, T.-B. Xu, C. Du, C.-L. Liu, and H. He, “Dynamical channel pruning by conditional accuracy change for deep neural networks,” IEEE Transactions on Neural Networks and Learning Systems (TNNLS) , 2020
2020
Closest in time.
2020
Closest in time.
G. Franchi, A. Bursuc, E. Aldea, S. Dubuisson, and I. Bloch, “Tradi: Tracking deep neural network weight distributions,” in Proceedings of the European Conference on Computer Vision (ECCV) , 2020, pp. 105–121
2020
Closest in time.
M. Lin, R. Ji, Y. Wang, Y. Zhang, B. Zhang, Y. Tian, and S. Ling, “Hrank: Filter pruning using high-rank feature map,” in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR) , 2020
2020
Closest in time.