Lune

ICLR2023Top-tier venue

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

Yusuke Sekikawa, Shingo Yashima

2023Year
2Top-tier citations

Abstract

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.

Ask about this paper

Ask your agent about it.

Lune has read the top-tier papers around this one, so every answer names the papers it rests on.

Questions to start from

Your agent calls

Lunesearch_papers

Ask in Lune

Free to start. No credit card required.

Cited by top-tier papers2

Ask how each one uses it

Related papers

Dusk over the sea between two cliffs drawn in fine vertical lines