Improved Projection Learning for Lower Dimensional Feature Maps
Not on the map. Why?
Abstract (arXiv)
The requirement to repeatedly move large feature maps off- and on-chip during inference with convolutional neural networks (CNNs) imposes high costs in terms of both energy and time. In this work we explore an improved method for compressing all feature maps of pre-trained CNNs to below a specified limit. This is done by means of learned projections trained via end-to-end finetuning, which can then be folded and fused into the pre-trained network. We also introduce a new `ceiling compression' framework in which evaluate such techniques in view of the future goal of performing inference fully on-chip.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 14 of its 19 references that are in the map. First posted on arXiv 27 Oct 2022.
Builds on
14 of 19 references.
References · 14
- 2021A Survey of Quantization Methods for Efficient Neural Network Inferencecited by 798
- 2020What is the State of Neural Network Pruning?cited by 578
- 2017Efficient Processing of Deep Neural Networks: A Tutorial and Surveycited by 427
- 2016EIE: Efficient Inference Engine on Compressed Deep Neural Networkcited by 291
- 2017SCNN: An Accelerator for Compressed-sparse Convolutional Neural Networkscited by 132
- 2017NullHop: A Flexible Convolutional Neural Network Accelerator Based on Sparse Representations of Feature Mapscited by 39
- 2017Compressing DMA Engine: Leveraging Activation Sparsity for Training Deep Neural Networkscited by 36
- 2018Accelerating Convolutional Neural Networks via Activation Map Compressioncited by 34
- 2014Efficient and Accurate Approximations of Nonlinear Convolutional Networkscited by 30
- 2019Feature Map Transform Coding for Energy-Efficient CNN Inferencecited by 10
- 2019EBPC: Extended Bit-Plane Compression for Deep Neural Network Inference and Training Acceleratorscited by 4
- 2021Memory-Efficient CNN Accelerator Based on Interlayer Feature Map Compressioncited by 4
Built on by
Citing papers per year: 2023: 1; 2024: 0; 2025: 1.
2 papers.