Open-ended Long Text Generation via Masked Language Modeling
Xiaobo Liang, Zecheng Tang, Juntao Li, Min Zhang
Main: Generation Main-poster Paper
Session 1: Generation (Virtual Poster)
Conference Room: Pier 7&8
Conference Time: July 10, 11:00-12:30 (EDT) (America/Toronto)
Global Time: July 10, Session 1 (15:00-16:30 UTC)
Keywords:
efficient models
TLDR:
Pre-trained autoregressive (AR) language models such as BART and GPTs have dominated OPen-ended Long Text Generation (Open-LTG).
However, the AR nature will decrease the inference efficiency along with the increase of generation length, which hinder their application in Open-LTG.
To improve inferenc...
You can open the
#paper-P5792
channel in a separate window.
Abstract:
Pre-trained autoregressive (AR) language models such as BART and GPTs have dominated OPen-ended Long Text Generation (Open-LTG).
However, the AR nature will decrease the inference efficiency along with the increase of generation length, which hinder their application in Open-LTG.
To improve inference efficiency, we alternatively explore the potential of the pre-trained masked language models (MLMs) along with a representative iterative non-autoregressive (NAR) decoding strategy for Open-LTG.
Our preliminary study shows that pre-trained MLMs can merely generate short text and will collapse for long text modeling.
To enhance the long text generation capability of MLMs, we introduce two simple yet effective strategies for the iterative NAR model: dynamic sliding window attention (DSWA) and linear temperature decay (LTD).
It can alleviate long-distance collapse problems and achieve longer text generation with a flexible trade-off between performance and inference speedup.
Experiments on the storytelling and multi-paragraph opinionated article writing tasks show that pre-trained MLMs can achieve more than
3 $\times$ $\to$ 13 $\times$ speedup with better performance than strong AR models.