about
GhostRNN: Reducing State Redundancy in RNN with Cheap Operations (arxiv.org)
2 points by PaulHoule on Dec 9, 2024 | hide | past | pdf | discuss on HN

In plain words: Many of an RNN's hidden-state numbers are near-copies of each other, so this design computes only a few real ones and cheaply copies the rest. On speech tasks it cut memory use about 40% while keeping results about the same.

Abstract

Recurrent neural network (RNNs) that are capable of modeling long-distance dependencies are widely used in various speech tasks, eg., keyword spotting (KWS) and speech enhancement (SE). Due to the limitation of power and memory in low-resource devices, efficient RNN models are urgently required for real-world applications. In this paper, we propose an efficient RNN architecture, GhostRNN, which reduces hidden state redundancy with cheap operations. In particular, we observe that partial dimensions of hidden states are similar to the others in trained RNN models, suggesting that redundancy exists in specific RNNs. To reduce the redundancy and hence computational cost, we propose to first generate a few intrinsic states, and then apply cheap operations to produce ghost states based on the intrinsic states. Experiments on KWS and SE tasks demonstrate that the proposed GhostRNN significantly reduces the memory usage (~40%) and computation cost while keeping performance similar.

Hang Zhou, Xiaoxu Zheng, Yunhe Wang, Michael Bi Mi, Deyi Xiong, Kai Han
arXiv:2411.14489 · cs.CL, cs.AI, cs.SD, eess.AS · submitted Nov 20, 2024
abstract · pdf · html

add comment on HN