Decoding Large Language Diffusion Models with Foreseeing Movement
Yichuan Mo, Quan Chen, Mingjie Li, Zeming Wei, Yisen Wang

TL;DR
This paper introduces the Foreseeing Decoding Method (FDM) for Large Language Diffusion Models, which optimizes decoding order by considering long-term impacts, improving efficiency and performance over heuristic approaches.
Contribution
The paper proposes FDM, a novel search-based decoding strategy that integrates local and global token considerations, and introduces FDM-A for faster, more efficient decoding.
Findings
FDM outperforms heuristic methods in diverse benchmarks.
FDM-A achieves better efficiency-performance balance.
Extensive experiments validate scalability and effectiveness.
Abstract
Large Language Diffusion Models (LLDMs) benefit from a flexible decoding mechanism that enables parallelized inference and controllable generations over autoregressive models. Yet such flexibility introduces a critical challenge: inference performance becomes highly sensitive to the decoding order of tokens. Existing heuristic methods, however, focus mainly on local effects while overlooking long-term impacts. To address this limitation, we propose the Foreseeing Decoding Method (FDM), a novel approach that integrates both local and global considerations to unlock the full potential, employing a search-based strategy to enable effective optimization in discrete spaces. Furthermore, by analyzing the consistency of chosen tokens in the full decoding process, we develop a variant, FDM with Acceleration (FDM-A), which restricts deep exploration to critical steps identified as the…
Peer Reviews
Decision·Submitted to ICLR 2026
1. The paper clearly identifies a critical issue in LLDM decoding: sensitivity to token order and proposes a principled solution. 2. The accelerated variant (FDM-A) is well designed and shows impressive efficiency gains without sacrificing accuracy. 3. Extensive experiments across benchmarks (GSM8K, HumanEval, ARC, Countdown) validate both scalability and effectiveness.
1. The proposed method introduces several additional hyperparameters (e.g., $\eta$, $K$, $n$, $\gamma$), which may be difficult to tune in real-world applications. It would be helpful to discuss their sensitivity and provide guidelines or heuristics for practical tuning. 2. Equations (7) and (8) should be explained in more detail, particularly regarding their derivation and intuitive interpretation. 3. Since Equations (4), (7), and (8) involve approximations, it would strengthen the paper to inc
- This paper proposes a reasonable and interesting approach for improving the decoding ability of discrete diffusion models, by combining a search-based strategy that considers longer-term effects. - This paper further proposes an accelerated version that restricts exploration to critical steps, significantly saving computational cost. - FDM and FDM-A both show performance improvement on standard benchmarks, with FDM-A also demonstrating consistent speedups
- More proofreading is needed. There seem to be quite a few typos/mistakes in the writing, which caused a lot of confusion while reading. For example: - In Eq (1), I suppose the decomposition should be: $p(x\_0)\prod \_{t=1}^Tp(x\_t \| q, x\_{0:t-1})$. This also affects subsequent equations - The paper says in Section 4.1 that "we also incorporate a dynamic pruning strategy that retains only candidate tokens whose confidence exceeds the predefined threshold $\gamma$", but in Algorithm 1
The results seem reasonable, achieving a good accuracy and speed via a seemingly simple method.
The writing is confusing. See questions for typos. I believe the method is simple: consider the top-K tokens at each position that are unmasked with a high-enough probability under reverse model. Then rerank the tokens at each position using the product of the reverse model and $p(x_t|q)$. Please explain if this is incorrect. Additionally, I find the use of $p(x_t|q)$ to be unjustified. The paragraph before equation 7 does not motivate equation 7, and equation 7 is probably not a good approxima
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsTopic Modeling · Computational and Text Analysis Methods · Generative Adversarial Networks and Image Synthesis
