Quantized Approximately Orthogonal Recurrent Neural Networks
<|reference_start|>Quantized Approximately Orthogonal Recurrent Neural Networks: In recent years, Orthogonal Recurrent Neural Networks (ORNNs) have gained popularity due to their ability to manage tasks involving long-term dependencies, such as the copy-task, and their linear complexity. However, existing ORNNs utilize full precision weights and activations, which prevents their deployment on compact devices.In this paper, we explore the quantization of the weight matrices in ORNNs, leading to Quantized approximately Orthogonal RNNs (QORNNs). The construction of such networks remained an open problem, acknowledged for its inherent instability. We propose and investigate two strategies to learn QORNN by combining quantization-aware training (QAT) and orthogonal projections. We also study post-training quantization of the activations for pure integer computation of the recurrent loop. The most efficient models achieve results similar to state-of-the-art full-precision ORNN, LSTM and FastRNN on a variety of standard benchmarks, even with 4-bits quantization.<|reference_end|>
@article{foucault2024quantized,
    title={Quantized Approximately Orthogonal Recurrent Neural Networks},
    author={Armand Foucault (IMT), Franck Mamalet (UT), Franc{c}ois Malgouyres
  (IMT)},
    journal={arXiv preprint arXiv:2402.04012},
    year={2024},
    archivePrefix={arXiv},
    eprint={2402.04012},
    primaryClass={cs.NE cs.AI cs.LG eess.SP math.ST stat.TH}
}