paper-with-me

Papers

Full-Stack Filters to Build Minimum Viable CNNs

2019-08-06 · Kai Han, Yunhe Wang, Yixing Xu, Chunjing Xu, DaCheng Tao, Chang Xu

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.

📄 PDF Abstract BibTeX arXiv:1908.02023

Code (1)

huawei-noah/Full-Stack-Filters pytorch

Tasks

Diversity

Methods 이 논문이 사용한 방법론

Convolution A convolution is a type of matrix operation, consisting of a kernel, a small matrix of weights, that slides over input data performing element-wise multiplication with the…

Similar Papers 제목 키워드 기반

Stacked Graph Filter

2020-11-22 · Hoang NT, Takanori Maehara, Tsuyoshi Murata

We study Graph Convolutional Networks (GCN) from the graph signal processing viewpoint by addressing a difference between learning graph filters with fully connected weights versus trainable polynomial coefficients. We f…

ClassificationGeneral Classification

Adaptive Stacked Graph Filter

2021-01-01 · Hoang NT, Takanori Maehara, Tsuyoshi Murata

We study Graph Convolutional Networks (GCN) from the graph signal processing viewpoint by addressing a difference between learning graph filters with fully-connected weights versus trainable polynomial coefficients. We f…

ClassificationGeneral Classification

Connections Between Pairs of Filters Improve the Accuracy of Convolutional Neural Networks

2026-06-11 · Kathleen Anderson, Philipp Grüning, Erhardt Barth arxiv

While researchers continue to find new and improved network structures for CNNs, most of the newly invented architectures still rely on the traditional pattern of stacking convolutional blocks and separating them with po…

Minimum Viable Model Estimates for Machine Learning Projects

2021-01-02 · John Hawkins

Prioritization of machine learning projects requires estimates of both the potential ROI of the business case and the technical difficulty of building a model with the required characteristics. In this work we present a …

BIG-bench Machine LearningManagementmodel

Compressing Deep Convolutional Neural Networks by Stacking Low-dimensional Binary Convolution Filters

2020-10-06 · Weichao Lan, Liang Lan

Deep Convolutional Neural Networks (CNN) have been successfully applied to many real-life problems. However, the huge memory cost of deep CNN models poses a great challenge of deploying them on memory-constrained devices…

Model Compression