about
Pretrained Transformers As Universal Computation Engines (2021) (arxiv.org)
3 points by optimalsolver on May 13, 2022 | hide | past | pdf | discuss on HN

In plain words: A transformer trained on text is frozen—its core layers stay untouched—while only small input and output pieces are trained to handle numbers, images, and protein shapes. Text pretraining helps even on these tasks, beating the same transformer with random weights or a step-by-step memory network.

Abstract · Pretrained Transformers as Universal Computation Engines

We investigate the capability of a transformer pretrained on natural language to generalize to other modalities with minimal finetuning -- in particular, without finetuning of the self-attention and feedforward layers of the residual blocks. We consider such a model, which we call a Frozen Pretrained Transformer (FPT), and study finetuning it on a variety of sequence classification tasks spanning numerical computation, vision, and protein fold prediction. In contrast to prior works which investigate finetuning on the same modality as the pretraining dataset, we show that pretraining on natural language can improve performance and compute efficiency on non-language downstream tasks. Additionally, we perform an analysis of the architecture, comparing the performance of a random initialized transformer to a random LSTM. Combining the two insights, we find language-pretrained transformers can obtain strong performance on a variety of non-language tasks.

Kevin Lu, Aditya Grover, Pieter Abbeel, Igor Mordatch
arXiv:2103.05247 · cs.LG, cs.AI · submitted Mar 9, 2021 · updated Jun 30, 2021
abstract · pdf · html

add comment on HN
Also discussed: Jun 2025 (2 points, 0 comments) · Mar 2021 (3 points, 0 comments)