paper-with-me

Papers

Beyond Fixed: Training-Free Variable-Length Denoising for Diffusion Large Language Models

2025-08-01 · Jinsong Li, Xiaoyi Dong, Yuhang Zang, Yuhang Cao, Jiaqi Wang, Dahua Lin arxiv

Diffusion Large Language Models (DLLMs) are emerging as a powerful alternative to the dominant Autoregressive Large Language Models, offering efficient parallel generation and capable global context modeling. However, the practical application of DLLMs is hindered by a critical architectural constraint: the need for a statically predefined generation length. This static length allocation leads to a problematic trade-off: insufficient lengths cripple performance on complex tasks, while excessive lengths incur significant computational overhead and sometimes result in performance degradation. While the inference framework is rigid, we observe that the model itself possesses internal signals that correlate with the optimal response length for a given task. To bridge this gap, we leverage these latent signals and introduce DAEDAL, a novel training-free denoising strategy that enables Dynamic Adaptive Length Expansion for Diffusion Large Language Models. DAEDAL operates in two phases: 1) Before the denoising process, DAEDAL starts from a short initial length and iteratively expands it to a coarse task-appropriate length, guided by a sequence completion metric. 2) During the denoising process, DAEDAL dynamically intervenes by pinpointing and expanding insufficient generation regions through mask token insertion, ensuring the final output is fully developed. Extensive experiments on DLLMs demonstrate that DAEDAL achieves performance comparable, and in some cases superior, to meticulously tuned fixed-length baselines, while simultaneously enhancing computational efficiency by achieving a higher effective token ratio. By resolving the static length constraint, DAEDAL unlocks new potential for DLLMs, bridging a critical gap with their Autoregressive counterparts and paving the way for more efficient and capable generation.

📄 PDF Abstract BibTeX arXiv:2508.00819

Code (0)

등록된 구현이 없습니다.

Tasks

Computational Efficiency

Similar Papers 제목 키워드 기반

$ρ$-$\texttt{EOS}$: Training-free Bidirectional Variable-Length Control for Masked Diffusion LLMs

2026-01-30 · Jingyi Yang, Yuxian Jiang, Jing Shao arxiv

Beyond parallel generation and global context modeling, current masked diffusion large language models (masked dLLMs, i.e., LLaDA) suffer from a fundamental limitation: they require a predefined, fixed generation length,…

Computational Efficiency

DreamOn: Diffusion Language Models For Code Infilling Beyond Fixed-size Canvas

2026-02-01 · Zirui Wu, Lin Zheng, Zhihui Xie, Jiacheng Ye 외 arxiv

Diffusion Language Models (DLMs) present a compelling alternative to autoregressive models, offering flexible, any-order infilling without specialized prompting design. However, their practical utility is blocked by a cr…

Beyond Masks: Efficient, Flexible Diffusion Language Models via Deletion-Insertion Processes

2026-03-04 · Fangyu Ding, Ding Ding, Sijin Chen, Kaibo Wang 외 arxiv

While Masked Diffusion Language Models (MDLMs) relying on token masking and unmasking have shown promise in language modeling, their computational efficiency and generation flexibility remain constrained by the masking p…

Computational Efficiency

Sequence to Sequence Learning for Optical Character Recognition

2015-11-13 · Devendra Kumar Sahu, Mohak Sukhwani

We propose an end-to-end recurrent encoder-decoder based sequence learning approach for printed text Optical Character Recognition (OCR). In contrast to present day existing state-of-art OCR solution which uses connectio…

DecoderGeneral ClassificationOptical Character RecognitionOptical Character Recognition (OCR)+1

FlexLAM: Resolving the Bottleneck Trade-off in Latent Action Learning

2026-06-17 · Takanori Yoshimoto, Yang Hu, Naruya Kondo, Tatsuya Matsushima arxiv

Latent actions provide a compact interface between action-free video and downstream decision-making, yet existing Latent Action Models (LAMs) force every transition through a fixed-capacity bottleneck. We identify a bott…