Adaptive Input Representations for Neural Language Modeling

Alexei Baevski, Michael Auli

Abstract: We introduce adaptive input representations for neural language modeling which extend the adaptive softmax of Grave et al. (2017) to input representations of variable capacity. There are several choices on how to factorize the input and output layers, and whether to model words, characters or sub-word units. We perform a systematic comparison of popular choices for a self-attentional architecture. Our experiments show that models equipped with adaptive embeddings are more than twice as fast to train than the popular character input CNN while having a lower number of parameters. On the WikiText-103 benchmark we achieve 18.7 perplexity, an improvement of 10.5 perplexity compared to the previously best published result and on the Billion Word benchmark, we achieve 23.02 perplexity.

Keywords: Neural language modeling

TL;DR: Variable capacity input word embeddings and SOTA on WikiText-103, Billion Word benchmarks.

Code: [ pytorch/fairseq](https://github.com/pytorch/fairseq) + [ 2 community implementations](https://paperswithcode.com/paper/?openreview=ByxZX20qFQ)

Data: [Billion Word Benchmark](https://paperswithcode.com/dataset/billion-word-benchmark), [WikiText-103](https://paperswithcode.com/dataset/wikitext-103), [WikiText-2](https://paperswithcode.com/dataset/wikitext-2)

Community Implementations: [ 3 code implementations](https://www.catalyzex.com/paper/arxiv:1809.10853/code)