Probabilistically Masked Language Model Capable of Autoregressive Generation in Arbitrary Word Order

Code

• github.com/huawei-noah/Pretrained-Language-Model/tree/master/PMLM
  Officialtf★ 0
• github.com/jxmorris12/unsupervised-text-deidentification
  pytorch★ 14
• github.com/m-hahn/PMLM
  tf★ 0

Abstract

Masked language model and autoregressive language model are two types of language models. While pretrained masked language models such as BERT overwhelm the line of natural language understanding (NLU) tasks, autoregressive language models such as GPT are especially capable in natural language generation (NLG). In this paper, we propose a probabilistic masking scheme for the masked language model, which we call probabilistically masked language model (PMLM). We implement a specific PMLM with a uniform prior distribution on the masking ratio named u-PMLM. We prove that u-PMLM is equivalent to an autoregressive permutated language model. One main advantage of the model is that it supports text generation in arbitrary order with surprisingly good quality, which could potentially enable new applications over traditional unidirectional generation. Besides, the pretrained u-PMLM also outperforms BERT on a set of downstream NLU tasks.

Tasks

Reproductions