Learnable Embedding Space for Efficient Neural Architecture Compression

By Shengcao Cao, Xiaofang Wang, Kris M. Kitani. 2019

45 citations recorded by the source corpus.

We propose a method to incrementally learn an embedding space over the domain of network architectures, to enable the careful selection of architectures for evaluation during compressed architecture search. Given a teacher network, we search for a compressed network architecture by using Bayesian Optimization (BO) with a kernel function defined over our proposed embedding space to select architectures for evaluation. We demonstrate that our search algorithm can significantly outperform various baseline methods, such as random search and reinforcement learning (Ashok et al., 2018). The compressed architectures found by our method are also better than the state-of-the-art manually-designed compact architecture ShuffleNet (Zhang et al., 2018). We also demonstrate that the learned embedding space can be transferred to new settings for architecture search, such as a larger teacher network or a teacher network in a different architecture family, without any training. Code is publicly available here: this https URL .

Subfields: Artificial Intelligence, Computer Vision and Pattern Recognition

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. Tejaswini Pedapati
  2. Kris M. Kitani
  3. Martin Wistuba
  4. Xiaojun Chang
  5. Ambrish Rawat
  6. Liam Li
  7. Po-Yao (Bernie) Huang
  8. Michael S. Ryoo

In Computer Vision and Pattern Recognition

  1. Luc Van Gool
  2. Kristen Grauman
  3. Yi Yang
  4. Kris M. Kitani
  5. Dacheng Tao
  6. Xiaojun Chang
  7. Anelia Angelova
  8. Tejaswini Pedapati

Citations in the corpus