Pith. sign in

REVIEW 1 cited by

Quantized Approximately Orthogonal Recurrent Neural Networks

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2402.04012 v2 pith:JDXVIWSW submitted 2024-02-05 cs.NE cs.AIcs.LGeess.SPmath.STstat.TH

classification cs.NEcs.AIcs.LGeess.SPmath.STstat.TH
keywords orthogonalnetworksornnsquantizationrecurrentactivationsapproximatelyneural
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. HadamRNN: Binary and Sparse Ternary Orthogonal RNNs

    cs.LG 2025-01 conditional novelty 7.0 of 10

    Sign-flipped Sylvester Hadamard matrices make orthogonal RNN recurrent weights binary or sparse ternary while preserving long-memory performance.

Pith tools