English
Related papers

Related papers: How Powerful are Decoder-Only Transformer Neural M…

200 papers

Language is typically modelled with discrete sequences. However, the most successful approaches to language modelling, namely neural networks, are continuous and smooth function approximators. In this work, we show that Transformer-based…

Computation and Language · Computer Science 2025-04-08 Samuele Marro , Davide Evangelista , X. Angelo Huang , Emanuele La Malfa , Michele Lombardi , Michael Wooldridge

The fields of generative AI and transfer learning have experienced remarkable advancements in recent years especially in the domain of Natural Language Processing (NLP). Transformers have been at the heart of these advancements where the…

Computation and Language · Computer Science 2024-02-28 Majd Saleh , Stéphane Paquelet

We find limits to the Transformer architecture for language modeling and show it has a universal prediction property in an information-theoretic sense. We further analyze performance in non-asymptotic data regimes to understand the role of…

Machine Learning · Computer Science 2023-07-18 Sourya Basu , Moulik Choraria , Lav R. Varshney

Nobody knows how language works, but many theories abound. Transformers are a class of neural networks that process language automatically with more success than alternatives, both those based on neural computations and those that rely on…

Computation and Language · Computer Science 2024-08-08 Felix Hill

Understanding the locus of semantic representation in large language models (LLMs) is crucial for interpretability and architectural innovation. The dominant paradigm posits that trainable input embeddings serve as foundational "meaning…

Computation and Language · Computer Science 2025-10-16 A. Bochkov

The impressive performance of large language models (LLMs) has led to their consideration as models of human language processing. Instead, we suggest that the success of LLMs arises from the flexibility of the transformer learning…

Computation and Language · Computer Science 2024-11-19 Xiaoliang Luo , Michael Ramscar , Bradley C. Love

The programming landscape is nowadays being reshaped by the advent of Large Language Models (LLMs) able to automate code-related tasks related to code implementation (e.g., code completion) and comprehension (e.g., code summarization). Such…

Software Engineering · Computer Science 2025-01-10 Nathan Cooper , Rosalia Tufano , Gabriele Bavota , Denys Poshyvanyk

The transformer architecture has demonstrated remarkable capabilities in modern artificial intelligence, among which the capability of implicitly learning an internal model during inference time is widely believed to play a key role in the…

Machine Learning · Computer Science 2026-02-10 Zhiheng Chen , Ruofan Wu , Guanhua Fang

Transformer-based large language models (LLMs) have demonstrated surprisingly robust performance across a wide range of language-related tasks, including programming language understanding and generation. In this paper, we take the first…

Programming Languages · Computer Science 2025-01-28 Xiyu Zhai , Runlong Zhou , Liao Zhang , Simon Shaolei Du

Long Short-Term Memory (LSTM) and Transformers are two popular neural architectures used for natural language processing tasks. Theoretical results show that both are Turing-complete and can represent any context-free language (CFL).In…

Computation and Language · Computer Science 2022-03-24 Hui Shi , Sicun Gao , Yuandong Tian , Xinyun Chen , Jishen Zhao

Large Language Models (LLMs) have made significant advances in natural language processing, but their underlying mechanisms are often misunderstood. Despite exhibiting coherent answers and apparent reasoning behaviors, LLMs rely on…

Computation and Language · Computer Science 2024-08-05 Bo Zhou , Daniel Geißler , Paul Lukowicz

In the large language model (LLM) revolution, embedding is a key component of various systems, such as retrieving knowledge or memories for LLMs or building content moderation filters. As such cases span from English to other natural or…

Computation and Language · Computer Science 2025-05-23 Xin Zhang , Zehan Li , Yanzhao Zhang , Dingkun Long , Pengjun Xie , Meishan Zhang , Min Zhang

We show that transformer-based large language models are computationally universal when augmented with an external memory. Any deterministic language model that conditions on strings of bounded length is equivalent to a finite automaton,…

Computation and Language · Computer Science 2023-01-12 Dale Schuurmans

Language models have emerged as a critical area of focus in artificial intelligence, particularly with the introduction of groundbreaking innovations like ChatGPT. Large-scale Transformer networks have quickly become the leading approach…

Artificial Intelligence · Computer Science 2024-12-12 Wei Wang , Qing Li

The Extended Church-Turing Thesis (ECTT) posits that all effective information processing, including unbounded and non-uniform interactive computations, can be described in terms of interactive Turing machines with advice. Does this…

Formal Languages and Automata Theory · Computer Science 2024-09-12 Jiří Wiedermann , Jan van Leeuwen

Transformers have revolutionized machine learning with their simple yet effective architecture. Pre-training Transformers on massive text datasets from the Internet has led to unmatched generalization for natural language understanding…

Recent studies have demonstrated that the performance of transformers on the task of language modeling obeys a power-law relationship with model size over six orders of magnitude. While transformers exhibit impressive scaling, their…

Machine Learning · Computer Science 2021-10-07 Narsimha Chilkuri , Eric Hunsberger , Aaron Voelker , Gurshaant Malik , Chris Eliasmith

Large Language Models (LLMs) represent a class of deep learning models adept at understanding natural language and generating coherent responses to various prompts or queries. These models far exceed the complexity of conventional neural…

Machine Learning · Computer Science 2024-12-05 Minghao Shao , Abdul Basit , Ramesh Karri , Muhammad Shafique

We study succinctness as a measure of the expressive power of transformers. Succinctness -- how compactly a formalism can describe a language relative to other formalisms -- is a classical notion in logic and automata theory. We prove that…

Formal Languages and Automata Theory · Computer Science 2026-05-18 Pascal Bergsträßer , Ryan Cotterell , Anthony W. Lin

What do large language models actually model? Do they tell us something about human capacities, or are they models of the corpus we've trained them on? I give a non-deflationary defence of the latter position. Cognitive science tells us…

Computation and Language · Computer Science 2025-08-27 Colin Klein