Fetching the paper…
Reading the bibliography…
Network pruning is an effective approach to reduce network complexity with acceptable performance compromise.
Y. LeCun, J. Denker, and S. Solla, “Optimal brain damage,” in Advances in Neural Information Processing Systems (NeurIPS) , 1989, pp. 598–605
1989
Earlier work this paper cites.
B. Hassibi and D. Stork, “Second order derivatives for network pruning: Optimal brain surgeon,” in Advances in Neural Information Processing Systems (NeurIPS) , 1992, pp. 164–171
1992
Earlier work this paper cites.
G. Thimm and E. Fiesler, “Evaluating pruning methods,” in International Symposium on Artificial Neural Networks (ISANN) , 1995, pp. 20–25
1995
Earlier work this paper cites.
J. Deng, W. Dong, R. Socher, L.-J. Li, K. Li, and L. Fei-Fei, “Imagenet: A large-scale hierarchical image database,” in IEEE Conference on Computer Vision and Pattern Recognition (CVPR) , 2009, pp. 248–255
2009
Earlier work this paper cites.
A. Krizhevsky, G. Hinton et al. , “Learning multiple layers of features from tiny images,” 2009
2009
Earlier work this paper cites.
A. Krizhevsky, I. Sutskever, and G. E. Hinton, “Imagenet classification with deep convolutional neural networks,” in Advances in Neural Information Processing Systems (NeurIPS) , 2012, pp. 1106–1114
2012
Earlier work this paper cites.
2013
Earlier work this paper cites.
2014
Earlier work this paper cites.
S. Han, J. Pool, J. Tran, and W. Dally, “Learning both weights and connections for efficient neural network,” in Advances in Neural Information Processing Systems (NeurIPS) , 2015, pp. 1135–1143
2015
Earlier work this paper cites.
2015
Earlier work this paper cites.
K. Simonyan and A. Zisserman, “Very deep convolutional networks for large-scale image recognition,” in International Conference on Learning Representations (ICLR) , 2015
2015
Earlier work this paper cites.
I. Hubara, M. Courbariaux, D. Soudry, R. El-Yaniv, and Y. Bengio, “Binarized neural networks,” in Advances in Neural Information Processing Systems (NeurIPS) , 2016, pp. 4107–4115
2016
Earlier work this paper cites.
2016
Earlier work this paper cites.
K. He, X. Zhang, S. Ren, and J. Sun, “Deep residual learning for image recognition,” in IEEE Conference on Computer Vision and Pattern Recognition (CVPR) , 2016, pp. 770–778
2016
Earlier work this paper cites.
2016
Earlier work this paper cites.
S. Zagoruyko and N. Komodakis, “Wide residual networks,” arXiv preprint arXiv:1605.07146 , 2016
2016
Earlier work this paper cites.
D. Molchanov, A. Ashukha, and D. Vetrov, “Variational dropout sparsifies deep neural networks,” in International Conference on Machine Learning (ICML) , 2017, pp. 2498–2507
2017
Earlier work this paper cites.
2017
Earlier work this paper cites.
P. Molchanov, S. Tyree, T. Karras, T. Aila, and J. Kautz, “Pruning convolutional neural networks for resource efficient inference,” in International Conference on Learning Representations (ICLR) , 2017
2017
Earlier work this paper cites.
S. Srinivas, A. Subramanya, and R. Venkatesh Babu, “Training sparse neural networks,” in IEEE Conference on Computer Vision and Pattern Recognition Workshops (CVPRW) , 2017, pp. 138–145
2017
Earlier work this paper cites.
H. Li, A. Kadav, I. Durdanovic, H. Samet, and H. P. Graf, “Pruning filters for efficient convnets,” in International Conference on Learning Representations (ICLR) , 2017
2017
Earlier work this paper cites.
J. Yu, A. Lukefahr, D. Palframan, G. Dasika, R. Das, and S. Mahlke, “Scalpel: Customizing dnn pruning to the underlying hardware parallelism,” ACM SIGARCH Computer Architecture News , vol. 45, no. 2, pp. 548–560, 2017
2017
Cited alongside, same era.
2017
Cited alongside, same era.
I. Loshchilov and F. Hutter, “Sgdr: Stochastic gradient descent with warm restarts,” in International Conference on Learning Representations (ICLR) , 2017
2017
Cited alongside, same era.
B. Peng, W. Tan, Z. Li, S. Zhang, D. Xie, and S. Pu, “Extreme network compression via filter group approximation,” in European Conference on Computer Vision (ECCV) , 2018, pp. 300–316
2018
Cited alongside, same era.
U. Evci, T. Gale, J. Menick, P. S. Castro, and E. Elsen, “Rigging the lottery: Making all tickets winners,” in International Conference on Machine Learning (ICML) , 2020, pp. 2943–2952
2020
Later among the works it cites.
Y. Wang, X. Zhang, L. Xie, J. Zhou, H. Su, B. Zhang, and X. Hu, “Pruning from scratch,” in AAAI Conference on Artificial Intelligence (AAAI) , 2020, pp. 12 273–12 280
2020
Later among the works it cites.
A. Kusupati, V. Ramanujan, R. Somani, M. Wortsman, P. Jain, S. Kakade, and A. Farhadi, “Soft threshold weight reparameterization for learnable sparsity,” in International Conference on Machine Learning (ICML) , 2020, pp. 5544–5555
2020
Later among the works it cites.
V. Ramanujan, M. Wortsman, A. Kembhavi, A. Farhadi, and M. Rastegari, “What’s hidden in a randomly weighted neural network?” in IEEE Conference on Computer Vision and Pattern Recognition (CVPR) , 2020, pp. 11 893–11 902
2020
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Y. He, Y. Ding, P. Liu, L. Zhu, H. Zhang, and Y. Yang, “Learning filter pruning criteria for deep convolutional neural networks acceleration,” in IEEE Conference on Computer Vision and Pattern Recognition (CVPR) , 2020, pp. 2009–2018
2018
Cited alongside, same era.
D. C. Mocanu, E. Mocanu, P. Stone, P. H. Nguyen, M. Gibescu, and A. Liotta, “Scalable training of artificial neural networks with adaptive sparse connectivity inspired by network science,” Nature Communications , vol. 9, pp. 1–12, 2018
2018
Cited alongside, same era.
G. Bellec, D. Kappel, W. Maass, and R. Legenstein, “Deep rewiring: Training very sparse deep networks,” in International Conference on Learning Representations (ICLR) , 2018
2018
Cited alongside, same era.
Y. He, P. Liu, Z. Wang, Z. Hu, and Y. Yang, “Filter pruning via geometric median for deep convolutional neural networks acceleration,” in IEEE Conference on Computer Vision and Pattern Recognition (CVPR) , 2019, pp. 4340–4349
2019
Cited alongside, same era.
K. Hayashi, T. Yamaguchi, Y. Sugawara, and S.-i. Maeda, “Exploring unexplored tensor network decompositions for convolutional neural networks,” in Advances in Neural Information Processing Systems (NeurIPS) , 2019, pp. 5552–5562
2019
Cited alongside, same era.
M. Ashby, C. Baaij, P. Baldwin, M. Bastiaan, O. Bunting, A. Cairncross, C. Chalmers, L. Corrigan, S. Davis, N. van Doorn et al. , “Exploiting unstructured sparsity on next-generation datacenter hardware,” 2019
2019
Cited alongside, same era.
H. Mostafa and X. Wang, “Parameter efficient training of deep convolutional neural networks by dynamic sparse reparameterization,” in International Conference on Machine Learning (ICML) , 2019, pp. 4646–4655
2019
Cited alongside, same era.
N. Lee, T. Ajanthan, and P. Torr, “Snip: Single-shot network pruning based on connection sensitivity,” in International Conference on Learning Representations (ICLR) , 2019
2019
Cited alongside, same era.
L. Orseau, M. Hutter, and O. Rivasplata, “Logarithmic pruning is all you need,” in Advances in Neural Information Processing Systems (NeurIPS) , 2020, pp. 2925–2934
2020
Later among the works it cites.
C. Wang, G. Zhang, and R. Grosse, “Picking winning tickets before training by preserving gradient flow,” in International Conference on Learning Representations (ICLR) , 2020
2020
Later among the works it cites.
P. Savarese, H. Silva, and M. Maire, “Winning the lottery with continuous sparsification,” Advances in Neural Information Processing Systems (NeurIPS) , vol. 33, pp. 11 380–11 390, 2020
2020
Later among the works it cites.
M. Lin, R. Ji, Y. Wang, Y. Zhang, B. Zhang, Y. Tian, and L. Shao, “Hrank: Filter pruning using high-rank feature map,” in IEEE Conference on Computer Vision and Pattern Recognition (CVPR) , 2020, pp. 1529–1538
2020
Later among the works it cites.
S. Guo, Y. Wang, Q. Li, and J. Yan, “Dmcp: Differentiable markov channel pruning for neural networks,” in IEEE Conference on Computer Vision and Pattern Recognition (CVPR) , 2020, pp. 1539–1547
2020
Later among the works it cites.
B. Li, B. Wu, J. Su, and G. Wang, “Eagleeye: Fast sub-net evaluation for efficient neural network pruning,” in European Conference on Computer Vision (ECCV) . Springer, 2020, pp. 639–654
2020
Later among the works it cites.
M. Ye, L. Wu, and Q. Liu, “Greedy optimization provably wins the lottery: Logarithmic number of winning tickets is enough,” in Advances in Neural Information Processing Systems (NeurIPS) , 2020, pp. 16 409–16 420
2020
Later among the works it cites.
M. Nagel, R. A. Amjad, M. Van Baalen, C. Louizos, and T. Blankevoort, “Up or down? adaptive rounding for post-training quantization,” in International Conference on Machine Learning (ICML) . PMLR, 2020, pp. 7197–7206
2020
Later among the works it cites.
2020
Later among the works it cites.
2020
Later among the works it cites.
D. Joo, E. Yi, S. Baek, and J. Kim, “Linearly replaceable filters for deep network channel pruning,” in AAAI Conference on Artificial Intelligence (AAAI) , 2021, pp. 8021–8029
2021
Closest in time.
X. Ruan, Y. Liu, B. Li, C. Yuan, and W. Hu, “Dpfps: Dynamic and progressive filter pruning for compressing convolutional neural networks from scratch,” in AAAI Conference on Artificial Intelligence (AAAI) , 2021, pp. 2495–2503
2021
Closest in time.
X. Ding, T. Hao, J. Tan, J. Liu, J. Han, Y. Guo, and G. Ding, “Resrep: Lossless cnn pruning via decoupling remembering and forgetting,” in International Conference on Computer Vision (ICCV) , 2021, pp. 4510–4520
2021
Closest in time.
Y. Zhong, M. Lin, M. Chen, K. Li, Y. Shen, F. Chao, Y. Wu, and R. Ji, “Fine-grained data distribution alignment for post-training quantization,” in European Conference on Computer Vision (ECCV) . Springer, 2022, pp. 70–86
2022
Closest in time.
Y. Zhong, M. Lin, G. Nan, J. Liu, B. Zhang, Y. Tian, and R. Ji, “Intraq: Learning synthetic images with intra-class heterogeneity for zero-shot network quantization,” in IEEE Conference on Computer Vision and Pattern Recognition (CVPR) , 2022, pp. 12 339–12 348
2022
Closest in time.