paper.dinq.meAI 与前沿科学顶会 · 学术新星雷达
登录 DINQ
返回新星榜
EM

Enze Ma

COLM 2026推理理论与学习动力学评测与基准
新星分贡献者
27
一作贡献0
核心/参与5
方向广度6
合作网络6
0 一作 · 1 篇 · COLM 2026

获取完整研究档案

首次获取该候选人的完整档案及 StartLux 评估共 20 积分;每位用户单独解锁,之后查看免费。主动刷新 20 积分。

联系方式

实时查找电子邮箱,费用不超过20积分;未找到邮箱不扣费。

2026 顶会论文

1
作者位次 #5/10COLM 2026Poster· Poster Session 3· Imperial Ballroom· #27

Locally Confident, Globally Stuck: The Quality-Exploration Dilemma in Diffusion Language Models

Liancheng Fang · Aiwei Liu · Henry Peng Zou · Yankai Chen · Enze Ma · Leyi Pan · Chunyu Miao · Wei-Chieh Huang · Xue Liu · Philip S. Yu

This paper studies the quality–exploration dilemma in diffusion language models and proposes an MCMC sampler to achieve a better tradeoff between generation quality and exploration across reasoning benchmarks.

摘要

Diffusion large language models (dLLMs) theoretically permit token decoding in arbitrary order, a flexibility that could enable richer exploration of reasoning paths than autoregressive (AR) LLMs. In practice, however, random-order decoding often hurts generation quality. To mitigate this, low-confidence remasking improves single-sample quality (e.g., Pass@$1$) by prioritizing confident tokens, but it also suppresses exploration and limits multi-sample gains (e.g., Pass@$k$), creating a fundamental quality--exploration dilemma. In this paper, we provide a unified explanation of this dilemma. We show that low-confidence remasking improves a myopic proxy for quality while provably constraining the entropy of the induced sequence distribution. To overcome this limitation, we characterize the optimal distribution that explicitly balances quality and exploration, and develop a simple Independent Metropolis--Hastings sampler that approximately targets this distribution during decoding. Experiments across a range of reasoning benchmarks, including MATH500, AIME24/25, HumanEval, and MBPP, show that our approach yields a better exploration-quality tradeoff than both random and low-confidence remasking.

推理理论与学习动力学评测与基准Diffusion language modelOpenReview

常见合作者