PofoliaShared via Pofolia

arXiv (Cornell University)· 2014· Preprint

Speeding-up Convolutional Neural Networks Using Fine-tuned CP-Decomposition

Vadim Lebedev, Yaroslav Ganin, Maksim Rakhuba, Ivan Oseledets et al.

Short summary

A two-step method decomposes convolutional kernels into smaller ones, achieving up to 8.5x CPU speedup on a character classification CNN with only a 1% accuracy drop.

AI-generated from the title and abstract; the full text is not read.

Key points

  • Proposes a two-step method: CP-decomposition of convolution kernels followed by fine-tuning.
  • Replaces large kernels with sequences of smaller kernels.
  • Achieved 8.5x CPU speedup on a 36-class character CNN with only 1% accuracy loss.
  • For AlexNet on ImageNet, achieved 4x speedup on the second convolution layer with a 1% increase in top-5 error.

AI-generated from the title and abstract; the full text is not read.

Abstract

We propose a simple two-step approach for speeding up convolution layers within large convolutional neural networks based on tensor decomposition and discriminative fine-tuning. Given a layer, we use non-linear least squares to compute a low-rank CP-decomposition of the 4D convolution kernel tensor into a sum of a small number of rank-one tensors. At the second step, this decomposition is used to replace the original convolutional layer with a sequence of four convolutional layers with small kernels. After such replacement, the entire network is fine-tuned on the training data using standard backpropagation process. We evaluate this approach on two CNNs and show that it is competitive with previous approaches, leading to higher obtained CPU speedups at the cost of lower accuracy drops for the smaller of the two networks. Thus, for the 36-class character classification CNN, our approach obtains a 8.5x CPU speedup of the whole network with only minor accuracy drop (1% from 91% to 90%). For the standard ImageNet architecture (AlexNet), the approach speeds up the second convolution layer by a factor of 4x at the cost of $1\%$ increase of the overall top-5 classification error.

The authors' abstract, as published at the source. arXiv (Cornell University), 2014 · DOI ↗

TakeawaysPremium
Ask the paperFree account

Continue with a free account

Ask the paper: 3 free questions a day about this paper; save it, get its citation, new summaries every day for your field. Takeaways are Premium.

Continue free on the web

Sign in with Google or Apple; no card needed. You come back to this paper.

On your phone:

Field: Computational Mathematics

Computational MathematicsMathematics