English
Related papers

Related papers: Physics of Language Models: Part 1, Learning Hiera…

200 papers

Standard transformer-based language models, while powerful for general text, often struggle with the fine-grained syntax and entity relationships in complex technical, engineering documents. To address this, we propose the Contextual Graph…

Computation and Language · Computer Science 2025-08-05 Karan Reddy , Mayukha Pal

A longstanding question in cognitive science concerns the learning mechanisms underlying compositionality in human cognition. Humans can infer the structured relationships (e.g., grammatical rules) implicit in their sensory observations…

Machine Learning · Computer Science 2021-05-20 Jacob Russin , Roland Fernandez , Hamid Palangi , Eric Rosen , Nebojsa Jojic , Paul Smolensky , Jianfeng Gao

Human beings possess the most sophisticated computational machinery in the known universe. We can understand language of rich descriptive power, and communicate in the same environment with astonishing clarity. Two of the many contributors…

Computation and Language · Computer Science 2021-01-01 Karthikeya Ramesh Kaushik , Andrea E. Martin

Recurrent neural network grammars (RNNG) are a recently proposed probabilistic generative modeling family for natural language. They show state-of-the-art language modeling and parsing performance. We investigate what information they…

Computation and Language · Computer Science 2017-01-12 Adhiguna Kuncoro , Miguel Ballesteros , Lingpeng Kong , Chris Dyer , Graham Neubig , Noah A. Smith

Reasoning has become a central capability in large language models. Recent research has shown that reasoning performance can be improved by looping an LLM's layers in the latent dimension, resulting in looped reasoning language models.…

Synchronous Context-Free Grammars (SCFGs), also known as syntax-directed translation schemata, are unlike context-free grammars in that they do not have a binary normal form. In general, parsing with SCFGs takes space and time polynomial in…

Formal Languages and Automata Theory · Computer Science 2013-11-27 Pierluigi Crescenzi , Daniel Gildea , Andrea Marino , Gianluca Rossi , Giorgio Satta

The underlying structure of natural language is hierarchical; words combine into phrases, which in turn form clauses. An awareness of this hierarchical structure can aid machine learning models in performing many linguistic tasks. However,…

Machine Learning · Computer Science 2020-04-01 Ashok Thillaisundaram

Token representation strategies within large-scale neural architectures often rely on contextually refined embeddings, yet conventional approaches seldom encode structured relationships explicitly within token interactions. Self-attention…

Computation and Language · Computer Science 2025-03-27 James Blades , Frederick Somerfield , William Langley , Susan Everingham , Maurice Witherington

A major problem in the study of large language models is to understand their inherent low-dimensional structure. We introduce an approach to study the low-dimensional structure of language models at a model-agnostic level: as sequential…

Machine Learning · Computer Science 2025-10-30 Noah Golowich , Allen Liu , Abhishek Shetty

Deep Learning and Machine Learning based models have become extremely popular in text processing and information retrieval. However, the non-linear structures present inside the networks make these models largely inscrutable. A significant…

Information Retrieval · Computer Science 2026-03-12 Sourav Saha , Debapriyo Majumdar , Mandar Mitra

Continual Pre-Training (CPT) is essential for enabling Language Models (LMs) to integrate new knowledge without erasing old. While classical CPT techniques like data replay have become the standard paradigm, the mechanisms underlying how…

Computation and Language · Computer Science 2026-05-12 Haoyu Wang , Yifan Shang , Zhongxiang Sun , Weijie Yu , Xiao Zhang , Jun Xu

Classifier-Free Guidance (CFG) has recently emerged in text-to-image generation as a lightweight technique to encourage prompt-adherence in generations. In this work, we demonstrate that CFG can be used broadly as an inference-time…

Computation and Language · Computer Science 2023-07-03 Guillaume Sanchez , Honglu Fan , Alexander Spangher , Elad Levi , Pawan Sasanka Ammanamanchi , Stella Biderman

Instruction-tuned large language models have shown remarkable performance in aligning generated text with user intentions across various tasks. However, maintaining human-like discourse structure in the generated text remains a challenging…

Computation and Language · Computer Science 2023-12-20 Yinhong Liu , Yixuan Su , Ehsan Shareghi , Nigel Collier

Recent large language models have demonstrated relevant capabilities in solving problems that require logical reasoning; however, the corresponding internal mechanisms remain largely unexplored. In this paper, we show that a small language…

Artificial Intelligence · Computer Science 2025-10-13 Davide Maltoni , Matteo Ferrara

In this paper, we study whether transformer-based language models can extract predicate argument structure from simple sentences. We firstly show that language models sometimes confuse which predicates apply to which objects. To mitigate…

Computation and Language · Computer Science 2024-10-07 Akshay Chaturvedi , Nicholas Asher

Large Language Models (LLMs) have demonstrated significant improvements in reasoning capabilities through supervised fine-tuning and reinforcement learning. However, when training reasoning models, these approaches are primarily applicable…

Computation and Language · Computer Science 2025-05-16 Yoichi Ishibashi , Taro Yano , Masafumi Oyamada

We present a setup for training, evaluating and interpreting neural language models, that uses artificial, language-like data. The data is generated using a massive probabilistic grammar (based on state-split PCFGs), that is itself derived…

Computation and Language · Computer Science 2023-10-24 Jaap Jumelet , Willem Zuidema

We investigate the extent to which modern, neural language models are susceptible to structural priming, the phenomenon whereby the structure of a sentence makes the same structure more probable in a follow-up sentence. We explore how…

Computation and Language · Computer Science 2022-06-30 Arabella Sinclair , Jaap Jumelet , Willem Zuidema , Raquel Fernández

We study feature interactions in the context of feature attribution methods for post-hoc interpretability. In interpretability research, getting to grips with feature interactions is increasingly recognised as an important challenge,…

Computation and Language · Computer Science 2023-06-22 Jaap Jumelet , Willem Zuidema

While large language models (LLMs) appear to be increasingly capable of solving compositional tasks, it is an open question whether they do so using compositional mechanisms. In this work, we investigate how feedforward LLMs solve two-hop…

Computation and Language · Computer Science 2026-05-11 Apoorv Khandelwal , Ellie Pavlick