Transformers have outperformed recurrent neural networks (RNNs)  in natural language generation.
But this comes with a significant computational cost, as the attention mechanism’s complexity scales quadratically with sequence length.
Efficient transformer variants have received increasing interest in recent works.
Among them, a linear-complexityrecurrentvariant has proven well suited for autoregressive generation.
It approximates the softmax attention with randomized or heuristic feature maps,
but can be difficult to train and may yield suboptimal accuracy.
This work aims toconverta pretrained transformer into its efficient recurrent counterpart,
improving efficiency while maintaining accuracy.
Specifically, we propose aswap-then-finetuneprocedure:
in an off-the-shelf pretrained transformer,
we replace the softmax attention with its linear-complexity recurrent alternative
and then finetune.
With a learned feature map, our approach
provides an improved tradeoff between efficiency and accuracy over the standard transformer and other recurrent variants.
We also show that the finetuning process has lower training cost relative to training these recurrent variants from scratch.
As many models for natural language tasks are increasingly dependent on large-scale pretrained transformers, this work presents a viable approach to improving inference efficiency without repeating the expensive pretraining process.111https://github.com/jungokasai/T2R/.