about
Retentive Network: A Successor to Transformer for Large Language Models (arxiv.org)
4 points by beefman on Jul 19, 2023 | hide | past | pdf | 1 comment on HN

In plain words: A new sequence-processing design called retention runs three ways: all at once for fast training, step by step for cheap generation, or in chunks for long texts. It matches the usual transformer's language quality while keeping each new word's cost constant, so decoding uses less memory and runs faster.

Abstract

In this work, we propose Retentive Network (RetNet) as a foundation architecture for large language models, simultaneously achieving training parallelism, low-cost inference, and good performance. We theoretically derive the connection between recurrence and attention. Then we propose the retention mechanism for sequence modeling, which supports three computation paradigms, i.e., parallel, recurrent, and chunkwise recurrent. Specifically, the parallel representation allows for training parallelism. The recurrent representation enables low-cost $O(1)$ inference, which improves decoding throughput, latency, and GPU memory without sacrificing performance. The chunkwise recurrent representation facilitates efficient long-sequence modeling with linear complexity, where each chunk is encoded parallelly while recurrently summarizing the chunks. Experimental results on language modeling show that RetNet achieves favorable scaling results, parallel training, low-cost deployment, and efficient inference. The intriguing properties make RetNet a strong successor to Transformer for large language models. Code will be available at https://aka.ms/retnet.

Yutao Sun, Li Dong, Shaohan Huang, Shuming Ma, Yuqing Xia, Jilong Xue, Jianyong Wang, Furu Wei
arXiv:2307.08621 · cs.CL, cs.LG · submitted Jul 17, 2023 · updated Aug 9, 2023
abstract · pdf · html

add comment on HN
Also discussed: Jul 2023 (112 points, 19 comments) · Jul 2023 (3 points, 0 comments) · Jul 2023 (6 points, 0 comments) · Jul 2023 (11 points, 3 comments)