paper-with-me

홈 › Papers

Low Precision RNNs: Quantizing RNNs Without Losing Accuracy

2017-10-20 · Supriya Kapur, Asit Mishra, Debbie Marr

Similar to convolution neural networks, recurrent neural networks (RNNs) typically suffer from over-parameterization. Quantizing bit-widths of weights and activations results in runtime efficiency on hardware, yet it often comes at the cost of reduced accuracy. This paper proposes a quantization approach that increases model size with bit-width reduction. This approach will allow networks to perform at their baseline accuracy while still maintaining the benefits of reduced precision and overall model size reduction.

📄 PDF Abstract BibTeX arXiv:1710.07706

Code (0)

등록된 구현이 없습니다.

Tasks

Quantization

Methods 이 논문이 사용한 방법론

Convolution A convolution is a type of matrix operation, consisting of a kernel, a small matrix of weights, that slides over input data performing element-wise multiplication with the…

Similar Papers 제목 키워드 기반

Closing Brackets with Recurrent Neural Networks

2018-11-01 · WS 2018 11 · Natalia Skachkova, Thomas Trost, Dietrich Klakow

Many natural and formal languages contain words or symbols that require a matching counterpart for making an expression well-formed. The combination of opening and closing brackets is a typical example of such a construc…

Language ModelingLanguage Modelling

Compressing RNNs for IoT devices by 15-38x using Kronecker Products

2019-06-07 · Urmish Thakker, Jesse Beu, Dibakar Gope, Chu Zhou 외

Recurrent Neural Networks (RNN) can be difficult to deploy on resource constrained devices due to their size.As a result, there is a need for compression techniques that can significantly compress RNNs without negatively…

Learning Compact Recurrent Neural Networks

2016-04-09 · Zhiyun Lu, Vikas Sindhwani, Tara N. Sainath

Recurrent neural networks (RNNs), including long short-term memory (LSTM) RNNs, have produced state-of-the-art results on a variety of speech recognition tasks. However, these models are often too large in size for deplo…

speech-recognitionSpeech Recognition

Turing Completeness of Bounded-Precision Recurrent Neural Networks

2021-12-01 · NeurIPS 2021 12 · Stephen Chung, Hava Siegelmann

Previous works have proved that recurrent neural networks (RNNs) are Turing-complete. However, in the proofs, the RNNs allow for neurons with unbounded precision, which is neither practical in implementation nor biologic…

RNNs are not Transformers (Yet): The Key Bottleneck on In-context Retrieval

2024-02-28 · Kaiyue Wen, Xingyu Dang, Kaifeng Lyu

This paper investigates the gap in representation powers of Recurrent Neural Networks (RNNs) and Transformers in the context of solving algorithmic problems. We focus on understanding whether RNNs, known for their memory…

RAGRetrievalRetrieval-augmented Generation