arXiv:1512.01322
Fixed-Point Performance Analysis of Recurrent Neural Networks
원문 초록
Recurrent neural networks have shown excellent performance in many applications, however they require increased complexity in hardware or software based implementations. The hardware complexity can be much lowered by minimizing the word-length of weights and signals. This work analyzes the fixed-point performance of recurrent neural networks using a retrain based quantization method. The quantization sensitivity of each layer in RNNs is studied, and the overall fixed-point optimization results minimizing the capacity of weights while not sacrificing the performance are presented. A language model and a phoneme recognition examples are used.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Discrete Audio Tokens: More Than a Survey!
MNN-LLM: A Generic Inference Engine for Fast Large Language Model Deployment on Mobile Devices
LaMAGIC2: Advanced Circuit Formulations for Language Model-Based Analog Topology Generation
Parameter Efficient Fine Tuning Llama 3.1 for Answering Arabic Legal Questions: A Case Study on Jordanian Laws
Mlphon: A Multifunctional Grapheme-Phoneme Conversion Tool Using Finite State Transducers
Specification-based Security Evaluation of Real-World Agents Tool-Calling under Long-Horizon Context Tasks
토론
이 논문과 연결된 포럼 글이 아직 없습니다.