Our model generates a candidate summary in a non-autoregressive fashion, in contrast to the beam search in Zhou and Rush (2019).
we are able to simultaneously consider forward and backward language models, using the geometric average of their perplexities.