CLDec 12, 2021

Towards More Efficient Insertion Transformer with Fractional Positional Encoding

arXiv:2112.06295v3267 citations
Originality Incremental advance
AI Analysis

This work addresses a specific computational bottleneck for researchers and practitioners using insertion-based text generation models.

The paper tackles the computational inefficiency of Insertion Transformers by proposing Fractional Positional Encoding (FPE), which reduces floating-point operations and improves latency in batched decoding across text generation tasks.

Auto-regressive neural sequence models have been shown to be effective across text generation tasks. However, their left-to-right decoding order prevents generation from being parallelized. Insertion Transformer (Stern et al., 2019) is an attractive alternative that allows outputting multiple tokens in a single generation step. Nevertheless, due to the incompatibility between absolute positional encoding and insertion-based generation schemes, it needs to refresh the encoding of every token in the generated partial hypothesis at each step, which could be costly. We design a novel reusable positional encoding scheme for Insertion Transformers called Fractional Positional Encoding (FPE), which allows reusing representations calculated in previous steps. Empirical studies on various text generation tasks demonstrate the effectiveness of FPE, which leads to floating-point operation reduction and latency improvements on batched decoding.

Code Implementations1 repo
Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes