Fetching the paper…
Reading the bibliography…
In this paper we introduce Principal Filter Analysis (PFA), an easy to use and effective method for neural network compression.
Analysis of a complex of statistical variables into principal components
H. Hotelling · 1933
Earlier work this paper cites.
On information and sufficiency
S. Kullback and R. Leibler · 1951
Earlier work this paper cites.
Optimal brain damage
Y. LeCun, J. S. Denker, and S. A. Solla · 1990
Earlier work this paper cites.
Optimal brain surgeon: Extensions and performance comparisons
B. Hassibi, D. G. Stork, and G. Wolff · 1993
Earlier work this paper cites.
A metric for distributions with applications to image databases
Y. Rubner, C. Tomasi, and L. J. Guibas · 1998
Earlier work this paper cites.
Model compression
C. Bucilua, R. Caruana, and A. Niculescu-Mizil · 2006
Earlier work this paper cites.
Imagenet: A large-scale hierarchical image database
J. Deng, W. Dong, R. Socher, L.-J. Li, K. Li, and L. Fei-Fei · 2009
Earlier work this paper cites.
Learning multiple layers of features from tiny images
A. Krizhevsky · 2009
Earlier work this paper cites.
Predicting parameters in deep learning
M. Denil, B. Shakibi, L. Dinh, M. Ranzato, and N. de Freitas · 2013
Earlier work this paper cites.
Restructuring of deep neural network acoustic models with singular value decomposition
J. Xue, J. Li, and Y. Gong · 2013
Earlier work this paper cites.
Do deep nets really need to be deep?
L. J. Ba and R. Caurana · 2014
Earlier work this paper cites.
Exploiting linear structure within convolutional networks for efficient evaluation
E. L. Denton, W. Zaremba, J. Bruna, Y. LeCun, and R. Fergus · 2014
Earlier work this paper cites.
Distilling the knowledge in a neural network
G. Hinton, J. Dean, and O. Vinyals · 2014
Earlier work this paper cites.
Speeding up convolutional neural networks with low rank expansions
M. Jaderberg, A. Vedaldi, and A. Zisserman · 2014
Earlier work this paper cites.
Speeding-up convolutional neural networks using fine-tuned cp-decomposition
V. Lebedev, Y. Ganin, M. Rakhuba, I. V. Oseledets, and V. S. Lempitsky · 2014
Earlier work this paper cites.
On the computational efficiency of training neural networks
R. Livni, S. Shalev-Shwartz, and O. Shamir · 2014
Earlier work this paper cites.
TensorFlow: Large-scale machine learning on heterogeneous systems, 2015
M. A. et al · 2015
Earlier work this paper cites.
Fully convolutional networks for semantic segmentation
J. Long, E. Shelhamer, and T. Darrell · 2015
Earlier work this paper cites.
Compressing deep neural networks using a rank-constrained topology
P. Nakkiran, R. Alvarez, R. Prabhavalkar, and C. Parada · 2015
Earlier work this paper cites.
Fitnets: Hints for thin deep nets
A. Romero, N. Ballas, S. E. Kahou, A. Chassang, C. Gatta, and Y. Bengio · 2015
Cited alongside, same era.
Very deep convolutional networks for large-scale image recognition
K. Simonyan and A. Zisserman · 2015
Cited alongside, same era.
Data-free parameter pruning for deep neural networks
S. Srinivas and R. V. Babu · 2015
Cited alongside, same era.
92.45% on cifar-10 in torch
S. Zagoruyko · 2015
Cited alongside, same era.
Net2net: Accelerating learning via knowledge transfer
T. Chen, I. Goodfellow, and J. Shlens · 2016
Cited alongside, same era.
Convolutional neural networks with low-rank regularization
T. Cheng, X. Tong, W. Xiaogang, and W. E · 2016
Cited alongside, same era.
Thinet: A filter level pruning method for deep neural network compression
J.-H. Luo, J. Wu, and W. Lin · 2017
Later among the works it cites.
Domain-adaptive deep network compression
M. Masana, J. van de Weijer, L. Herranz, A. D. Bagdanov, and J. M. Álvarez · 2017
Later among the works it cites.
Pruning convolutional neural networks for resource efficient inference
P. Molchanov, S. Tyree, T. Karras, T. Aila, and J. Kautz · 2017
Later among the works it cites.
The loss surface of deep and wide neural networks
N. Quynh and H. Matthias · 2017
Later among the works it cites.
Regularizing cnns with locally constrained decorrelations
P. Rodríguez, J. Gonzàlez, G. Cucurull, J. M. Gonfaus, and F. X. Roca · 2017
Later among the works it cites.
Coordinating filters for faster deep neural networks
W. Wen, C. Xu, C. Wu, Y. Wang, Y. Chen, and H. Li · 2017
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Reducing overfitting in deep networks by decorrelating representations
M. Cogswell, F. Ahmed, R. B. Girshick, L. Zitnick, and D. Batra · 2016
Cited alongside, same era.
Deep compression: Compressing deep neural networks with pruning, trained quantization and huffman coding
S. Han, H. Mao, and W. J. Dally · 2016
Cited alongside, same era.
Learning both weights and connections for efficient neural networks
S. Han, J. Pool, J. Tran, and W. J. Dally · 2016
Cited alongside, same era.
Deep residual learning for image recognition
K. He, X. Zhang, S. Ren, and J. Sun · 2016
Cited alongside, same era.
On the compression of recurrent neural networks with an application to LVCSR acoustic modeling for embedded speech recognition
R. Prabhavalkar, O. Alsharif, A. Bruguier, and I. McGraw · 2016
Cited alongside, same era.
Xnor-net: Imagenet classification using binary convolutional neural networks
M. Rastegari, V. Ordonez, J. Redmon, and A. Farhadi · 2016
Cited alongside, same era.
On compressing deep models by low rank and sparse decomposition
X. Yu, T. Liu, X. Wang, and D. Tao · 2017
Later among the works it cites.
On the optimization of deep networks: Implicit acceleration by overparameterization
S. Arora, N. Cohen, and E. Hazan · 2018
Closest in time.
“learning-compression” algorithms for neural net pruning
M. A. Carreira-Perpinan and Y. Idelbayev · 2018
Closest in time.
DNN or k-nn: That is the generalize vs. memorize question
G. Cohen, G. Sapiro, and R. Giryes · 2018
Closest in time.
Compressing neural networks using the variational information bottleneck
B. Dai, C. Zhu, B. Guo, and D. Wipf · 2018
Closest in time.
Learning compression from limited unlabeled data
X. He and J. Cheng · 2018
Closest in time.
Democratizing production-scale distributed deep learning
M. Ma, H. Pouransari, D. Chao, S. Adya, S. A. Serrano, Y. Qin, D. Gimnicher, and D. Walsh · 2018
Closest in time.
Extreme network compression via filter group approximation
B. Peng, W. Tan, Z. Li, S. Zhang, D. Xie, and S. Pu · 2018
Closest in time.
Clip-q: Deep network compression learning by in-parallel pruning-quantization
F. Tung and G. Mori · 2018
Closest in time.
Deep k-means: Re-training and parameter sharing with harder cluster assignments for compressing deep convolutions
J. Wu, Y. Wang, Z. Wu, Z. Wang, A. Veeraraghavan, and Y. Lin · 2018
Closest in time.
Nisp: Pruning networks using neuron importance score propagation
R. Yu, A. Li, C.-F. Chen, J.-H. Lai, V. I. Morariu, X. Han, M. Gao, C.-Y. Lin, and L. S. Davis · 2018
Closest in time.
A systematic dnn weight pruning framework using alternating direction method of multipliers
T. Zhang, S. Ye, K. Zhang, J. Tang, W. Wen, M. Fardad, and Y. Wang · 2018
Closest in time.