Fetching the paper…
Reading the bibliography…
Neural networks have achieved tremendous success in a large variety of applications.
Wave mechanics, advanced general theory
J. Frenkel · 1934
Earlier work this paper cites.
The principles of quantum mechanics
P. A. M. Dirac et al · 1981
Earlier work this paper cites.
Solving ordinary differential equations. I. Nonstiff problems
E. Hairer, S. P. Nørsett, and G. Wanner · 1993
Earlier work this paper cites.
Gradient-based learning applied to document recognition
Y. Lecun, L. Bottou, Y. Bengio, and P. Haffner · 1998
Earlier work this paper cites.
On smooth decompositions of matrices
L. Dieci and T. Eirola · 1999
Earlier work this paper cites.
Dynamical low-rank approximation
O. Koch and C. Lubich · 2007
Earlier work this paper cites.
Optimization algorithms on matrix manifolds
P.-A. Absil, R. Mahony, and R. Sepulchre · 2009
Earlier work this paper cites.
Dynamical tensor approximation
O. Koch and C. Lubich · 2010
Earlier work this paper cites.
The MNIST database of handwritten digit images for machine learning research
L. Deng · 2012
Earlier work this paper cites.
Dynamical approximation by hierarchical Tucker and tensor-train tensors
C. Lubich, T. Rohwedder, R. Schneider, and B. Vandereycken · 2013
Earlier work this paper cites.
Low-rank matrix factorization for deep neural network training with high-dimensional output targets
T. N. Sainath, B. Kingsbury, V. Sindhwani, E. Arisoy, and B. Ramabhadran · 2013
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.
Speeding up convolutional neural networks with low rank expansions
M. Jaderberg, A. Vedaldi, and A. Zisserman · 2014
Earlier work this paper cites.
A projector-splitting integrator for dynamical low-rank approximation
C. Lubich and I. V. Oseledets · 2014
Earlier work this paper cites.
An exploration of parameter redundancy in deep networks with circulant projections
Y. Cheng, F. X. Yu, R. S. Feris, S. Kumar, A. Choudhary, and S.-F. Chang · 2015
Earlier work this paper cites.
Compression of deep convolutional neural networks for fast and low power mobile applications, 2015
Y.-D. Kim, E. Park, S. Yoo, T. Choi, L. Yang, and D. Shin · 2015
Earlier work this paper cites.
Speeding-up convolutional neural networks using fine-tuned cp-decomposition
V. Lebedev, Y. Ganin, M. Rakhuba, I. Oseledets, and V. Lempitsky · 2015
Earlier work this paper cites.
Binarized neural networks: Training deep neural networks with weights and activations constrained to +1 or -1
M. Courbariaux, I. Hubara, D. Soudry, R. El-Yaniv, and Y. Bengio · 2016
Earlier work this paper cites.
Dynamic network surgery for efficient dnns
Y. Guo, A. Yao, and Y. Chen · 2016
Earlier work this paper cites.
Training CNNs with low-rank filters for efficient image classification
Y. Ioannou, D. Robertson, J. Shotton, R. Cipolla, and A. Criminisi · 2016
Earlier work this paper cites.
Discretized dynamical low-rank approximation in the presence of small singular values
E. Kieri, C. Lubich, and H. Walach · 2016
Earlier work this paper cites.
Learning structured sparsity in deep neural networks
W. Wen, C. Wu, Y. Wang, Y. Chen, and H. Li · 2016
Cited alongside, same era.
Quantized convolutional neural networks for mobile devices
J. Wu, C. Leng, Y. Wang, Q. Hu, and J. Cheng · 2016
Cited alongside, same era.
Channel pruning for accelerating very deep neural networks
Y. He, X. Zhang, and J. Sun · 2017
Cited alongside, same era.
Channel pruning for accelerating very deep neural networks, 2017
Y. He, X. Zhang, and J. Sun · 2017
Cited alongside, same era.
Densely connected convolutional networks
G. Huang, Z. Liu, L. Van Der Maaten, and K. Q. Weinberger · 2017
Cited alongside, same era.
Runtime neural pruning
J. Lin, Y. Rao, J. Lu, and J. Zhou · 2017
Cited alongside, same era.
Efficient neural network compression
H. Kim, M. U. K. Khan, and C.-M. Kyung · 2019
Later among the works it cites.
Towards optimal structured CNN pruning via generative adversarial learning
S. Lin, R. Ji, C. Yan, B. Zhang, L. Cao, Q. Ye, F. Huang, and D. Doermann · 2019
Later among the works it cites.
Play and prune: Adaptive filter pruning for deep model compression
P. Singh, V. Kumar Verma, P. Rai, and V. P. Namboodiri · 2019
Later among the works it cites.
Low-memory neural network training: A technical report
N. S. Sohoni, C. R. Aberger, M. Leszczynski, J. Zhang, and C. Ré · 2019
Later among the works it cites.
Why are big data matrices approximately low rank?
M. Udell and A. Townsend · 2019
Later among the works it cites.
What is the state of neural network pruning?
D. Blalock, J. J. Gonzalez Ortiz, J. Frankle, and J. Guttag · 2020
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Thinet: A filter level pruning method for deep neural network compression, 2017
J.-H. Luo, J. Wu, and W. Lin · 2017
Cited alongside, same era.
Pruning convolutional neural networks for resource efficient inference
P. Molchanov, S. Tyree, T. Karras, T. Aila, and J. Kautz · 2017
Cited alongside, same era.
Integration methods and accelerated optimization algorithms
D. Scieur, V. Roulet, F. Bach, and A. d’Aspremont · 2017
Cited alongside, same era.
Compressing recurrent neural network with tensor train
A. Tjandra, S. Sakti, and S. Nakamura · 2017
Cited alongside, same era.
Coordinating filters for faster deep neural networks
W. Wen, C. Xu, C. Wu, Y. Wang, Y. Chen, and H. Li · 2017
Cited alongside, same era.
N2n learning: Network to network compression via policy gradient reinforcement learning
A. Ashok, N. Rhinehart, F. Beainy, and K. M. Kitani · 2018
Cited alongside, same era.
Later among the works it cites.
Time integration of symmetric and anti-symmetric low-rank matrices and Tucker tensors
G. Ceruti and C. Lubich · 2020
Later among the works it cites.
Low-rank compression of neural nets: Learning the rank of each layer
Y. Idelbayev and M. A. Carreira-Perpiñán · 2020
Later among the works it cites.
Learning low-rank deep neural networks via singular vector orthogonality regularization and singular value sparsification
H. Yang, M. Tang, W. Wen, F. Yan, D. Hu, A. Li, H. Li, and Y. Chen · 2020
Later among the works it cites.
Time integration of tree tensor networks
G. Ceruti, C. Lubich, and H. Walach · 2021
Later among the works it cites.
Initialization and regularization of factorized neural layers
M. Khodak, N. Tenenholtz, L. Mackey, and N. Fusi · 2021
Later among the works it cites.
J. Kusch and P. Stammer · 2021
Later among the works it cites.
Implicit self-regularization in deep neural networks: Evidence from random matrix theory and implications for learning
C. H. Martin and M. W. Mahoney · 2021
Later among the works it cites.
Analytic insights into structure and rank of neural network Hessian maps
S. P. Singh, G. Bachmann, and T. Hofmann · 2021
Later among the works it cites.
Pufferfish: communication-efficient models at no extra cost
H. Wang, S. Agarwal, and D. Papailiopoulos · 2021
Later among the works it cites.
A rank-adaptive robust integrator for dynamical low-rank approximation
G. Ceruti, J. Kusch, and C. Lubich · 2022
Closest in time.
An unconventional robust integrator for dynamical low-rank approximation
G. Ceruti and C. Lubich · 2022
Closest in time.
Rank-adaptive time integration of tree tensor networks
G. Ceruti, C. Lubich, and D. Sulz · 2022
Closest in time.
Rank diminishing in deep neural networks
R. Feng, K. Zheng, Y. Huang, D. Zhao, M. Jordan, and Z.-J. Zha · 2022
Closest in time.
A riemannian rank-adaptive method for low-rank matrix completion
B. Gao and P.-A. Absil · 2022
Closest in time.