paper-with-me

홈 › Papers

D-Models and E-Models: Diversity-Stability Trade-offs in the Sampling Behavior of Large Language Models

2026-01-25 · Jia Gu, Liang Pang, Huawei Shen, Xueqi Cheng arxiv

The predictive probability of the next token (P_token) in large language models (LLMs) is inextricably linked to the probability of relevance for the next piece of information, the purchase probability of the next product, and the execution probability of the next action-all of which fall under the scope of the task-level target distribution (P_task). While LLMs are known to generate samples that approximate real-world distributions, whether their fine-grained sampling probabilities faithfully align with task requirements remains an open question. Through controlled distribution-sampling simulations, we uncover a striking dichotomy in LLM behavior, distinguishing two model types: D-models (e.g. Qwen-2.5), whose P_token exhibits large step-to-step variability and poor alignment with P_task; and E-models (e.g. Mistral-Small), whose P_token is more stable and better aligned with P_task. We further evaluate these two model types in downstream tasks such as code generation and recommendation, revealing systematic trade-offs between diversity and stability that shape task outcomes. Finally, we analyze the internal properties of both model families to probe their underlying mechanisms. These findings offer foundational insights into the probabilistic sampling behavior of LLMs and provide practical guidance on when to favor D- versus E-models. For web-scale applications, including recommendation, search, and conversational agents, our results inform model selection and configuration to balance diversity with reliability under real-world uncertainty, providing a better level of interpretation.

📄 PDF Abstract BibTeX arXiv:2601.17865

Code (0)

등록된 구현이 없습니다.

Tasks

Code Generation

Similar Papers 제목 키워드 기반

Misclassification Rate and Privacy-Utility Trade-offs in Graph Convolutional Networks via Subsampling Stability

2026-05-03 · Yexin Zhang, Zhongtian Ma, Qiaosheng Zhang, Zhen Wang arxiv

We study differential privacy (DP) in Graph Convolutional Networks (GCNs) through the framework of \textit{subsampling stability}. We derive upper bounds on the misclassification rate that depend explicitly on the subsam…

Dynamic Stability of LLM-Generated Code

2025-11-07 · Prateek Rajput, Abdoul Aziz Bonkoungou, Yewei Song, Abdoul Kader Kabore 외 arxiv

Current evaluations of LLMs for code generation emphasize functional correctness, overlooking the fact that functionally correct solutions can differ significantly in algorithmic complexity. For instance, an $(O(n^2))$ v…

Code Generation

Balancing Fidelity and Diversity in Diffusion Models via Symmetric Attention Decomposition: Hopfield Perspective

2026-05-26 · Hyunmin Cho, Woo Kyoung Han, Kyong Hwan Jin arxiv

We characterize the pre-softmax attention matrix $\mathbf{QK^\top}$ in transformers as an associative memory matrix encoding pairwise associations between input features. By decomposing this matrix into its symmetric and…

Exploring and Controlling Diversity in LLM-Agent Conversation

2024-12-30 · KuanChao Chu, Yi-Pei Chen, Hideki Nakayama

Diversity is a critical aspect of multi-agent communication. In this paper, we focus on controlling and exploring diversity in the context of open-domain multi-agent conversations, particularly for world simulation appli…

Diversity

Q-Learning for Continuous Actions with Cross-Entropy Guided Policies

2019-03-25 · Riley Simmons-Edler, Ben Eisner, Eric Mitchell, Sebastian Seung 외

Off-Policy reinforcement learning (RL) is an important class of methods for many problem domains, such as robotics, where the cost of collecting data is high and on-policy methods are consequently intractable. Standard m…

Q-LearningReinforcement LearningReinforcement Learning (RL)