Fetching the paper…
Reading the bibliography…
Filter pruning is effective to reduce the computational costs of neural networks.
J. C. Gower, “Properties of euclidean and non-euclidean distance matrices,” Linear Algebra and its Applications , vol. 67, pp. 81–97, 1985
1985
Earlier work this paper cites.
P. B. Brazdil, C. Soares, and J. P. Da Costa, “Ranking learning algorithms: Using ibl and meta-learning on accuracy and time results,” Machine Learning , vol. 50, no. 3, pp. 251–277, 2003
2003
Earlier work this paper cites.
A. T. Benjamin and J. J. Quinn, Proofs that really count: the art of combinatorial proof . MAA, 2003, no. 27
2003
Earlier work this paper cites.
S. Sen, N. Moha, B. Baudry, and J.-M. Jézéquel, “Meta-model pruning,” in International Conference on Model Driven Engineering Languages and Systems . Springer, 2009, pp. 32–46
2009
Earlier work this paper cites.
A. Krizhevsky and G. Hinton, “Learning multiple layers of features from tiny images,” 2009
2009
Earlier work this paper cites.
J. Benesty, J. Chen, Y. Huang, and I. Cohen, “Pearson correlation coefficient,” in Noise reduction in speech processing . Springer, 2009, pp. 1–4
2009
Earlier work this paper cites.
Y. Yang, Z. Ma, A. G. Hauptmann, and N. Sebe, “Feature selection for multimedia analysis by sharing information among multiple tasks,” IEEE Transactions on Multimedia , vol. 15, no. 3, pp. 661–669, 2012
2012
Earlier work this paper cites.
B. Frénay and M. Verleysen, “Classification in the presence of label noise: a survey,” IEEE transactions on neural networks and learning systems , vol. 25, no. 5, pp. 845–869, 2013
2013
Earlier work this paper cites.
A. Singh, A. Yadav, and A. Rana, “K-means with three different distance metrics,” International Journal of Computer Applications , vol. 67, no. 10, 2013
2013
Earlier work this paper cites.
A. Kalhor, B. N. Araabi, and C. Lucas, “Evolving takagi–sugeno fuzzy model based on switching to neighboring models,” Applied Soft Computing , vol. 13, no. 2, pp. 939–946, 2013
2013
Earlier work this paper cites.
D. Sinwar and R. Kaushik, “Study of euclidean and manhattan distance metrics using simple k-means clustering,” Int. J. Res. Appl. Sci. Eng. Technol , vol. 2, no. 5, pp. 270–274, 2014
2014
Earlier work this paper cites.
M. Gong, J. Zhao, J. Liu, Q. Miao, and L. Jiao, “Change detection in synthetic aperture radar images based on deep neural networks,” IEEE transactions on neural networks and learning systems , vol. 27, no. 1, pp. 125–138, 2015
2015
Earlier work this paper cites.
K. Simonyan and A. Zisserman, “Very deep convolutional networks for large-scale image recognition,” in ICLR , 2015
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 NIPS , 2015
2015
Earlier work this paper cites.
J. Yosinski, J. Clune, A. Nguyen, T. Fuchs, and H. Lipson, “Understanding neural networks through deep visualization,” in ICML Workshop on Deep Learning , 2015
2015
Earlier work this paper cites.
S. Han, H. Mao, and W. J. Dally, “Deep compression: Compressing deep neural networks with pruning, trained quantization and huffman coding,” in ICLR , 2015
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,” IJCV , 2015
2015
Earlier work this paper cites.
S. Zagoruyko, “92.45% on cifar-10 in torch.” http://torch.ch/blog/2015/07/30/cifar.html, 2015
2015
Earlier work this paper cites.
Y. Yan, F. Nie, W. Li, C. Gao, Y. Yang, and D. Xu, “Image classification by cross-media active learning with privileged information,” IEEE Transactions on Multimedia , vol. 18, no. 12, pp. 2494–2502, 2016
2016
Earlier work this paper cites.
K. He, X. Zhang, S. Ren, and J. Sun, “Deep residual learning for image recognition,” in CVPR , 2016
2016
Earlier work this paper cites.
Y. Guo, A. Yao, and Y. Chen, “Dynamic network surgery for efficient DNNs,” in NIPS , 2016
2016
Earlier work this paper cites.
W. Wen, C. Wu, Y. Wang, Y. Chen, and H. Li, “Learning structured sparsity in deep neural networks,” in NIPS , 2016
2016
Earlier work this paper cites.
V. Lebedev and V. Lempitsky, “Fast ConvNets using group-wise brain damage,” in CVPR , 2016
2016
Earlier work this paper cites.
2016
Earlier work this paper cites.
S. Zagoruyko and N. Komodakis, “Wide residual networks,” in BMVC , 2016
2016
Earlier work this paper cites.
K. He, X. Zhang, S. Ren, and J. Sun, “Identity mappings in deep residual networks,” in ECCV , 2016
2016
Earlier work this paper cites.
H. Li, A. Kadav, I. Durdanovic, H. Samet, and H. P. Graf, “Pruning filters for efficient ConvNets,” in ICLR , 2017
2017
Earlier work this paper cites.
X. Dong, S. Chen, and S. Pan, “Learning to prune deep neural networks via layer-wise optimal brain surgeon,” in Advances in Neural Information Processing Systems , 2017, pp. 4857–4867
2017
Earlier work this paper cites.
Z. Liu, J. Li, Z. Shen, G. Huang, S. Yan, and C. Zhang, “Learning efficient convolutional networks through network slimming,” in ICCV , 2017
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 ICCV , 2017
2017
Cited alongside, same era.
Y. He, X. Zhang, and J. Sun, “Channel pruning for accelerating very deep neural networks,” in ICCV , 2017
2017
Cited alongside, same era.
P. Molchanov, S. Tyree, T. Karras, T. Aila, and J. Kautz, “Pruning convolutional neural networks for resource efficient transfer learning,” in ICLR , 2017
2017
Cited alongside, same era.
J. Wang, C. Xu, X. Yang, and J. M. Zurada, “A novel pruning algorithm for smoothing feedforward neural networks based on group lasso method,” IEEE transactions on neural networks and learning systems , vol. 29, no. 5, pp. 2012–2024, 2017
B. W. Silverman, Density estimation for statistics and data analysis . Routledge, 2018
2018
Later among the works it cites.
W. Chen, Y. Zhang, D. Xie, and S. Pu, “A layer decomposition-recomposition framework for neuron pruning towards accurate lightweight networks,” in AAAI , vol. 33, 2019, pp. 3355–3362
2019
Closest in time.
2019
Closest in time.
S. Lin, R. Ji, Y. Li, C. Deng, and X. Li, “Toward compact convnets via structure-sparsity regularized filter pruning,” IEEE transactions on neural networks and learning systems , vol. 31, no. 2, pp. 574–588, 2019
2019
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2017
Cited alongside, same era.
X. Dong, J. Huang, Y. Yang, and S. Yan, “More is less: A more complicated network with less inference complexity,” in CVPR , 2017
2017
Cited alongside, same era.
A. Paszke, S. Gross, S. Chintala, G. Chanan, E. Yang, Z. DeVito, Z. Lin, A. Desmaison, L. Antiga, and A. Lerer, “Automatic differentiation in pytorch,” in NIPS-W , 2017
2017
Cited alongside, same era.
M. A. Carreira-Perpinán and Y. Idelbayev, “Learning-compression” algorithms for neural net pruning,” in CVPR , 2018
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 CVPR , 2018
2018
Cited alongside, same era.
Y. He, G. Kang, X. Dong, Y. Fu, and Y. Yang, “Soft filter pruning for accelerating deep convolutional neural networks,” in IJCAI , 2018
2018
Cited alongside, same era.
S. Lin, R. Ji, X. Guo, X. Li et al. , “Towards convolutional neural networks compression via global error reconstruction.” in IJCAI , 2018
2018
Cited alongside, same era.
2018
Cited alongside, same era.
2019
Closest in time.
Y. He, X. Dong, G. Kang, Y. Fu, C. Yan, and Y. Yang, “Asymptotic soft filter pruning for deep convolutional neural networks,” IEEE transactions on cybernetics , 2019
2019
Closest in time.
2019
Closest in time.
Y. He, P. Liu, Z. Wang, and Y. Yang, “Pruning filter via geometric median for deep convolutional neural networks acceleration,” in CVPR , 2019
2019
Closest in time.
2019
Closest in time.
W. Wang, C. Fu, J. Guo, D. Cai, and X. He, “Cop: Customized deep model compression via regularized correlation-based filter-level pruning,” in IJCAI , 2019
2019
Closest in time.
P. Molchanov, A. Mallya, S. Tyree, I. Frosio, and J. Kautz, “Importance estimation for neural network pruning,” in CVPR , 2019
2019
Closest in time.
H. Liu, K. Simonyan, and Y. Yang, “Darts: Differentiable architecture search,” in Proc. Int. Conf. Learn. Represent. , 2019
2019
Closest in time.
M. Tan and Q. Le, “Efficientnet: Rethinking model scaling for convolutional neural networks,” in International Conference on Machine Learning . PMLR, 2019, pp. 6105–6114
2019
Closest in time.
J. Frankle and M. Carbin, “The lottery ticket hypothesis: Finding sparse, trainable neural networks,” in ICLR , 2019
2019
Closest in time.
X. Zhang, Y. Wei, Y. Yang, and T. Huang, “Self-produced guidance for weakly-supervised object localization,” IEEE Transactions on Cybernetics , 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 , 2020
2020
Closest in time.
M. Kang and B. Han, “Operation-aware soft channel pruning using differentiable masks,” in International Conference on Machine Learning , 2020
2020
Closest in time.
X. Ning, T. Zhao, W. Li, P. Lei, Y. Wang, and H. Yang, “Dsa: More efficient budgeted pruning via differentiable sparsity allocation,” in ECCV , 2020
2020
Closest in time.
Y. He, Y. Ding, P. Liu, L. Zhu, H. Zhang, and Y. Yang, “Learning filter pruning criteria for deep convolutional neural networks acceleration,” in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR) , 2020
2020
Closest in time.
2020
Closest in time.
L. Zhu, H. Fan, Y. Luo, M. Xu, and Y. Yang, “Temporal cross-layer correlation mining for action recognition,” IEEE Transactions on Multimedia , 2021
2021
Closest in time.
M. Lin, L. Cao, S. Li, Q. Ye, Y. Tian, J. Liu, Q. Tian, and R. Ji, “Filter sketch for network pruning,” IEEE Transactions on Neural Networks and Learning Systems , 2021
2021
Closest in time.
M. Lin, R. Ji, S. Li, Y. Wang, Y. Wu, F. Huang, and Q. Ye, “Network pruning using adaptive exemplar filters,” IEEE Transactions on Neural Networks and Learning Systems , 2021
2021
Closest in time.
S. Gao, F. Huang, W. Cai, and H. Huang, “Network pruning via performance maximization,” in CVPR , 2021
2021
Closest in time.
D. H. Le and B.-S. Hua, “Network pruning that matters: A case study on retraining variants,” in ICLR , 2021
2021
Closest in time.
X. Wang, Z. Zheng, Y. He, F. Yan, Z. Zeng, and Y. Yi, “Soft person re-identification network pruning via block-wise adjacent filter decaying,” IEEE Transactions on Cybernetics , 2022
2022
Closest in time.
J. Ye, “Cosine similarity measures for intuitionistic fuzzy sets and their applications,” Mathematical and computer modelling , vol. 53, no. 1-2, pp. 91–97, 2011
2022
Closest in time.