Jonas Rohweder
Author directory2026
Relational Linearity is a Predictor of Hallucinations
Yuetian Lu | Yihong Liu | Sebastian Gerstner | Lea Hirlimann | Jonas Rohweder | Hinrich Schuetze
Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing
Yuetian Lu | Yihong Liu | Sebastian Gerstner | Lea Hirlimann | Jonas Rohweder | Hinrich Schuetze
Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing
Hallucination is a central failure mode of language models (LMs). We focus on hallucinations in response to questions like: “Which instrument did Glenn Gould play?”, but we ask these questions for synthetic entities designed to be unknown to the model. We find that LMs like Gemma-7B-IT frequently hallucinate, i.e., they have difficulty recognizing that the hallucinated fact is not part of their knowledge. Based on the idea of linear relational embeddings, we put forward the following hypothesis. (i) Due to the abstract scheme that is used to represent them, LMs can easily produce plausible objects for non-existing subjects of linear relations, which can lead to hallucinations. (ii) For nonlinear relations, this mechanism for producing an object is not available and so a hallucination is easier to avoid. To test this hypothesis, we create SyntHal, a synthetic unknown-entity benchmark for 15 relations. We find that across four instruction-tuned models, relational linearity is a strong predictor of models hallucinating an object for an unknown subject vs refusing to give an answer, with correlations r ∈ [.58, .84]$. While this is not direct evidence for the hypothesized causal mechanism, it is suggestive and opens up a new line of inquiry into understanding LM hallucinations.
Patches of Nonlinearity: Instruction Vectors in Large Language Models
Irina Bigoulaeva | Jonas Rohweder | Subhabrata Dutta | Iryna Gurevych
Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
Irina Bigoulaeva | Jonas Rohweder | Subhabrata Dutta | Iryna Gurevych
Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
Despite the recent success of instruction-tuned language models and their ubiquitous usage, very little is known of how models process instructions internally. In this work, we address this gap from a mechanistic point of view by investigating how instruction-specific representations are constructed and utilized in different stages of post-training: Supervised Fine-Tuning (SFT) and Direct Preference Optimization (DPO). Via causal mediation, we identify that instruction representation is fairly localized in models. These representations, which we call Instruction Vectors (IVs), demonstrate a curious juxtaposition of linear separability along with non-linear causal interaction, broadly questioning the scope of the linear representation hypothesis commonplace in mechanistic interpretability. To disentangle the non-linear causal interaction, we propose a novel method to localize information processing in language models that is free from the implicit linear assumptions of patching-based techniques. We find that, conditioned on the task representations formed in the early layers, different information pathways are selected in the later layers to solve that task, i.e., IVs act as circuit selectors.