CNN inference acceleration using dictionary of centroids
It is well known that multiplication operations in convolutional layers of common CNNs consume a lot of time during inference stage. In this article we present a flexible method to decrease both computational complexity of convolutional layers in inference as well as amount of space to store them. The method is based on centroid filter quantization and outperforms approaches based on tensor decomposition by a large margin. We performed comparative analysis of the proposed method and series of CP tensor decomposition on ImageNet benchmark and found that our method provide almost 2.9 times better computational gain. Despite the simplicity of our method it cannot be applied directly in inference stage in modern frameworks, but could be useful for cases calculation flow could be changed, e.g. for CNN-chip designers.
Code (0)
등록된 구현이 없습니다.
Tasks
QuantizationTensor DecompositionSimilar Papers 제목 키워드 기반
A High-Performance Accelerator for Super-Resolution Processing on Embedded GPU
Recent years have witnessed impressive progress in super-resolution (SR) processing. However, its real-time inference requirement sets a challenge not only for the model design but also for the on-chip implementation. In…
Dictionary LearningGPUSuper-ResolutionVocal Bursts Intensity PredictionOnline multidimensional dictionary learning
Dictionary learning is a widely used technique in signal processing and machine learning that aims to represent data as a linear combination of a few elements from an overcomplete dictionary. In this work, we propose a g…
Dictionary LearningBi-component dictionary matching for MR fingerprinting for efficient quantification of fat fraction and water T1 in skeletal muscle
Purpose To propose an efficient bi-component MR fingerprinting (MRF) fitting method using a Variable Projection (VARPRO) strategy, applied to the quantification of fat fraction (FF) and water T1 (T1H2O) in skeletal musc…
A Super Fast K-means for Indexing Vector Embeddings
We present SuperKMeans: a k-means variant designed for clustering collections of high-dimensional vector embeddings. SuperKMeans' clustering is up to 7x faster than FAISS and Scikit-Learn on modern CPUs and up to 4x fast…
In Defense of Sparsity Based Face Recognition
The success of sparse representation based classification (SRC) has largely boosted the research of sparsity based face recognition in recent years. A prevailing view is that the sparsity based face recognition performs …
Face RecognitionSparse Representation-based Classification