paper-with-me

Papers

Language Models with Transformers

2019-04-20 · arXiv 2019 10 · Chenguang Wang, Mu Li, Alexander J. Smola

The Transformer architecture is superior to RNN-based models in computational efficiency. Recently, GPT and BERT demonstrate the efficacy of Transformer models on various NLP tasks using pre-trained language models on large-scale corpora. Surprisingly, these Transformer architectures are suboptimal for language model itself. Neither self-attention nor the positional encoding in the Transformer is able to efficiently incorporate the word-level sequential context crucial to language modeling. In this paper, we explore effective Transformer architectures for language model, including adding additional LSTM layers to better capture the sequential context while still keeping the computation efficient. We propose Coordinate Architecture Search (CAS) to find an effective architecture through iterative refinement of the model. Experimental results on the PTB, WikiText-2, and WikiText-103 show that CAS achieves perplexities between 20.42 and 34.11 on all problems, i.e. on average an improvement of 12.0 perplexity units compared to state-of-the-art LSTMs. The source code is publicly available.

📄 PDF Abstract BibTeX arXiv:1904.09408

Code (1)

cgraywang/gluon-nlp-1 공식 구현 mxnet

Tasks

Computational EfficiencyLanguage ModelingLanguage ModellingNeural Architecture Search

Methods 이 논문이 사용한 방법론

Linear Layer A Linear Layer is a projection $\mathbf{XW + b}$.
Absolute Position Encodings Absolute Position Encodings are a type of position embeddings for [Transformer-based models] where positional encodings are…
Position-Wise Feed-Forward Layer 설명 없음
Cosine Annealing Cosine Annealing is a type of learning rate schedule that has the effect of starting with a large learning rate that is relatively rapidly decreased to a minimum value before…
Sigmoid Activation 설명 없음
Tanh Activation 설명 없음
Residual Connection 설명 없음
Attention Dropout Attention Dropout is a type of dropout used in attention-based architectures, where elements are randomly dropped out of the…

Similar Papers 제목 키워드 기반

Can Transformers Learn $n$-gram Language Models?

2024-10-03 · Anej Svete, Nadav Borenstein, Mike Zhou, Isabelle Augenstein 외

Much theoretical work has described the ability of transformers to represent formal languages. However, linking theoretical results to empirical performance is not straightforward due to the complex interplay between the…

Context-Free Recognition with Transformers

2026-01-05 · Selim Jerad, Anej Svete, Sophie Hao, Ryan Cotterell 외 arxiv

Transformers excel empirically on tasks that process well-formed inputs according to some grammar, such as natural language and code. However, it remains unclear how they can process grammatical syntax. In fact, under st…

Masked Hard-Attention Transformers Recognize Exactly the Star-Free Languages

2023-10-21 · Andy Yang, David Chiang, Dana Angluin

The expressive power of transformers over inputs of unbounded size can be studied through their ability to recognize classes of formal languages. In this paper, we establish exact characterizations of transformers with h…

Hard AttentionPosition

Softmax Transformers are Turing-Complete

2025-11-25 · Hongjian Jiang, Michael Hahn, Georg Zetzsche, Anthony Widjaja Lin arxiv

Hard attention Chain-of-Thought (CoT) transformers are known to be Turing-complete. However, it is an open problem whether softmax attention Chain-of-Thought (CoT) transformers are Turing-complete. In this paper, we prov…

Arithmetic Reasoning

On the Ability and Limitations of Transformers to Recognize Formal Languages

2020-09-23 · EMNLP 2020 11 · Satwik Bhattamishra, Kabir Ahuja, Navin Goyal

Transformers have supplanted recurrent models in a large number of NLP tasks. However, the differences in their abilities to model different syntactic properties remain largely unknown. Past works suggest that LSTMs gene…