arXiv Computation and Language

Language Model Maps for Prompt-Response Distributions via Log-Likelihood Vectors

The paper introduces a method that represents language models as log‑likelihood vectors over prompt‑response pairs, enabling the construction of model maps that compare conditional distributions. Squared Euclidean distances in this vector space approximate KL divergence, and experiments show that these maps reveal global structure related to model attributes and task performance. The approach also captures systematic shifts from prompt changes, supports additive compositionality for predicting downstream scores, and offers PMI vectors to mitigate unconditional distribution effects, thereby aiding analysis and prediction of input‑dependent behavior.

arXiv AI
Oct 15

Not All Drift Is a Mechanism: Tracing Prompt Adaptation in LLMs

The paper investigates how different prompt adaptation techniques—discrete prompt optimization, prompt tuning, and prefix tuning—affect the internal processing of dense and mixture-of-experts language models. It finds that the adaptation location determines how task information reaches the output: text prompts mainly influence response construction, input-level prompts modify content representations, and layer-wise prefixes exert direct control via attention. In MoE models, these differences also lead to distinct expert‑routing patterns, while generic representation‑level metrics fail to reliably distinguish effective adaptations from placebo effects.

By Mikhail Aleksandrov, Nail Bashirov, Maksim Ivanov, Andrew Tsukanov, Timofey Karyagin, Alexander Miasnikov, Gleb Molodtsov, Valentin Samokhin, Aleksandr Beznosikov
arXiv Machine Learning
Oct 15

From Copying to Composition: How Language Models Develop In-Context Learning

The study investigates how language models acquire in-context learning (ICL) by distinguishing between copying a nearby demonstration and integrating information across a prompt. Across 17 models, roughly one-third default to copied answers, a few are undecided, and the remainder favor rule-consistent answers that yield higher accuracy and are guided by the requested value rather than the nearest conflicting example. Analyses show that models prioritize task-relevant prompt tokens before accuracy surpasses chance, and that synthetic or fine-tuned training can shift models toward compositional responses or improve accuracy when prompts reassign label meanings.

By Minglai Yang, Xinyu Guo, Renxiong Wang, Sunjie Hou, Daniel Yue Zhang, Yunzhong He
arXiv AI
Oct 27

Budgeted Prompt-Set Expansion and Refinement for Language Models via Simulation Optimization

The paper proposes a two‑stage framework for expanding and refining a set of prompts for language models under a limited evaluation budget. In the first stage, it generates a finite candidate set of prompts represented by moderate‑dimensional vectors. The second stage builds a surrogate model of prompt scores and sequentially selects prompts for evaluation, proving consistency of this procedure and introducing a refinement step that searches beyond the initial candidates. Numerical experiments show the method outperforms baseline prompt selection, especially when evaluation calls are constrained.

By Haoting Zhang, Jinghai He, Rhonda Righter, Zeyu Zheng
arXiv AI
Sep 1

Mechanism Shift During Post-training from Autoregressive to Masked Diffusion Language Models

The study investigates how post‑training of large autoregressive language models (ARMs) into masked diffusion models (MDMs) affects their internal computation. Across two 7B ARM‑MDM families and four diagnostic tasks, the authors find that MDMs retain much of the ARM’s high‑attribution pathways on prefix‑dominant tasks, but reorganize computation toward earlier layers on globally constrained tasks. Component‑level probes reveal that ARMs depend on sharply specialized components, whereas MDMs show weaker specialization and more diffuse output‑space alignment.

By Injin Kong, Hyoungjoon Lee, Yohan Jo
arXiv Machine Learning
Sep 3

When Prompts Interact: Assessing Prompt Arithmetic for Deconfounding under Distribution Shift

The paper investigates how combining soft prompts via task arithmetic can reduce reliance on confounding variables in classification models. It introduces Hybrid Prompt Arithmetic (HyPA), which merges task prompts with linearized confounder prompts to counteract spurious correlations. Experiments across multiple benchmarks show that HyPA consistently improves the robustness‑performance trade‑off under distribution shift, and analysis of hidden representations suggests it mitigates confounding by diminishing the influence of confounder signals.

By Zhecheng Sheng, Yongsen Tan, Xiruo Ding, Trevor Cohen, Serguei Pakhomov