DCLGJul 16, 2020

FTRANS: Energy-Efficient Acceleration of Transformers using FPGA

arXiv:2007.08563v1225 citations
Originality Incremental advance
AI Analysis

This work addresses the computational and memory bottlenecks for deploying transformers in edge or low-power devices, representing an incremental improvement in hardware acceleration.

The paper tackles the problem of deploying large transformer models on resource-constrained devices by proposing FTRANS, an FPGA-based acceleration framework that reduces model size by up to 16 times and achieves up to 81x improvement in energy efficiency compared to CPU.

In natural language processing (NLP), the "Transformer" architecture was proposed as the first transduction model replying entirely on self-attention mechanisms without using sequence-aligned recurrent neural networks (RNNs) or convolution, and it achieved significant improvements for sequence to sequence tasks. The introduced intensive computation and storage of these pre-trained language representations has impeded their popularity into computation and memory-constrained devices. The field-programmable gate array (FPGA) is widely used to accelerate deep learning algorithms for its high parallelism and low latency. However, the trained models are still too large to accommodate to an FPGA fabric. In this paper, we propose an efficient acceleration framework, Ftrans, for transformer-based large scale language representations. Our framework includes enhanced block-circulant matrix (BCM)-based weight representation to enable model compression on large-scale language representations at the algorithm level with few accuracy degradation, and an acceleration design at the architecture level. Experimental results show that our proposed framework significantly reduces the model size of NLP models by up to 16 times. Our FPGA design achieves 27.07x and 81x improvement in performance and energy efficiency compared to CPU, and up to 8.80x improvement in energy efficiency compared to GPU.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes