paper-with-me

홈 › Papers

Two Sparsities Are Better Than One: Unlocking the Performance Benefits of Sparse-Sparse Networks

2021-12-27 · Kevin Lee Hunter, Lawrence Spracklen, Subutai Ahmad

In principle, sparse neural networks should be significantly more efficient than traditional dense networks. Neurons in the brain exhibit two types of sparsity; they are sparsely interconnected and sparsely active. These two types of sparsity, called weight sparsity and activation sparsity, when combined, offer the potential to reduce the computational cost of neural networks by two orders of magnitude. Despite this potential, today's neural networks deliver only modest performance benefits using just weight sparsity, because traditional computing hardware cannot efficiently process sparse networks. In this article we introduce Complementary Sparsity, a novel technique that significantly improves the performance of dual sparse networks on existing hardware. We demonstrate that we can achieve high performance running weight-sparse networks, and we can multiply those speedups by incorporating activation sparsity. Using Complementary Sparsity, we show up to 100X improvement in throughput and energy efficiency performing inference on FPGAs. We analyze scalability and resource tradeoffs for a variety of kernels typical of commercial convolutional networks such as ResNet-50 and MobileNetV2. Our results with Complementary Sparsity suggest that weight plus activation sparsity can be a potent combination for efficiently scaling future AI models.

📄 PDF Abstract BibTeX arXiv:2112.13896

Code (0)

등록된 구현이 없습니다.

Methods 이 논문이 사용한 방법론

Pointwise Convolution Pointwise Convolution is a type of convolution that uses a 1x1 kernel: a kernel that iterates through every single point. This…
Depthwise Convolution Depthwise Convolution is a type of convolution where we apply a single convolutional filter for each input channel. In the regular 2D…
Depthwise Separable Convolution While standard convolution performs the channelwise and spatial-wise computation in one step, Depthwise Separable Convolution …
Batch Normalization 설명 없음
Inverted Residual Block 설명 없음
Average Pooling 설명 없음
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…
1x1 Convolution A 1 x 1 Convolution is a convolution with some special properties in that it can be used for dimensionality reduction,…

Similar Papers 제목 키워드 기반

Pushing the Limits of Sparsity: A Bag of Tricks for Extreme Pruning

2024-11-20 · Andy Li, Aiden Durrant, Milan Markovic, Lu Yin 외

Pruning of deep neural networks has been an effective technique for reducing model size while preserving most of the performance of dense networks, crucial for deploying models on memory and power-constrained devices. Wh…

Sparse Learning

Pruning's Effect on Generalization Through the Lens of Training and Regularization

2022-10-25 · Tian Jin, Michael Carbin, Daniel M. Roy, Jonathan Frankle 외

Practitioners frequently observe that pruning improves model generalization. A long-standing hypothesis based on bias-variance trade-off attributes this generalization improvement to model size reduction. However, recent…

Random Forest with Learned Representations for Semantic Segmentation

2019-01-23 · Byeongkeun Kang, Truong Q. Nguyen

In this work, we present a random forest framework that learns the weights, shapes, and sparsities of feature representations for real-time semantic segmentation. Typical filters (kernels) have predetermined shapes and s…

Hand SegmentationReal-Time Semantic SegmentationSegmentationSemantic Segmentation

COLT: Cyclic Overlapping Lottery Tickets for Faster Pruning of Convolutional Neural Networks

2022-12-24 · Md. Ismail Hossain, Mohammed Rakib, M. M. Lutfe Elahi, Nabeel Mohammed 외

Pruning refers to the elimination of trivial weights from neural networks. The sub-networks within an overparameterized model produced after pruning are often called Lottery tickets. This research aims to generate winnin…

Incremental Transformer Neural Processes

2026-02-21 · Philip Mortimer, Cristiana Diaconu, Tommy Rochussen, Bruno Mlodozeniec 외 arxiv

Neural Processes (NPs), and specifically Transformer Neural Processes (TNPs), have demonstrated remarkable performance across tasks ranging from spatiotemporal forecasting to tabular data modelling. However, many of thes…