Where does the novelty a base language model produces with no task come from, and what can an LLM judge of a long stream actually see? We dismantle a cognitively inspired generation loop over 24 conditions on three base models. Most of its effect lives in one operation: a new subject injected every few hundred tokens (...
This work introduces Mimir, a 1.78B-parameter language model based on the Hierarchical Reasoning Model Text (HRM-Text) architecture, a recurrent-depth transformer whose layers are split into a low-level and high-level stack that are applied repeatedly in an interleaved schedule.
Peter Schneider-Kamp, Jacob Nielsen, Gianluca Barmina et al.· 1 citation
We introduce GRAB, a constructor-encoder-bridge pipeline for table question answering. Our method lifts relational data into an heterogeneous graph, encodes it via message passing, and transfers the signals to an LLM through a small set of query-conditioned latent tokens. This provides the LLM with a compact, task-rele...
Simone Varriale, Tamara Cucumides, Floris Geerts et al.· 0 citations
Benchmark scores often misrepresent a large language model's (LLM's) knowledge, because they rely, e.g., on the model's ability to follow specific formatting requirements. This especially penalizes base models that may know the correct answers but lack the ability -- typically introduced in post-training -- to structur...
Selen Erkan, Bastian Boll, Kristian Kersting et al.· 0 citations
Reach audiences
Advertise in front of researchers, engineers, and readers.
Diffusion language models (DLMs) have emerged as the leading non-autoregressive alternative to language modeling. Because their likelihoods are intractable, generative perplexity (gen-PPL) has become the de facto standard for reporting unconditional generation quality. We analyze why gen-PPL is unreliable as a measure...
An activation oracle is a language model trained to convert the activations of another model into natural language. However, it is so far unclear to what extent these verbalizations are calibrated. Crucially, the oracle's verbalization come without any measure of confidence. Here, we compare five methods for estimating...
Federico Torrielli, Peter Schneider-Kamp, Lukas Galke Poech· 0 citations
As large language model (LLM)-based agents increasingly participate in online discourse, red-teaming their capacity to support political influence campaigns is critical for information integrity. In pursuit of this goal, we focus on locally deployable open-source LLMs under an assumed threat model in which an operator...
Daniel C. Ruiz, Anna Serbina, Ashwin Rao et al.· 0 citations
Automatic speech recognition (ASR) systems are typically optimized for verbatim transcription, which preserves disfluencies, filler words, and informal spoken structures that are often unsuitable for downstream writing-oriented applications. A common workaround is a two-stage ASR+LLM pipeline for post-editing, but this...
Wanyi Ning, Yinshang Guo, Haitao Qian et al.· 0 citations
Automatic Speech Recognition (ASR) systems are widely used in everyday communication, education, healthcare, and industry, yet their performance remains uneven across speakers, particularly when dialectal variation diverges from the mainstream accents represented in training data. This study investigates ASR bias throu...
This work studies cross-lingual mathematical reasoning transfer in English-centric LLMs under controlled multilingual evaluation and finds that transfer is highly variable across initial model choice, target language, and training paradigm.
Wen Yang, Jun-Hong Wu, Chong Li et al.· Proceedings of the 2026 Conf...· 2 citations
Subword-based tokenization methods often fail to preserve morphological boundaries, a limitation especially pronounced in low-resource, morphologically complex languages such as those written in the Ge'ez script. To address this, we present Morpheme-aware Subword Vocabulary Construction (MoVoC) and train MoVoC-Tok, a t...
Hailay Kidu Teklehaymanot, Dren Fazlija, Wolfgang Nejdl· 0 citations
Test-time scaling has emerged as a key inference strategy for reasoning models, where a model generates a large number of candidate solutions in the hope of finding at least one correct solution. Running all candidate solutions to completion can be computationally demanding, so recent work prunes the candidate pool aft...
Mahdi Salmani, Adel Javanmard, Devansh Gupta et al.· 0 citations