Learning Low-rank Deep Neural Networks via Singular Vector Orthogonality Regularization and Singular Value Sparsification

By Huanrui Yang, Minxue Tang, Wujie Wen, Feng Yan, Daniel Hu, Ang Li, Hai Helen Li, Yiran Chen. 2020

96 citations recorded by the source corpus.

Modern deep neural networks (DNNs) often require high memory consumption and large computational loads. In order to deploy DNN algorithms efficiently on edge or mobile devices, a series of DNN compression algorithms have been explored, including factorization methods. Factorization methods approximate the weight matrix of a DNN layer with the multiplication of two or multiple low-rank matrices. However, it is hard to measure the ranks of DNN layers during the training process. Previous works mainly induce low-rank through implicit approximations or via costly singular value decomposition (SVD) process on every training step. The former approach usually induces a high accuracy loss while the latter has a low efficiency. In this work, we propose SVD training, the first method to explicitly achieve low-rank DNNs during training without applying SVD on every step. SVD training first decomposes each layer into the form of its full-rank SVD, then performs training directly on the decomposed weights. We add orthogonality regularization to the singular vectors, which ensure the valid form of SVD and avoid gradient vanishing/exploding. Low-rank is encouraged by applying sparsity-inducing regularizers on the singular values of each layer. Singular value pruning is applied at the end to explicitly reach a low-rank model. We empirically show that SVD training can significantly reduce the rank of DNN layers and achieve higher reduction on computation load under the same accuracy, comparing to not only previous factorization methods but also state-of-the-art filter pruning methods.

Subfields: Computational Mechanics, Computer Vision and Pattern Recognition, Efficiency & Compression, Signal Processing

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Mechanics

  1. Mikhail Khodak
  2. Lester W. Mackey
  3. Nicoló Fusi
  4. Mehdi Ghatee
  5. Neil A. Tenenholtz
  6. Mohammad Mahdi Bejani
  7. Michael W. Mahoney

In Computer Vision and Pattern Recognition

  1. Mikhail Khodak
  2. Lester W. Mackey
  3. Nicoló Fusi
  4. Mehdi Ghatee
  5. Neil A. Tenenholtz
  6. Mohammad Mahdi Bejani

In Efficiency & Compression

  1. Mikhail Khodak
  2. Lester W. Mackey
  3. Nicoló Fusi
  4. Mehdi Ghatee
  5. Neil A. Tenenholtz
  6. Mohammad Mahdi Bejani

In Signal Processing

  1. Lester W. Mackey
  2. Nicoló Fusi

Citations in the corpus