about
Griffin: Mixing Gated Linear Recurrences with Local Attention (arxiv.org)
6 points by tosh on Apr 9, 2024 | hide | past | pdf | discuss on HN

In plain words: A language model that remembers past text through a simple running memory and also lets nearby words look at each other. It matched Llama-2's quality while training on over 6 times fewer tokens, and runs faster when generating text.

Abstract · Griffin: Mixing Gated Linear Recurrences with Local Attention for Efficient Language Models

Recurrent neural networks (RNNs) have fast inference and scale efficiently on long sequences, but they are difficult to train and hard to scale. We propose Hawk, an RNN with gated linear recurrences, and Griffin, a hybrid model that mixes gated linear recurrences with local attention. Hawk exceeds the reported performance of Mamba on downstream tasks, while Griffin matches the performance of Llama-2 despite being trained on over 6 times fewer tokens. We also show that Griffin can extrapolate on sequences significantly longer than those seen during training. Our models match the hardware efficiency of Transformers during training, and during inference they have lower latency and significantly higher throughput. We scale Griffin up to 14B parameters, and explain how to shard our models for efficient distributed training.

Soham De, Samuel L. Smith, Anushan Fernando, Aleksandar Botev, George Cristian-Muraru, Albert Gu, Ruba Haroun, Leonard Berrada, Yutian Chen, Srivatsan Srinivasan, Guillaume Desjardins, Arnaud Doucet, et al.
arXiv:2402.19427 · cs.LG, cs.CL · submitted Feb 29, 2024
abstract · pdf · html · 25 pages, 11 figures

add comment on HN
Also discussed: Apr 2024 (2 points, 0 comments) · Apr 2024 (9 points, 1 comment) · Mar 2024 (1 point, 0 comments) · Mar 2024 (6 points, 1 comment)