On The Efficiency of Sparse-Tiled Tensor Graph Processing For Low Memory Usage
Antonio Cipolletta, Andrea Calimera
2021年份
6被引次数
摘要
The memory space taken to host and process large tensor graphs is a limiting factor for embedded ConvNets. Even though many data-driven compression pipelines have proven their efficacy, this work shows there is still room for optimization at the intersection with compute-oriented optimizations. We demonstrate that tensor pruning via weight sparsification can cooperate with a model-agnostic tiling strategy, leading ConvNets towards a new feasible region of the solution space. The collected results show for the first time fast versions of MobileNets deployed at full scale on an ARM M7 core with 512KB of RAM and 2MB of FLASH memory.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
它引用的顶会 Paper2
相关 Paper
- Register Tiling for Unstructured Sparsity in Neural Network InferenceLucas Wilkinson, Kazem Cheshmi, Maryam Mehri DehnaviPLDI 2023 · 被引用 17 次
- Convolutional Neural Network Compression through Generalized Kronecker Product DecompositionMarawan Gamal Abdel Hameed, Marzieh S. Tahaei, Ali Mosleh, Vahid Partovi NiaAAAI 2022 · 被引用 33 次
- High Performance Depthwise and Pointwise Convolutions on Mobile DevicesPengfei Zhang, Eric Lo, Baotong LuAAAI 2020 · 被引用 54 次
- Accelerating sparse DNN models without hardware-support via tile-wise sparsityCong Guo, Bo Yang Hsueh, Jingwen Leng, Yuxian Qiu 等SC 2020 · 被引用 65 次
- TileQ: Efficient Low-Rank Quantization of Mixture-of-Experts with 2D TilingHongyaoxing Gu, Xinzhe Chen, LIJUAN HU, Liu fangfangICML 2026
