Skip to content

Category

natural language processing

3,231 papers

Do Models Read What They Write? Causal Registers in Scratchpad Reasoning

A central hope behind process supervision is that models can expose intermediate variables that matter for their later behavior. For this to help with alignment, a scratchpad must be tied to the computation: when the model writes a state, later steps should compute from that state. To test this requirement, we use a controlled state-tracking task with a known update rule, comparing models trained to report only the final state with models trained to write intermediate states before giving the final answer. At evaluation, we edit the internal representation of one written state while leaving the visible scratchpad text fixed. Because the transition rule is known, the edit has a single correct downstream consequence. In Qwen2.5-Coder-7B, the state-writing model predicts the next phase bit implied by the edited state on 80% and 91% of held-out examples across the two task variants, while pretrained and final-answer-only controls remain near baseline. Additional controls rule out generic next-token steering and copying another continuation: the prediction depends on both the edited state and the current move. The same causal-use pattern replicates across model families. Together, these results suggest a sharper goal for scratchpad oversight: not just to make intermediate reasoning legible, but to train written states that the model uses as part of its computation.

Benjamin Shih, John Winnicki, Eric Darve · 0 citations
#natural language process... Preprint Jul 2026

MemDefrag: Latent Memory Defragmentation for Large Language Models

MemDefrag, a training-free and model-agnostic framework that uses a middle-layer tracing signal to conduct memory defragmentation (rank, reorder, and filter memories), and applies an informativeness-guided proportional forgetting mechanism once capacity is exceeded, is proposed.

Ruiyi Yan, Zhuoyuan Mao, Yiwen Guo · 0 citations

Beyond Compilation: Evaluating Faithful Natural-Language-to-Lean Statement Formalization

This work uses a full $2^3$ factorial design to decompose three recurring interventions in formalization pipelines: parametric expert drafting, Mathlib/context search, and Lean elaboration feedback, suggesting that formal validity, proof-oriented Lean competence, and faithful statement generation should be reported separately.

Ke Zhang, P. Gallardo, S. Murthy et al. · 1 citation
#natural language process... Preprint Aug 2026

Gaokerena: A Small Persian Medical Language Model Family

Gaokerena, a novel family of compact Persian medical language models optimized for deployment on consumer grade hardware, and Gaokerena-R, a novel family of compact Persian medical language models optimized for deployment on consumer grade hardware, are presented.

Mehrdad Ghassabi, Hamidreza Baradaran Kashani, Pedram Rostami et al. · 0 citations
#natural language process... Preprint Aug 2026

MameLoshnLM: Yiddish Language Model and Evaluation Benchmark

MameLoshnLM, the first open-source 8B-parameter language model built specifically for Yiddish, is presented, providing both a foundation for Yiddish NLP and a practical template for language model development in historically rich but digitally underrepresented languages.

Uri Katz, Omer Goldman, Tomasz Limisiewicz et al. · 0 citations
#natural language process... Preprint Jun 2026

ALEE: Any-Language Evaluation of Embeddings via English-Centric Minimal Pairs

A large-scale empirical study across a diverse set of embedding models and 275+ languages spanning three parallel datasets, exposing persistent gaps in cross-lingual semantic representation that track language prevalence in training resources and subword tokenization.

Andrianos Michail, Stylianos Psychias, Michelle Wastl et al. · 0 citations
#computer vision Preprint Aug 2026

LookBack: Where and How to Score LVLM Responses via Visual Reference Usage

LookBack, a training-free LVLM response scoring method that augments token likelihood with visual lookback score, a lightweight measure of how strongly each response token refers to image tokens, consistently improves Best-of-$N$ selection over existing baselines with negligible additional overhead.

Beomsik Cho, Jin-Ha Kim, Dongseok Lee et al. · 0 citations
#natural language process... Book Open access Aug 2026

Caduceus: MoE Foundation Models for Unifying Biological and Natural Language

This paper introduces Caduceus, a family of MoE-enhanced foundation models built with a hierarchical pre-training paradigm to jointly integrate biological and natural language, and incorporates a multi-task instruction tuning phase, enabling robust protein parsing and natural language question answering.

Mingze Yin, Yiheng Zhu, Jialu Wu et al. · 0 citations
#machine learning Preprint Aug 2026

Gated Recurrent Transformers: Expressive Depth through Recurrent Modulation

Scaling transformer language models creates an inherent tension between expressivity and memory efficiency. While unique weights across layers preserve functional specialization---from input-grounding to abstract refinement---they incur a substantial memory footprint. Conversely, standard depth-sharing enforces uniform transformations that collapse representational diversity and degrade modeling quality. We introduce Gated Recurrent Transformer, a recurrent depth transformer where fixed-depth prelude and coda blocks bracket a single shared core iterated R times. Inspired by gated recurrent neural networks, we employ a lightweight projection and an elementwise update gate---conditioned on the hidden state, the fixed prelude output, and noise resampled at every step---to modulate the recurrent update. This allows the model to specialize the input to the same few layers across recurrences, rather than requiring many unique layers to achieve functional diversity. Under an isoFLOPS constraint, a 3-layer Gated Recurrent Transformer matches the accuracy of a 12-layer GPT-2 Small baseline with similar training and inference FLOPs, and leads MoR and heavy-tail depth sampling in all nine scale-by-budget cells; at medium and large scale it approaches dense quality at the standard token budget and overtakes it at medium scale once that budget is doubled. Under an isoPARAMS constraint, deeper recurrence achieves a 2.76 validation loss versus 2.84 for a non-recurrent counterpart at matched parameter and data budget. Our results demonstrate that adaptive depth reuse is a principled strategy for trading parameters for quality: at large scale, 63% fewer parameters and 59% less peak decoding memory for a 10% increase in compiled generation latency.

Amr Hegazy, Amr Alanwar, Mostafa Elhoushi · 0 citations

From tech blogs

See all →
MIT News · Artificial Intelligence Aug 27, 2026

Looking beyond natural sequences

A new machine-learning framework aims to improve the success rate of computational protein design while moving away from results that reproduce sequences found in nature.

MIT News · Artificial Intelligence Aug 20, 2026

Paving the way for greener ammonia production

New MIT research could lead to better materials for a fossil-fuel-free process for making the chemical that's essential to fertilizer and other products.

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.