arrow
返回

Crossbar-Aware Neural Network Pruning

delete2018-01-01
delete45
delete
OA
AI
L
Ling Liang
邓
邓磊 (Lei Deng)
Y
Yueling Jenny Zeng
X
Xing Hu
Y
Yu Ji
X
Xin Ma
Guoqi Li 封面图
Guoqi Li (Guoqi Li) *
Y
Yuan Xie *
DOI:10.1109/ACCESS.2018.2874823delete
delete原文链接
delete分享
delete收藏
查看原文
摘要

摘要

En 中文
Crossbar architecture has been widely adopted in neural network accelerators due to the efficient implementations on vector-matrix multiplication operations. However, in the case of convolutional neural networks (CNNs), the efficiency is compromised dramatically because of the large amounts of data reuse. Although some mapping methods have been designed to achieve a balance between the execution throughput and resource overhead, the resource consumption cost is still huge while maintaining the throughput. Network pruning is a promising and widely studied method to shrink the model size, whereas prior work for CNNs compression rarely considered the crossbar architecture and the corresponding mapping method and cannot be directly utilized by crossbar-based neural network accelerators. This paper proposes a crossbar-aware pruning framework based on a formulated L-0-norm constrained optimization problem. Specifically, we design an L-0-norm constrained gradient descent with relaxant probabilistic projection to solve this problem. Two types of sparsity are successfully achieved: 1) intuitive crossbar-grain sparsity and 2) column-grain sparsity with output recombination, based on which we further propose an input feature maps reorder method to improve the model accuracy. We evaluate our crossbar-aware pruning framework on the median-scale CIFAR10 data set and the large-scale ImageNet data set with VGG and ResNet models. Our method is able to reduce the crossbar overhead by 44%-72% with insignificant accuracy degradation. This paper significantly reduce the resource overhead and the related energy cost and provides a new co-design solution for mapping CNNs onto various crossbar devices with much better efficiency.
Keyword:
Crossbar architecture
convolutional neural networks
neural network pruning
constrained optimization problem
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

IEEE Access 封面图
IEEE Access
IF:
3.6
论文数:
9.8W
被引数:
29.4W

机构

T
tsinghua university
学者数:
11.9W
论文数: 10.0W
被引数: 137
U
University of California Santa Barbara
学者数:
1.2W
论文数: 9.6K
被引数: 3.6W
University of California System 封面图
University of California System
学者数:
37.7W
论文数: 33.8W
被引数: 6.6K
学者 查看更多机构
引用论文

引用论文

Selective formation of lanthanide(III) complexes with polyaminopolycarboxylate: Unprecedented tetranuclear neodymium(III) complex containing alkoxo and carboxylato bridges
err2005-09-01
err0
PREAI
errYoshitaro Miyashita; Masateru Sanada; Md. Monirul Islam; Nagina Amir; Tamotsu Koyano; Hiroshi Ikeda; Kiyoshi Fujisawa; Ken-ichi Okamoto
err分享
err收藏
Chemistry and electronic properties of ferromagnetic metal‐organic semiconductor interfaces: Fe on CuPc
err2009-12-07
err0
PREAI
errV. Yu. Aristov; O. V. Molodtsova; Yu. A. Ossipyan; B. P. Doyle; S. Nannarone; M. Knupfer
err分享
err收藏
A Patient-Specific Methodology for Prediction of Paroxysmal Atrial Fibrillation Onset
err2017-09-14
err0
errOAAI
errElisabetta De Giovanni; Amir Aminifar; Adrian Luca; Sasan Yazdani; Jean-Marc Vesin; David Atienza
err分享
err收藏
err分享
err收藏
学者 查看更多内容