N2N Learning: Network to Network Compression via Policy Gradient Reinforcement Learning

By Anubhav Ashok, Nicholas Rhinehart, Fares N. Beainy, Kris M. Kitani. 2017

182 citations recorded by the source corpus.

While bigger and deeper neural network architectures continue to advance the state-of-the-art for many computer vision tasks, real-world adoption of these networks is impeded by hardware and speed constraints. Conventional model compression methods attempt to address this problem by modifying the architecture manually or using pre-defined heuristics. Since the space of all reduced architectures is very large, modifying the architecture of a deep neural network in this way is a difficult task. In this paper, we tackle this issue by introducing a principled method for learning reduced network architectures in a data-driven way using reinforcement learning. Our approach takes a larger `teacher' network as input and outputs a compressed `student' network derived from the `teacher' network. In the first stage of our method, a recurrent policy network aggressively removes layers from the large `teacher' model. In the second stage, another recurrent policy network carefully reduces the size of each remaining layer. The resulting network is then evaluated to obtain a reward -- a score based on the accuracy and compression of the network. Our approach uses this reward signal with policy gradients to train the policies to find a locally optimal student network. Our experiments show that we can achieve compression rates of more than 10x for models such as ResNet-34 while maintaining similar performance to the input `teacher' network. We also present a valuable transfer learning result which shows that policies which are pre-trained on smaller `teacher' networks can be used to rapidly speed up training on larger `teacher' networks.

Subfields: Artificial Intelligence, Computer Vision and Pattern Recognition, Reinforcement Learning, Efficiency & Compression

How researchers see this paper

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

In Artificial Intelligence

  1. Song Han
  2. Dacheng Tao
  3. Chuang Gan
  4. Ji Lin
  5. Quoc V. Le
  6. Han Cai
  7. Jiashi Feng
  8. Zhijian Liu

In Computer Vision and Pattern Recognition

  1. Dacheng Tao
  2. Luc Van Gool
  3. Ming-Hsuan Yang
  4. Xiaogang Wang
  5. Yi Yang
  6. Trevor Darrell
  7. Jitendra Malik
  8. Chunhua Shen

In Reinforcement Learning

  1. Song Han
  2. Yihui He
  3. Han Cai
  4. Lin Wang
  5. Kuk-Jin Yoon
  6. Greg Mori
  7. Dacheng Tao
  8. Chuang Gan

In Efficiency & Compression

  1. Song Han
  2. Ji Lin
  3. Chuang Gan
  4. Zhijian Liu
  5. Han Cai
  6. Dacheng Tao
  7. Hanrui Wang
  8. Lin Wang

Citations in the corpus