Lune

ICLR2023顶会

Bit-Pruning: A Sparse Multiplication-Less Dot-Product

Yusuke Sekikawa, Shingo Yashima

出版方
2023年份
2顶会引用

摘要

Dot-product is a central building block in neural networks.However, multiplication (mult\texttt{mult}) in dot-product consumes intensive energy and space costs that challenge deployment on resource-constrained edge devices.In this study, we realize energy-efficient neural networks by exploiting a mult\texttt{mult}-less, sparse dot-product. We first reformulate a dot-product between an integer weight and activation into an equivalent operation comprised of additions followed by bit-shifts (add-shift-add\texttt{add-shift-add}).In this formulation, the number of add\texttt{add} operations equals the number of bits of the integer weight in binary format. Leveraging this observation, we propose Bit-Pruning, which removes unnecessary bits in each weight value during training to reduce the energy consumption of add-shift-add\texttt{add-shift-add}. Bit-Pruning can be seen as soft Weight-Pruning as it prunes bits, not the whole weight element.In extensive experiments, we demonstrate that sparse mult\texttt{mult}-less networks trained with Bit-Pruning show a better accuracy-energy trade-off than sparse mult\texttt{mult} networks trained with Weight-Pruning.

问问这篇 Paper

问问你的智能体。

Lune 读过与它相关的顶会 Paper,每个回答都会注明依据哪几篇。

可以从这些问题问起

智能体调用

Lunesearch_papers

在 Lune 里问

免费开始,无需绑卡

引用它的顶会 Paper2

问问它们各自怎么用它

相关 Paper

黄昏的海面,两侧是细线勾勒的悬崖