Fetching the paper…
Reading the bibliography…
The remarkable performance of deep Convolutional neural networks (CNNs) is generally attributed to their deeper and wider architectures, which can come with significant computational costs.
T. Brown, B. Mann, N. Ryder, M. Subbiah, J. D. Kaplan, P. Dhariwal, A. Neelakantan, P. Shyam, G. Sastry, A. Askell et al. , “Language models are few-shot learners,” in Proc. Adv. Neural Inform. Process. Syst. , vol. 33, 2020, pp. 1877–1901
1901
Earlier work this paper cites.
S. Gao, F. Huang, J. Pei, and H. Huang, “Discrete model compression with resource constraint for deep neural networks,” in Proc. IEEE Conf. Comput. Vis. Pattern Recog. , 2020, pp. 1899–1908
1908
Earlier work this paper cites.
W. J. Vetter, “Matrix calculus operations and taylor expansions,” SIAM Rev. , vol. 15, no. 2, pp. 352–369, 1973
1973
Earlier work this paper cites.
Y. LeCun, J. Denker, and S. Solla, “Optimal brain damage,” in Proc. Adv. Neural Inform. Process. Syst. , 1989, p. 598–605
1989
Earlier work this paper cites.
B. Hassibi and D. Stork, “Second order derivatives for network pruning: Optimal brain surgeon,” in Proc. Adv. Neural Inform. Process. Syst. , 1992, p. 164–171
1992
Earlier work this paper cites.
D. F. Gordon and M. Desjardins, “Evaluation and selection of biases in machine learning,” Mach. Learn. , vol. 20, pp. 5–22, 1995
1995
Earlier work this paper cites.
D. L. Donoho, “De-noising by soft-thresholding,” IEEE Trans. Inf. Theory , vol. 41, no. 3, pp. 613–627, 1995
1995
Earlier work this paper cites.
M. Gu and S. C. Eisenstat, “Efficient algorithms for computing a strong rank-revealing qr factorization,” SIAM J. Sci. Comput. , vol. 17, no. 4, pp. 848–869, 1996
1996
Earlier work this paper cites.
M. Köppen, “The curse of dimensionality,” in 5th online world conference on soft computing in industrial applications (WSC5) , 2000, pp. 4–8
2000
Earlier work this paper cites.
M. A. Potter and K. A. D. Jong, “Cooperative coevolution: An architecture for evolving coadapted subcomponents,” Evol. Comput. , vol. 8, no. 1, pp. 1–29, 2000
2000
Earlier work this paper cites.
S. Boyd, S. P. Boyd, and L. Vandenberghe, Convex optimization . Cambridge university press, 2004
2004
Earlier work this paper cites.
D. Karaboga et al. , “An idea based on honey bee swarm for numerical optimization,” Erciyes Univ., Kayseri, Turkey, Tech. Rep. TR-06, 2005
2005
Earlier work this paper cites.
M. Yuan and Y. Lin, “Model selection and estimation in regression with grouped variables,” J. R. Stat. Soc., B: Stat. Methodol. , vol. 68, no. 1, pp. 49–67, 2006
2006
Earlier work this paper cites.
S. E. Fienberg, “When did bayesian inference become” bayesian”?” Bayesian Anal. , vol. 1, no. 1, pp. 1–40, 2006
2006
Earlier work this paper cites.
R. Hadsell, S. Chopra, and Y. LeCun, “Dimensionality reduction by learning an invariant mapping,” in Proc. IEEE Conf. Comput. Vis. Pattern Recog. , 2006, pp. 1735–1742
2006
Earlier work this paper cites.
A. Beck and M. Teboulle, “A fast iterative shrinkage-thresholding algorithm with application to wavelet-based image deblurring,” in 2009 Proc. IEEE Int. Conf. Acoust. Speech Signal Process. , 2009, pp. 693–696
2009
Earlier work this paper cites.
L. Xiao, “Dual averaging method for regularized stochastic learning and online optimization,” in Proc. Adv. Neural Inform. Process. Syst. , 2009, p. 2116–2124
2009
Earlier work this paper cites.
N. Srinivas, A. Krause, S. Kakade, and M. Seeger, “Gaussian process optimization in the bandit setting: No regret and experimental design,” in Proc. Int. Conf. Mach. Learn. , 2010, p. 1015–1022
2010
Earlier work this paper cites.
S. Boyd, N. Parikh, E. Chu, B. Peleato, and J. Eckstein, “Distributed optimization and statistical learning via the alternating direction method of multipliers,” Found. Trends Mach. Learn. , vol. 3, no. 1, pp. 1–122, 2011
2011
Earlier work this paper cites.
A. Krizhevsky, I. Sutskever, and G. E. Hinton, “Imagenet classification with deep convolutional neural networks,” in Proc. Adv. Neural Inform. Process. Syst. , 2012
2012
Earlier work this paper cites.
N. Z. Shor, Minimization methods for non-differentiable functions . Springer Science & Business Media, 2012, vol. 3
2012
Earlier work this paper cites.
C. W. Fox and S. J. Roberts, “A tutorial on variational bayesian inference,” Artif. Intell. Rev. , vol. 38, no. 2, pp. 85–95, 2012
2012
Earlier work this paper cites.
R. A. Horn and C. R. Johnson, Matrix analysis . Cambridge university press, 2012
2012
Earlier work this paper cites.
2013
Earlier work this paper cites.
E. L. Denton, W. Zaremba, J. Bruna, Y. LeCun, and R. Fergus, “Exploiting linear structure within convolutional networks for efficient evaluation,” in Proc. Adv. Neural Inform. Process. Syst. , 2014, p. 1269–1277
2014
Earlier work this paper cites.
N. Parikh and S. Boyd, “Proximal algorithms,” Found. Trends Optim. , vol. 1, no. 3, pp. 127–239, 2014
2014
Earlier work this paper cites.
A. Nitanda, “Stochastic proximal gradient descent with acceleration techniques,” in Proc. Adv. Neural Inform. Process. Syst. , 2014, p. 1574–1582
2014
Earlier work this paper cites.
T. Chen, E. Fox, and C. Guestrin, “Stochastic gradient hamiltonian monte carlo,” in Proc. Int. Conf. Mach. Learn. PMLR, 2014, pp. 1683–1691
2014
Earlier work this paper cites.
K. Simonyan and A. Zisserman, “Very deep convolutional networks for large-scale image recognition,” in Proc. Int. Conf. Learn. Represent. , 2015
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 Proc. IEEE Conf. Comput. Vis. Pattern Recog. , 2015, pp. 1–9
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 Proc. Adv. Neural Inform. Process. Syst. , 2015, p. 1135–1143
2015
Earlier work this paper cites.
G. Hinton, O. Vinyals, and J. Dean, “Distilling the knowledge in a neural network,” in NeurIPS Deep Learn. Represent. Learn. Workshop , 2015
2015
Earlier work this paper cites.
G. Roffo, S. Melzi, and M. Cristani, “Infinite feature selection,” in Proc. Int. Conf. Comput. Vis. , 2015, pp. 4202–4210
2015
Earlier work this paper cites.
D. P. Kingma, T. Salimans, and M. Welling, “Variational dropout and the local reparameterization trick,” in Proc. Adv. Neural Inform. Process. Syst. , 2015, p. 2575–2583
2015
Earlier work this paper cites.
J. Martens and R. Grosse, “Optimizing neural networks with kronecker-factored approximate curvature,” in Proc. Int. Conf. Mach. Learn. PMLR, 2015, pp. 2408–2417
2015
Earlier work this paper cites.
Y. LeCun. (2015, April) In convolutional nets, there is no such thing as ”fully-connected layers”. [Online]. Available: https://www.facebook.com/yann.lecun/posts/10152820758292143
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 Proc. Int. Conf. Learn. Represent. , 2016
2016
Earlier work this paper cites.
J. Redmon, S. Divvala, R. Girshick, and A. Farhadi, “You only look once: Unified, real-time object detection,” in Proc. IEEE Conf. Comput. Vis. Pattern Recog. , 2016, pp. 779–788
2016
Earlier work this paper cites.
K. He, X. Zhang, S. Ren, and J. Sun, “Deep residual learning for image recognition,” in Proc. IEEE Conf. Comput. Vis. Pattern Recog. , 2016, pp. 770–778
2016
Earlier work this paper cites.
M. Rastegari, V. Ordonez, J. Redmon, and A. Farhadi, “Xnor-net: Imagenet classification using binary convolutional neural networks,” in Proc. Eur. Conf. Comput. Vis. Springer, 2016, pp. 525–542
2016
Earlier work this paper cites.
2016
Earlier work this paper cites.
V. Lebedev and V. Lempitsky, “Fast convnets using group-wise brain damage,” in Proc. IEEE Conf. Comput. Vis. Pattern Recog. , 2016
2016
Earlier work this paper cites.
Y. Guo, A. Yao, and Y. Chen, “Dynamic network surgery for efficient dnns,” in Proc. Adv. Neural Inform. Process. Syst. , 2016, p. 1387–1395
2016
Earlier work this paper cites.
T. P. Lillicrap, J. J. Hunt, A. Pritzel, N. Heess, T. Erez, Y. Tassa, D. Silver, and D. Wierstra, “Continuous control with deep reinforcement learning,” in Proc. Int. Conf. Learn. Represent. , 2016
2016
Earlier work this paper cites.
G. Huang, Z. Liu, L. Van Der Maaten, and K. Q. Weinberger, “Densely connected convolutional networks,” in Proc. IEEE Conf. Comput. Vis. Pattern Recog. , 2017, pp. 4700–4708
2017
Earlier work this paper cites.
H. Li, A. Kadav, I. Durdanovic, H. Samet, and H. P. Graf, “Pruning filters for efficient convnets,” in Proc. Int. Conf. Learn. Represent. , 2017
2017
Earlier work this paper cites.
A. Vaswani, N. Shazeer, N. Parmar, J. Uszkoreit, L. Jones, A. N. Gomez, Ł. Kaiser, and I. Polosukhin, “Attention is all you need,” in Proc. Adv. Neural Inform. Process. Syst. , 2017, p. 6000–6010
2017
Earlier work this paper cites.
V. Sze, Y.-H. Chen, T.-J. Yang, and J. S. Emer, “Efficient processing of deep neural networks: A tutorial and survey,” Proc. IEEE , vol. 105, no. 12, pp. 2295–2329, 2017
2017
Earlier work this paper cites.
Y. He, X. Zhang, and J. Sun, “Channel pruning for accelerating very deep neural networks,” in Proc. Int. Conf. Comput. Vis. , 2017, pp. 1389–1397
2017
Earlier work this paper cites.
J.-H. Luo, J. Wu, and W. Lin, “Thinet: A filter level pruning method for deep neural network compression,” in Proc. IEEE Conf. Comput. Vis. Pattern Recog. , 2017, pp. 5058–5066
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 Proc. Int. Conf. Comput. Vis. , 2017, pp. 2736–2744
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 Proc. Int. Conf. Learn. Represent. , 2017
2017
Earlier work this paper cites.
C. Louizos, K. Ullrich, and M. Welling, “Bayesian compression for deep learning,” in Proc. Adv. Neural Inform. Process. Syst. , 2017, p. 3290–3300
2017
Earlier work this paper cites.
K. Neklyudov, D. Molchanov, A. Ashukha, and D. P. Vetrov, “Structured bayesian pruning via log-normal multiplicative noise,” in Proc. Adv. Neural Inform. Process. Syst. , 2017, p. 6778–6787
2017
Earlier work this paper cites.
J. Lin, Y. Rao, J. Lu, and J. Zhou, “Runtime neural pruning,” in Proc. Adv. Neural Inform. Process. Syst. , vol. 30, 2017
2017
Earlier work this paper cites.
2017
Earlier work this paper cites.
T.-J. Yang, Y.-H. Chen, and V. Sze, “Designing energy-efficient convolutional neural networks using energy-aware pruning,” in Proc. IEEE Conf. Comput. Vis. Pattern Recog. , 2017, pp. 5687–5695
2017
Earlier work this paper cites.
T. N. Kipf and M. Welling, “Semi-supervised classification with graph convolutional networks,” in Proc. Int. Conf. Learn. Represent. , 2017
2017
Earlier work this paper cites.
2017
Earlier work this paper cites.
G. Alain and Y. Bengio, “Understanding intermediate layers using linear classifier probes,” in Proc. Int. Conf. Learn. Represent. Workshop , 2017
2017
Earlier work this paper cites.
2018
Earlier work this paper cites.
X. Xu, Y. Ding, S. X. Hu, M. Niemier, J. Cong, Y. Hu, and Y. Shi, “Scaling for edge inference of deep neural networks,” Nat. Electron. , vol. 1, no. 4, pp. 216–222, 2018
2018
Earlier work this paper cites.
Y. Cheng, D. Wang, P. Zhou, and T. Zhang, “Model compression and acceleration for deep neural networks: The principles, progress, and challenges,” IEEE Signal Process. Mag. , vol. 35, no. 1, pp. 126–136, 2018
2018
Earlier work this paper cites.
J. Cheng, P.-s. Wang, G. Li, Q.-h. Hu, and H.-q. Lu, “Recent advances in efficient computation of deep convolutional neural networks,” Front. Inf. Technol. Electron. Eng. , vol. 19, pp. 64–77, 2018
2018
Earlier work this paper cites.
V. Lebedev and V. Lempitsky, “Speeding-up convolutional neural networks: A survey,” Bull. Pol. Acad. Sci.: Tech. Sci. , vol. 66, no. 6, pp. 799–811, 2018
2018
Earlier work this paper cites.
A. Dubey, M. Chatterjee, and N. Ahuja, “Coreset-based neural network compression,” in Proc. Eur. Conf. Comput. Vis. , 2018, pp. 454–470
2018
Earlier work this paper cites.
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 Proc. IEEE Conf. Comput. Vis. Pattern Recog. , 2018, pp. 9194–9203
2018
Earlier work this paper cites.
Z. Zhuang, M. Tan, B. Zhuang, J. Liu, Y. Guo, Q. Wu, J. Huang, and J. Zhu, “Discrimination-aware channel pruning for deep neural networks,” in Proc. Adv. Neural Inform. Process. Syst. , 2018, p. 883–894
2018
Earlier work this paper cites.
J. Ye, X. Lu, Z. Lin, and J. Z. Wang, “Rethinking the smaller-norm-less-informative assumption in channel pruning of convolution layers,” in Proc. Int. Conf. Learn. Represent. , 2018
2018
Earlier work this paper cites.
Z. Huang and N. Wang, “Data-driven sparse structure selection for deep neural networks,” in Proc. Eur. Conf. Comput. Vis. , 2018, pp. 304–320
2018
Earlier work this paper cites.
B. Dai, C. Zhu, B. Guo, and D. Wipf, “Compressing neural networks using the variational information bottleneck,” in Proc. Int. Conf. Mach. Learn. , 2018
2018
Earlier work this paper cites.
Y. He, G. Kang, X. Dong, Y. Fu, and Y. Yang, “Soft filter pruning for accelerating deep convolutional neural networks,” in Proc. Int. Joint Conf. Artif. Intell. , 2018, p. 2234–2240
2018
Earlier work this paper cites.
S. Lin, R. Ji, Y. Li, Y. Wu, F. Huang, and B. Zhang, “Accelerating convolutional networks via global & dynamic filter pruning,” in Proc. Int. Joint Conf. Artif. Intell. , vol. 2, no. 7. Stockholm, 2018, p. 8
2018
Earlier work this paper cites.
Y. He, J. Lin, Z. Liu, H. Wang, L.-J. Li, and S. Han, “Amc: Automl for model compression and acceleration on mobile devices,” in Proc. Eur. Conf. Comput. Vis. , 2018, pp. 784–800
2018
Earlier work this paper cites.
Y. He, Y. Ding, P. Liu, L. Zhu, H. Zhang, and Y. Yang, “Learning filter pruning criteria for deep convolutional neural networks acceleration,” in Proc. IEEE Conf. Comput. Vis. Pattern Recog. , 2020, pp. 2009–2018
2018
Earlier work this paper cites.
S. Chen and Q. Zhao, “Shallowing deep networks: Layer-wise pruning based on feature representations,” IEEE Trans. Pattern Anal. Mach. Intell. , vol. 41, no. 12, pp. 3048–3056, 2018
2018
Earlier work this paper cites.
Z. Liu, J. Xu, X. Peng, and R. Xiong, “Frequency-domain dynamic pruning for convolutional neural networks,” in Proc. Adv. Neural Inform. Process. Syst. , 2018, p. 1051–1061
2018
Earlier work this paper cites.
A. Mallya and S. Lazebnik, “Packnet: Adding multiple tasks to a single network by iterative pruning,” in Proc. IEEE Conf. Comput. Vis. Pattern Recog. , 2018, pp. 7765–7773
2018
Earlier work this paper cites.
E. Candès, Y. Fan, L. Janson, and J. Lv, “Panning for gold: ‘model-x’ knockoffs for high dimensional controlled variable selection,” J. R. Stat. Soc., B: Stat. Methodol. , vol. 80, no. 3, pp. 551–577, 2018
2018
Earlier work this paper cites.
T. George, C. Laurent, X. Bouthillier, N. Ballas, and P. Vincent, “Fast approximate natural gradient descent in a kronecker factored eigenbasis,” in Proc. Adv. Neural Inform. Process. Syst. , 2018, p. 9573–9583
2018
Earlier work this paper cites.
P. I. Frazier, “A tutorial on bayesian optimization,” arXiv preprint arXiv:1807.02811 , 2018
2018
Earlier work this paper cites.
2018
Earlier work this paper cites.
A. Jacot, F. Gabriel, and C. Hongler, “Neural tangent kernel: Convergence and generalization in neural networks,” in Proc. Adv. Neural Inform. Process. Syst. , 2018, p. 8580–8589
2018
Earlier work this paper cites.
T. Elsken, J. H. Metzen, and F. Hutter, “Neural architecture search: A survey,” J. Mach. Learn. Res. , vol. 20, no. 1, pp. 1997–2017, 2019
2019
Earlier work this paper cites.
Y. He, P. Liu, Z. Wang, Z. Hu, and Y. Yang, “Filter pruning via geometric median for deep convolutional neural networks acceleration,” in Proc. IEEE Conf. Comput. Vis. Pattern Recog. , 2019, pp. 4340–4349
2019
Earlier work this paper cites.
W. Wang, C. Fu, J. Guo, D. Cai, and X. He, “Cop: Customized deep model compression via regularized correlation-based filter-level pruning,” in Proc. Int. Joint Conf. Artif. Intell. , 2019, p. 3785–3791
2019
Earlier work this paper cites.
X. Ding, G. Ding, Y. Guo, J. Han, and C. Yan, “Approximated oracle filter pruning for destructive cnn width optimization,” in Proc. Int. Conf. Mach. Learn. , 2019, pp. 1607–1616
2019
Earlier work this paper cites.
Z. You, K. Yan, J. Ye, M. Ma, and P. Wang, “Gate decorator: Global filter pruning method for accelerating deep convolutional neural networks,” in Proc. Adv. Neural Inform. Process. Syst. , 2019
2019
Earlier work this paper cites.
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 Proc. IEEE Conf. Comput. Vis. Pattern Recog. , 2019, pp. 2790–2799
2019
Earlier work this paper cites.
C. Lemaire, A. Achkar, and P.-M. Jodoin, “Structured pruning of neural networks with budget-aware regularization,” in Proc. IEEE Conf. Comput. Vis. Pattern Recog. , 2019, pp. 9108–9116
2019
Earlier work this paper cites.
J. Li, Q. Qi, J. Wang, C. Ge, Y. Li, Z. Yue, and H. Sun, “Oicsr: Out-in-channel sparsity regularization for compact deep neural networks,” in Proc. IEEE Conf. Comput. Vis. Pattern Recog. , 2019, pp. 7046–7055
2019
Earlier work this paper cites.
P. Molchanov, A. Mallya, S. Tyree, I. Frosio, and J. Kautz, “Importance estimation for neural network pruning,” in Proc. IEEE Conf. Comput. Vis. Pattern Recog. , 2019, pp. 11 264–11 272
2019
Earlier work this paper cites.
H. Peng, J. Wu, S. Chen, and J. Huang, “Collaborative channel pruning for deep networks,” in Proc. Int. Conf. Mach. Learn. PMLR, 2019, pp. 5113–5122
2019
Earlier work this paper cites.
C. Wang, R. Grosse, S. Fidler, and G. Zhang, “Eigendamage: Structured pruning in the kronecker-factored eigenbasis,” in Proc. Int. Conf. Mach. Learn. PMLR, 2019, pp. 6566–6575
2019
Earlier work this paper cites.
C. Zhao, B. Ni, J. Zhang, Q. Zhao, W. Zhang, and Q. Tian, “Variational convolutional neural network pruning,” in Proc. IEEE Conf. Comput. Vis. Pattern Recog. , 2019, pp. 2780–2789
2019
Cited alongside, same era.
Y. Zhou, Y. Zhang, Y. Wang, and Q. Tian, “Accelerate cnn via recursive bayesian pruning,” in Proc. Int. Conf. Comput. Vis. , 2019, pp. 3306–3315
2019
Cited alongside, same era.
X. Ding, G. Ding, Y. Guo, and J. Han, “Centripetal sgd for pruning very deep convolutional networks with complicated structure,” in Proc. IEEE Conf. Comput. Vis. Pattern Recog. , 2019
2019
Cited alongside, same era.
D. Mehta, K. I. Kim, and C. Theobalt, “On implicit filter level sparsity in convolutional neural networks,” in Proc. IEEE Conf. Comput. Vis. Pattern Recog. , 2019, pp. 520–528
2019
Cited alongside, same era.
Z. Liu, X. Zhang, Z. Shen, Y. Wei, K.-T. Cheng, and J. Sun, “Joint multi-dimension pruning via numerical gradient update,” IEEE Trans. Image Process. , vol. 30, pp. 8034–8045, 2021
2021
Later among the works it cites.
M. Barsbey, M. Sefidgaran, M. A. Erdogdu, G. Richard, and U. Simsekli, “Heavy tails in sgd and compressibility of overparametrized neural networks,” in Proc. Adv. Neural Inform. Process. Syst. , 2021, pp. 29 364–29 378
2021
Later among the works it cites.
A. Peste, E. Iofinova, A. Vladu, and D. Alistarh, “Ac/dc: Alternating compressed/decompressed training of deep neural networks,” in Proc. Adv. Neural Inform. Process. Syst. , 2021, pp. 8557–8570
2021
Later among the works it cites.
J. Lee, S. Park, S. Mo, S. Ahn, and J. Shin, “Layer-adaptive sparsity for the magnitude-based pruning,” in Proc. Int. Conf. Learn. Represent. , 2021
2021
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2019
Cited alongside, same era.
X. Gao, Y. Zhao, Ł. Dudziak, R. Mullins, and C.-z. Xu, “Dynamic channel pruning: Feature boosting and suppression,” in Proc. Int. Conf. Learn. Represent. , 2019
2019
Cited alongside, same era.
X. Dong and Y. Yang, “Network pruning via transformable architecture search,” in Proc. Adv. Neural Inform. Process. Syst. , 2019, pp. 760–771
2019
Cited alongside, same era.
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 Proc. Int. Conf. Comput. Vis. , 2019, pp. 3296–3305
2019
Cited alongside, same era.
Z. Liu, M. Sun, T. Zhou, G. Huang, and T. Darrell, “Rethinking the value of network pruning,” in Proc. Int. Conf. Learn. Represent. , 2019
2019
Cited alongside, same era.
X. Ding, X. Zhou, Y. Guo, J. Han, J. Liu et al. , “Global sparse momentum sgd for pruning very deep neural networks,” in Proc. Adv. Neural Inform. Process. Syst. , 2019, pp. 6382–6394
2019
Cited alongside, same era.
S. Golkar, M. Kagan, and K. Cho, “Continual learning via neural pruning,” in NeurIPS 2019 Workshop Neuro AI , 2019. [Online]. Available: https://openreview.net/forum?id=Hyl_XXYLIB
2019
Cited alongside, same era.
H. Shu, Y. Wang, X. Jia, K. Han, H. Chen, C. Xu, Q. Tian, and C. Xu, “Co-evolutionary compression for unpaired image translation,” in Proc. Int. Conf. Comput. Vis. , 2019, pp. 3235–3244
2019
Cited alongside, same era.
L. Liebenwein, A. Maalouf, D. Feldman, and D. Rus, “Compressing neural networks: Towards determining the optimal layer-wise decomposition,” in Proc. Adv. Neural Inform. Process. Syst. , 2021, pp. 8557–8570
2021
Later among the works it cites.
Z. Zhan, Y. Gong, P. Zhao, G. Yuan, W. Niu, Y. Wu, T. Zhang, M. Jayaweera, D. Kaeli, B. Ren, X. Lin, and Y. Wang, “Achieving on-mobile real-time super-resolution with neural architecture and pruning search,” in Proc. Int. Conf. Comput. Vis. , 2021, pp. 4821–4831
2021
Later among the works it cites.
F. E. Fernandes and G. G. Yen, “Automatic searching and pruning of deep neural networks for medical imaging diagnostic,” IEEE Trans. Neural Netw. Learn Syst. , vol. 32, no. 12, pp. 5664–5674, 2021
2021
Later among the works it cites.
Y. Liu, Z. Shu, Y. Li, Z. Lin, F. Perazzi, and S.-Y. Kung, “Content-aware gan compression,” in Proc. IEEE Conf. Comput. Vis. Pattern Recog. , 2021, pp. 12 156–12 166
2021
Later among the works it cites.
S. Li, J. Wu, X. Xiao, F. Chao, X. Mao, and R. Ji, “Revisiting discriminator in gan compression: A generator-discriminator cooperative compression scheme,” in Proc. Adv. Neural Inform. Process. Syst. , vol. 34, 2021, pp. 28 560–28 572
2021
Later among the works it cites.
X. Song, Y. Chen, Z.-H. Feng, G. Hu, D.-J. Yu, and X.-J. Wu, “Sp-gan: Self-growing and pruning generative adversarial networks,” IEEE Trans. Neural Netw. Learn Syst. , vol. 32, no. 6, pp. 2458–2469, 2021
2021
Later among the works it cites.
2021
Later among the works it cites.
T. Serra, X. Yu, A. Kumar, and S. Ramalingam, “Scaling up exact neural network compression by relu stability,” in Proc. Adv. Neural Inform. Process. Syst. , 2021, pp. 27 081–27 093
2021
Later among the works it cites.
S. Minaee, Y. Boykov, F. Porikli, A. Plaza, N. Kehtarnavaz, and D. Terzopoulos, “Image segmentation using deep learning: A survey,” IEEE Trans. Pattern Anal. Mach. Intell. , vol. 44, no. 7, pp. 3523–3542, 2022
2022
Later among the works it cites.
Z. Liu, H. Mao, C.-Y. Wu, C. Feichtenhofer, T. Darrell, and S. Xie, “A convnet for the 2020s,” in Proc. IEEE Conf. Comput. Vis. Pattern Recog. , 2022, pp. 11 966–11 976
2022
Later among the works it cites.
H. Zhang, J. Duan, M. Xue, J. Song, L. Sun, and M. Song, “Bootstrapping vits: Towards liberating vision transformers from pre-training,” in Proc. IEEE Conf. Comput. Vis. Pattern Recog. , 2022, pp. 8944–8953
2022
Later among the works it cites.
X. Chen, Q. Cao, Y. Zhong, J. Zhang, S. Gao, and D. Tao, “Dearkd: Data-efficient early knowledge distillation for vision transformers,” in Proc. IEEE Conf. Comput. Vis. Pattern Recog. , 2022, pp. 12 052–12 062
2022
Later among the works it cites.
S. Ren, Z. Gao, T. Hua, Z. Xue, Y. Tian, S. He, and H. Zhao, “Co-advise: Cross inductive bias distillation,” in Proc. IEEE Conf. Comput. Vis. Pattern Recog. , 2022, pp. 16 773–16 782
2022
Later among the works it cites.
A. Goyal and Y. Bengio, “Inductive biases for deep learning of higher-level cognition,” Proc. R. Soc. A , vol. 478, no. 2266, p. 20210068, 2022
2022
Later among the works it cites.
A. Tang, P. Quan, L. Niu, and Y. Shi, “A survey for sparse regularization based compression methods,” Ann. Data Sci. , vol. 9, no. 4, pp. 695–722, 2022
2022
Later among the works it cites.
2022
Later among the works it cites.
S. Vadera and S. Ameen, “Methods for pruning deep neural networks,” IEEE Access , vol. 10, pp. 63 280–63 300, 2022
2022
Later among the works it cites.
U. Kulkarni, S. S. Hallad, A. Patil, T. Bhujannavar, S. Kulkarni, and S. M. Meena, “A survey on filter pruning techniques for optimization of deep neural networks,” in 2022 6th int. conf. i-smac (iot soc., mob., anal. cloud) , 2022, pp. 610–617
2022
Later among the works it cites.
L. Wang and K.-J. Yoon, “Knowledge distillation and student-teacher learning for visual intelligence: A review and new outlooks,” IEEE Trans. Pattern Anal. Mach. Intell. , vol. 44, no. 6, pp. 3048–3068, 2022
2022
Later among the works it cites.
T. Zhao, Y. Xie, Y. Wang, J. Cheng, X. Guo, B. Hu, and Y. Chen, “A survey of deep learning on mobile devices: Applications, optimizations, challenges, and research opportunities,” Proc. IEEE , vol. 110, no. 3, pp. 334–354, 2022
2022
Later among the works it cites.
D. Ghimire, D. Kil, and S.-h. Kim, “A survey on efficient convolutional neural networks and hardware acceleration,” Electron. , vol. 11, no. 6, p. 945, 2022
2022
Later among the works it cites.
E. Yvinec, A. Dapogny, K. Bailly, and M. Cord, “Red++: Data-free pruning of deep neural networks via input splitting and output merging,” IEEE Trans. Pattern Anal. Mach. Intell. , 2022
2022
Later among the works it cites.
M. Lin, L. Cao, Y. Zhang, L. Shao, C.-W. Lin, and R. Ji, “Pruning networks with cross-layer ranking & k-reciprocal nearest filters,” IEEE Trans. Neural Netw. Learn Syst. , pp. 1–10, 2022
2022
Later among the works it cites.
M. Lin, R. Ji, S. Li, Y. Wang, Y. Wu, F. Huang, and Q. Ye, “Network pruning using adaptive exemplar filters,” IEEE Trans. Neural Netw. Learn Syst. , vol. 33, no. 12, pp. 7357–7366, 2022
2022
Later among the works it cites.
D. Jiang, Y. Cao, and Q. Yang, “On the channel pruning using graph convolution network for convolutional neural network acceleration,” in Proc. Int. Joint Conf. Artif. Intell. , 7 2022, pp. 3107–3113
2022
Later among the works it cites.
Z. He, Y. Qian, Y. Wang, B. Wang, X. Guan, Z. Gu, X. Ling, S. Zeng, H. Wang, and W. Zhou, “Filter pruning via feature discrimination in deep neural networks,” in Proc. Eur. Conf. Comput. Vis. Springer, 2022, pp. 245–261
2022
Later among the works it cites.
Y. Zhang, M. Lin, C.-W. Lin, J. Chen, Y. Wu, Y. Tian, and R. Ji, “Carrying out cnn channel pruning in a white box,” IEEE Trans. Neural Netw. Learn Syst. , pp. 1–10, 2022
2022
Later among the works it cites.
H. Wang, C. Qin, Y. Zhang, and Y. Fu, “Neural pruning via growing regularization,” in Proc. Int. Conf. Learn. Represent. , 2022
2022
Later among the works it cites.
S. Yu, Z. Yao, A. Gholami, Z. Dong, S. Kim, M. W. Mahoney, and K. Keutzer, “Hessian-aware pruning and optimal neural implant,” in Proc. IEEE Winter Conf. Appl. Comput. Vis. , 2022, pp. 3880–3891
2022
Later among the works it cites.
M. Nonnenmacher, T. Pfeil, I. Steinwart, and D. Reeb, “Sosp: Efficiently capturing global correlations by second-order structured pruning,” in Proc. Int. Conf. Learn. Represent. , 2022
2022
Later among the works it cites.
Z.-S. Huang and C.-p. Lee, “Training structured neural networks through manifold identification and variance reduction,” in Proc. Int. Conf. Learn. Represent. , 2022
2022
Later among the works it cites.
S. Lee and B. C. Song, “Ensemble knowledge guided sub-network search and fine-tuning for filter pruning,” in Proc. Eur. Conf. Comput. Vis. Springer, 2022, pp. 569–585
2022
Later among the works it cites.
T. Zhang, S. Ye, X. Feng, X. Ma, K. Zhang, Z. Li, J. Tang, S. Liu, X. Lin, Y. Liu, M. Fardad, and Y. Wang, “Structadmm: Achieving ultrahigh efficiency in structured pruning for dnns,” IEEE Trans. Neural Netw. Learn Syst. , vol. 33, no. 5, pp. 2259–2273, 2022
2022
Later among the works it cites.
X. Ma, S. Lin, S. Ye, Z. He, L. Zhang, G. Yuan, S. H. Tan, Z. Li, D. Fan, X. Qian, X. Lin, K. Ma, and Y. Wang, “Non-structured dnn weight pruning—is it beneficial in any platform?” IEEE Trans. Neural Netw. Learn Syst. , vol. 33, no. 9, pp. 4930–4944, 2022
2022
Later among the works it cites.
H. Fan, J. Mu, and W. Zhang, “Bayesian optimization with clustering and rollback for cnn auto pruning,” in Proc. Eur. Conf. Comput. Vis. Springer, 2022, pp. 494–511
2022
Later among the works it cites.
T. Lin, S. U. Stich, L. Barba, D. Dmitriev, and M. Jaggi, “Dynamic model pruning with feedback,” in Proc. Int. Conf. Learn. Represent. , 2022
2022
Later among the works it cites.
Z. Hou, M. Qin, F. Sun, X. Ma, K. Yuan, Y. Xu, Y.-K. Chen, R. Jin, Y. Xie, and S.-Y. Kung, “Chex: Channel exploration for cnn model compression,” in Proc. IEEE Conf. Comput. Vis. Pattern Recog. , 2022, pp. 12 287–12 298
2022
Later among the works it cites.
R. Humble, M. Shen, J. A. Latorre, E. Darve, and J. Alvarez, “Soft masking for cost-constrained channel pruning,” in Proc. Eur. Conf. Comput. Vis. Springer, 2022, pp. 641–657
2022
Later among the works it cites.
S. Elkerdawy, M. Elhoushi, H. Zhang, and N. Ray, “Fire together wire together: A dynamic pruning approach with self-supervised mask prediction,” in Proc. IEEE Conf. Comput. Vis. Pattern Recog. , 2022, pp. 12 454–12 463
2022
Later among the works it cites.
J. Meng, L. Yang, J. Shin, D. Fan, and J.-s. Seo, “Contrastive dual gating: Learning sparse features with contrastive learning,” in Proc. IEEE Conf. Comput. Vis. Pattern Recog. , 2022, pp. 12 257–12 265
2022
Later among the works it cites.
M. Alwani, Y. Wang, and V. Madhavan, “Decore: Deep compression with reinforcement learning,” in Proc. IEEE Conf. Comput. Vis. Pattern Recog. , 2022, pp. 12 349–12 359
2022
Later among the works it cites.
S. Yu, A. Mazaheri, and A. Jannesari, “Topology-aware network pruning using multi-stage graph embedding and reinforcement learning,” in Proc. Int. Conf. Mach. Learn. PMLR, 2022, pp. 25 656–25 667
2022
Later among the works it cites.
Y. Li, P. Zhao, G. Yuan, X. Lin, Y. Wang, and X. Chen, “Pruning-as-search: Efficient neural architecture search via channel pruning and structural reparameterization,” in Proc. Int. Joint Conf. Artif. Intell. , 7 2022, pp. 3236–3242
2022
Later among the works it cites.
S. Gao, F. Huang, Y. Zhang, and H. Huang, “Disentangled differentiable network pruning,” in Proc. Eur. Conf. Comput. Vis. Springer, 2022, pp. 328–345
2022
Later among the works it cites.
Y. He, P. Liu, L. Zhu, and Y. Yang, “Filter pruning by switching to neighboring cnns with good attributes,” IEEE Trans. Neural Netw. Learn Syst. , pp. 1–13, 2022
2022
Later among the works it cites.
Y.-J. Zheng, S.-B. Chen, C. H. Q. Ding, and B. Luo, “Model compression based on differentiable network channel pruning,” IEEE Trans. Neural Netw. Learn Syst. , pp. 1–10, 2022
2022
Later among the works it cites.
Y. Guan, N. Liu, P. Zhao, Z. Che, K. Bian, Y. Wang, and J. Tang, “Dais: Automatic channel pruning via differentiable annealing indicator search,” IEEE Trans. Neural Netw. Learn Syst. , pp. 1–12, 2022
2022
Later among the works it cites.
C. Peng, Y. Li, R. Shang, and L. Jiao, “Recnas: Resource-constrained neural architecture search based on differentiable annealing and dynamic pruning,” IEEE Trans. Neural Netw. Learn Syst. , pp. 1–15, 2022
2022
Later among the works it cites.
H. Shang, J.-L. Wu, W. Hong, and C. Qian, “Neural network pruning by cooperative coevolution,” in Proc. Int. Joint Conf. Artif. Intell. , 7 2022, pp. 4814–4820
2022
Later among the works it cites.
H. Salehinejad and S. Valaee, “Edropout: Energy-based dropout and pruning of deep neural networks,” IEEE Trans. Neural Netw. Learn Syst. , vol. 33, no. 10, pp. 5279–5292, 2022
2022
Later among the works it cites.
M. Alizadeh, S. A. Tailor, L. M. Zintgraf, J. van Amersfoort, S. Farquhar, N. D. Lane, and Y. Gal, “Prospect pruning: Finding trainable weights at initialization using meta-gradients,” in Proc. Int. Conf. Learn. Represent. , 2022
2022
Later among the works it cites.
J. Rachwan, D. Zügner, B. Charpentier, S. Geisler, M. Ayle, and S. Günnemann, “Winning the lottery ahead of time: Efficient early network pruning,” in Proc. Int. Conf. Learn. Represent. , 2022
2022
Later among the works it cites.
M. Shen, P. Molchanov, H. Yin, and J. M. Alvarez, “When to prune? a policy towards early structural pruning,” in Proc. IEEE Conf. Comput. Vis. Pattern Recog. , 2022, pp. 12 247–12 256
2022
Later among the works it cites.
J. Fischer and R. Burkholz, “Plant’n’seek: Can you find the winning ticket?” in Proc. Int. Conf. Learn. Represent. , 2022
2022
Later among the works it cites.
H. You, B. Li, Z. Sun, X. Ouyang, and Y. Lin, “Supertickets: Drawing task-agnostic lottery tickets from supernets via jointly architecture searching and parameter pruning,” in Proc. Eur. Conf. Comput. Vis. Springer, 2022, pp. 674–690
2022
Later among the works it cites.
A. d. Cunha, E. Natale, and L. Viennot, “Proving the lottery ticket hypothesis for convolutional neural networks,” in Proc. Int. Conf. Learn. Represent. , 2022
2022
Later among the works it cites.
Y. Li, K. Adamczewski, W. Li, S. Gu, R. Timofte, and L. Van Gool, “Revisiting random channel pruning for neural network compression,” in Proc. IEEE Conf. Comput. Vis. Pattern Recog. , 2022, pp. 191–201
2022
Later among the works it cites.
S. Wang, J. Chen, C. Li, J. Zhu, and B. Zhang, “Fast lossless neural compression with integer-only discrete flows,” in Proc. Int. Conf. Mach. Learn. PMLR, 2022, pp. 22 562–22 575
2022
Later among the works it cites.
S. Zhong, G. Zhang, N. Huang, and S. Xu, “Revisit kernel pruning with lottery regulated grouped convolutions,” in Proc. Int. Conf. Learn. Represent. , 2022
2022
Later among the works it cites.
M. Lin, Y. Zhang, Y. Li, B. Chen, F. Chao, M. Wang, S. Li, Y. Tian, and R. Ji, “1xn pattern for pruning convolutional neural networks,” IEEE Trans. Pattern Anal. Mach. Intell. , 2022
2022
Later among the works it cites.
G. Liu, K. Zhang, and M. Lv, “Soks: Automatic searching of the optimal kernel shapes for stripe-wise network pruning,” IEEE Trans. Neural Netw. Learn Syst. , pp. 1–13, 2022
2022
Later among the works it cites.
L. Gonzalez-Carabarin, I. A. M. Huijben, B. Veeling, A. Schmid, and R. J. G. van Sloun, “Dynamic probabilistic pruning: A general framework for hardware-constrained pruning at different granularities,” IEEE Trans. Neural Netw. Learn Syst. , pp. 1–12, 2022
2022
Later among the works it cites.
T. Zhao, X. S. Zhang, W. Zhu, J. Wang, S. Yang, J. Liu, and J. Cheng, “Multi-granularity pruning for model acceleration on mobile devices,” in Proc. Eur. Conf. Comput. Vis. Springer, 2022, pp. 484–501
2022
Later among the works it cites.
A. Ganjdanesh, S. Gao, and H. Huang, “Interpretations steered network pruning via amortized inferred saliency maps,” in Proc. Eur. Conf. Comput. Vis. Springer, 2022, pp. 278–296
2022
Later among the works it cites.
L. Miao, X. Luo, T. Chen, W. Chen, D. Liu, and Z. Wang, “Learning pruning-friendly networks via frank-wolfe: One-shot, any-sparsity, and no retraining,” in Proc. Int. Conf. Learn. Represent. , 2022
2022
Later among the works it cites.
H. Zhang, J. Liu, J. Jia, Y. Zhou, H. Dai, and D. Dou, “Fedduap: Federated learning with dynamic update and adaptive pruning using shared data on the server,” in Proc. Int. Joint Conf. Artif. Intell. , 7 2022, pp. 2776–2782
2022
Later among the works it cites.
Y. Jiang, S. Wang, V. Valls, B. J. Ko, W.-H. Lee, K. K. Leung, and L. Tassiulas, “Model pruning enables efficient federated learning on edge devices,” IEEE Trans. Neural Netw. Learn Syst. , pp. 1–13, 2022
2022
Later among the works it cites.
J. Peng, B. Tang, H. Jiang, Z. Li, Y. Lei, T. Lin, and H. Li, “Overcoming long-term catastrophic forgetting through adversarial neural pruning and synaptic consolidation,” IEEE Trans. Neural Netw. Learn Syst. , vol. 33, no. 9, pp. 4243–4256, 2022
2022
Later among the works it cites.
Q. Yan, D. Gong, Y. Liu, A. van den Hengel, and J. Q. Shi, “Learning bayesian sparse networks with full experience replay for continual learning,” in Proc. IEEE Conf. Comput. Vis. Pattern Recog. , 2022, pp. 109–118
2022
Later among the works it cites.
X. Wang, Z. Zheng, Y. He, F. Yan, Z. Zeng, and Y. Yang, “Soft person reidentification network pruning via blockwise adjacent filter decaying,” IEEE Trans. Cybern. , vol. 52, no. 12, pp. 13 293–13 307, 2022
2022
Later among the works it cites.
X. Lin, S. Kim, and J. Joo, “Fairgrape: Fairness-aware gradient pruning method for face attribute classification,” in Proc. Eur. Conf. Comput. Vis. Springer, 2022, pp. 414–432
2022
Later among the works it cites.
Y. Bian, Q. Song, M. Du, J. Yao, H. Chen, and X. Hu, “Subarchitecture ensemble pruning in neural architecture search,” IEEE Trans. Neural Netw. Learn Syst. , vol. 33, no. 12, pp. 7928–7936, 2022
2022
Later among the works it cites.
T. Whitaker and D. Whitley, “Prune and tune ensembles: Low-cost ensemble learning with sparse independent subnetworks,” in Proc. AAAI Conf. Artif. Intell. , vol. 36, no. 8, 2022, pp. 8638–8646
2022
Later among the works it cites.
A. Chavan, Z. Shen, Z. Liu, Z. Liu, K.-T. Cheng, and E. P. Xing, “Vision transformer slimming: Multi-dimension searching in continuous optimization space,” in Proc. IEEE Conf. Comput. Vis. Pattern Recog. , 2022, pp. 4931–4941
2022
Later among the works it cites.
S. Reed, K. Zolna, E. Parisotto, S. G. Colmenarejo, A. Novikov, G. Barth-maron, M. Giménez, Y. Sulsky, J. Kay, J. T. Springenberg, T. Eccles, J. Bruce, A. Razavi, A. Edwards, N. Heess, Y. Chen, R. Hadsell, O. Vinyals, M. Bordbar, and N. de Freitas, “A generalist agent,” Trans. Mach. Learn. Res. , 2022, featured Certification, Outstanding Certification. [Online]. Available: https://openreview.net/forum?id=1ikK0kHjvj
2022
Later among the works it cites.
Y. Kim, Y. Li, H. Park, Y. Venkatesha, R. Yin, and P. Panda, “Exploring lottery ticket hypothesis in spiking neural networks,” in Proc. Eur. Conf. Comput. Vis. Springer, 2022, pp. 102–120
2022
Later among the works it cites.
S. S. Chowdhury, N. Rathi, and K. Roy, “Towards ultra low latency spiking neural networks for vision and sequential tasks using temporal pruning,” in Proc. Eur. Conf. Comput. Vis. Springer, 2022, pp. 709–726
2022
Later among the works it cites.
T. Kim, Y. Kwon, J. Lee, T. Kim, and S. Ha, “Cprune: Compiler-informed model pruning for efficient target-aware dnn execution,” in Proc. Eur. Conf. Comput. Vis. Springer, 2022, pp. 651–667
2022
Later among the works it cites.
T. Chen, H. Zhang, Z. Zhang, S. Chang, S. Liu, P.-Y. Chen, and Z. Wang, “Linearity grafting: Relaxed neuron pruning helps certifiable robustness,” in Proc. Int. Conf. Mach. Learn. PMLR, 2022, pp. 3760–3772
2022
Later among the works it cites.
E. Jang, S. Gu, and B. Poole, “Categorical reparameterization with gumbel-softmax,” in Proc. Int. Conf. Learn. Represent. , 2022
2022
Later among the works it cites.
E. S. Lubana and R. Dick, “A gradient flow framework for analyzing network pruning,” in Proc. Int. Conf. Learn. Represent. , 2022
2022
Later among the works it cites.
Y. Guo, C. Zhang, C. Zhang, and Y. Chen, “Sparse dnns with improved adversarial robustness,” in Proc. Adv. Neural Inform. Process. Syst. , 2018, p. 240–249
2022
Later among the works it cites.
Q. Zhang, Y. Xu, J. Zhang, and D. Tao, “Vitaev2: Vision transformer advanced by exploring inductive bias for image recognition and beyond,” Int. J. Comput. Vis. , vol. 131, pp. 1141–1162, 2023
2023
Closest in time.
Y. Liu, Y. Sun, B. Xue, M. Zhang, G. G. Yen, and K. C. Tan, “A survey on evolutionary neural architecture search,” IEEE Trans. Neural Netw. Learn Syst. , vol. 34, no. 2, pp. 550–570, 2023
2023
Closest in time.
X. Wang, Z. Zheng, Y. He, F. Yan, Z. Zeng, and Y. Yang, “Progressive local filter pruning for image retrieval acceleration,” IEEE Trans. Multimed. , pp. 1–11, 2023
2023
Closest in time.
S. Yang, Z. Xie, H. Peng, M. Xu, M. Sun, and P. Li, “Dataset pruning: Reducing training data by examining generalization influence,” in Proc. Int. Conf. Learn. Represent. , 2023
2023
Closest in time.
Z. Wang and C. Li, “Channel pruning via lookahead search guided reinforcement learning,” in Proc. IEEE Winter Conf. Appl. Comput. Vis. , 2022, pp. 2029–2040
2040
Closest in time.
T. Wang, K. Wang, H. Cai, J. Lin, Z. Liu, H. Wang, Y. Lin, and S. Han, “Apq: Joint search for network architecture, pruning and quantization policy,” in Proc. IEEE Conf. Comput. Vis. Pattern Recog. , 2020, pp. 2078–2087
2087
Closest in time.
W. Wen, C. Wu, Y. Wang, Y. Chen, and H. Li, “Learning structured sparsity in deep neural networks,” in Proc. Adv. Neural Inform. Process. Syst. , 2016, p. 2082–2090
2090
Closest in time.