Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
110 tokens/sec
GPT-4o
56 tokens/sec
Gemini 2.5 Pro Pro
44 tokens/sec
o3 Pro
6 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Full-Stack Filters to Build Minimum Viable CNNs (1908.02023v1)

Published 6 Aug 2019 in cs.CV and cs.LG

Abstract: Deep convolutional neural networks (CNNs) are usually over-parameterized, which cannot be easily deployed on edge devices such as mobile phones and smart cameras. Existing works used to decrease the number or size of requested convolution filters for a minimum viable CNN on edge devices. In contrast, this paper introduces filters that are full-stack and can be used to generate many more sub-filters. Weights of these sub-filters are inherited from full-stack filters with the help of different binary masks. Orthogonal constraints are applied over binary masks to decrease their correlation and promote the diversity of generated sub-filters. To preserve the same volume of output feature maps, we can naturally reduce the number of established filters by only maintaining a few full-stack filters and a set of binary masks. We also conduct theoretical analysis on the memory cost and an efficient implementation is introduced for the convolution of the proposed filters. Experiments on several benchmark datasets and CNN models demonstrate that the proposed method is able to construct minimum viable convolution networks of comparable performance.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (6)
  1. Kai Han (184 papers)
  2. Yunhe Wang (145 papers)
  3. Yixing Xu (25 papers)
  4. Chunjing Xu (66 papers)
  5. Dacheng Tao (829 papers)
  6. Chang Xu (323 papers)
Citations (3)

Summary

We haven't generated a summary for this paper yet.