English
Related papers

Related papers: Characterizing Pattern Matching and Its Limits on …

200 papers

Transformer large language models (LLMs) have sparked admiration for their exceptional performance on tasks that demand intricate multi-step reasoning. Yet, these models simultaneously show failures on surprisingly trivial problems. This…

Mechanistic interpretability aims to understand how neural networks generalize beyond their training data by reverse-engineering their internal structures. We introduce patterning as the dual problem: given a desired form of generalization,…

Machine Learning · Computer Science 2026-01-21 George Wang , Daniel Murfet

Large Language Models (LLMs) have benefited enormously from scaling, yet these gains are bounded by five fundamental limitations: (1) hallucination, (2) context compression, (3) reasoning degradation, (4) retrieval fragility, and (5)…

Instruction tuning is commonly assumed to endow language models with a domain-general ability to follow instructions, yet the underlying mechanism remains poorly understood. Does instruction-following rely on a universal mechanism or…

Artificial Intelligence · Computer Science 2026-04-08 Elisabetta Rocchetti , Alfio Ferrara

When trained on language data, do transformers learn some arbitrary computation that utilizes the full capacity of the architecture or do they learn a simpler, tree-like computation, hypothesized to underlie compositional meaning systems…

Computation and Language · Computer Science 2022-11-07 Shikhar Murty , Pratyusha Sharma , Jacob Andreas , Christopher D. Manning

Whether language models can systematically generalize remains actively debated. Yet empirical performance is jointly shaped by multiple factors such as training data, training paradigms, and inference-time strategies, making failures…

Artificial Intelligence · Computer Science 2026-04-17 Yao Tong , Jiayuan Ye , Anastasia Borovykh , Reza Shokri

Building a theoretical understanding of the capabilities of large language models (LLMs) is vital for our ability to predict and explain the behavior of these systems. Here, we investigate the structure of LLM capabilities by extracting…

Computation and Language · Computer Science 2023-06-21 Ryan Burnell , Han Hao , Andrew R. A. Conway , Jose Hernandez Orallo

We analyze the capabilities of Transformer language models in learning compositional discrete tasks. To this end, we evaluate training LLaMA models and prompting GPT-4 and Gemini on four tasks demanding to learn a composition of several…

Despite remarkable advances, large language models often fail at compositional reasoning tasks, a phenomenon exemplified by the ``curse of two-hop reasoning''. This paper introduces the Identity Bridge, a simple yet powerful mechanism that…

Machine Learning · Computer Science 2025-09-30 Pengxiao Lin , Zheng-An Chen , Zhi-Qin John Xu

Can neural networks systematically capture discrete, compositional task structure despite their continuous, distributed nature? The impressive capabilities of large-scale neural networks suggest that the answer to this question is yes.…

Machine Learning · Computer Science 2025-10-27 Florian Redhardt , Yassir Akram , Simon Schug

Large language models (LLMs) exhibit failure modes on seemingly trivial tasks. We propose a formalisation of LLM interaction using a deterministic multi-tape Turing machine, where each tape represents a distinct component: input characters,…

Computation and Language · Computer Science 2026-02-20 Magnus Boman

Numerous studies have shown that multimodal LLMs process speech and images well but fail in non-intuitive ways rendering trivial tasks such as object counting unreliable. We investigate this behavior from an information-theoretic…

Computation and Language · Computer Science 2026-03-09 Jayadev Billa

People use large language models (LLMs) when they should not. This is partly because they see LLMs compose poems and answer intricate questions, so they understandably, but incorrectly, assume LLMs won't stumble on basic tasks like simple…

Computation and Language · Computer Science 2025-12-29 Nathan Stringham , Fateme Hashemi Chaleshtori , Xinyuan Yan , Zhichao Xu , Bei Wang , Ana Marasović

Neural network models often generalize poorly to mismatched domains or distributions. In NLP, this issue arises in particular when models are expected to generalize compositionally, that is, to novel combinations of familiar words and…

Computation and Language · Computer Science 2021-11-10 Wang Zhu , Peter Shaw , Tal Linzen , Fei Sha

Large language models (LLMs) have shown an impressive ability to perform tasks believed to require thought processes. When the model does not document an explicit thought process, it becomes difficult to understand the processes occurring…

Computation and Language · Computer Science 2024-06-21 Yuval Shalev , Amir Feder , Ariel Goldstein

Analogical reasoning is a hallmark of human intelligence, enabling us to solve new problems by transferring knowledge from one situation to another. Yet, developing artificial intelligence systems capable of robust human-like analogical…

Machine Learning · Computer Science 2026-04-09 Philipp Hellwig , Willem Zuidema , Claire E. Stevenson , Martha Lewis

Scaling large language models (LLMs) leads to an emergent capacity to learn in-context from example demonstrations. Despite progress, theoretical understanding of this phenomenon remains limited. We argue that in-context learning relies on…

Computation and Language · Computer Science 2023-03-15 Michael Hahn , Navin Goyal

State Space Models (SSMs) have emerged as promising alternatives to attention mechanisms, with the Mamba architecture demonstrating impressive performance and linear complexity for processing long sequences. However, the fundamental…

Machine Learning · Computer Science 2026-01-22 Tianyi Chen , Pengxiao Lin , Zhiwei Wang , Zhi-Qin John Xu

The extent to which neural networks are able to acquire and represent symbolic rules remains a key topic of research and debate. Much current work focuses on the impressive capabilities of large language models, as well as their often…

Machine Learning · Computer Science 2025-06-11 Anna Langedijk , Jaap Jumelet , Willem Zuidema

Evaluating Large Language Models (LLMs) on reasoning benchmarks demonstrates their ability to solve compositional questions. However, little is known of whether these models engage in genuine logical reasoning or simply rely on implicit…

Computation and Language · Computer Science 2024-10-29 Houman Mehrafarin , Arash Eshghi , Ioannis Konstas
‹ Prev 1 2 3 10 Next ›