Skip to content
AI News HubLIVE
Original source2 min read

TraceQuery: learning what to recompute from full-denoising trajectory in diffusion language models

Summary

This paper proposes TraceQuery, a lightweight sparse decoding framework for diffusion large language models. Trajectory experiments show that cached generation stays accurate when it remains close to the full-denoising trajectory, with errors concentrated around unmask-order deviations. TraceQuery uses full-denoising trajectories to supervise which unresolved positions receive limited fresh computation, predicting a small set of near-future trajectory-relevant positions and letting the backbone select which token to commit, achieving the strongest quality-computation trade-off among cache-based approaches.

SourcearXiv Computational LinguisticsAuthor: Yukai Jin, Zhankai Ye, Jiayue Yang, Fangyi Li, Shuoqiu Li, Xu Gao, Shibo Li, Xin Liu, Shangqian Gao
TraceQuery: learning what to recompute from full-denoising trajectory in diffusion language models
Report an error

The correction channel is not available yet. You can copy the article reference below for later.

Correction instructions
Read article

[Submitted on 7 Oct 2026]

Title:TraceQuery: learning what to recompute from full-denoising trajectory in diffusion language models

View a PDF of the paper titled TraceQuery: learning what to recompute from full-denoising trajectory in diffusion language models, by Yukai Jin and Zhankai Ye and Jiayue Yang and Fangyi Li and Shuoqiu Li and Xu Gao and Shibo Li and Xin Liu and Shangqian Gao

View PDF HTML (experimental)

Abstract:Diffusion large language models (dLLMs) enable flexible generation through iterative masked denoising, but incur substantial inference cost because token representations are repeatedly recomputed across denoising steps. Existing cache-based methods reduce this cost by reusing intermediate results across denoising steps and recomputing only a subset of positions at each step, chosen either on a fixed schedule or by heuristic signals of change. Our trajectory experiments instead point to decoding trajectory as the more relevant quantity. Cached generation remains accurate when it stays close to the full-denoising trajectory, with errors concentrated around unmask-order deviations and reduced as longer reference prefixes are recovered. This suggests a more direct principle: limiting representation error helps, but keeping generation on the full-denoising trajectory is a more direct route to accurate decoding. We therefore formulate efficient dLLM inference as trajectory-guided querying. Rather than broadly repairing representation error, we use full-denoising trajectories to supervise which unresolved positions should receive limited fresh computation. Based on this formulation, we introduce TRACEQUERY, a lightweight sparse decoding framework that predicts a small set of near-future trajectory-relevant positions, queries only those candidates, and lets the backbone select which one to commit from their fresh predictions. TRACEQUERY delivers the strongest quality-computation trade-off among cache-based approaches, sustaining high accuracy with substantially fewer fresh token computations, and generalizes across tasks, model variants, and families. Code: this https URL

Comments: 9 pages of main body, 5 pages of appendix, 4 figures, 1 table

Subjects:

Computation and Language (cs.CL); Artificial Intelligence (cs.AI)

Cite as: arXiv:2610.33008 [cs.CL]

(or arXiv:2610.33008v1 [cs.CL] for this version)

https://doi.org/10.48550/arXiv.2610.33008

arXiv-issued DOI via DataCite

Submission history

From: Yukai Jin [view email] [v1] Wed, 7 Oct 2026 18:20:13 UTC (1,671 KB)

Full-text links:

Access Paper:

View a PDF of the paper titled TraceQuery: learning what to recompute from full-denoising trajectory in diffusion language models, by Yukai Jin and Zhankai Ye and Jiayue Yang and Fangyi Li and Shuoqiu Li and Xu Gao and Shibo Li and Xin Liu and Shangqian Gao

View PDF

HTML (experimental)

TeX Source

view license

Additional Features

Audio Summary

Current browse context:

cs.CL

new | recent | 2026-10

Change to browse by:

cs cs.AI

References & Citations

SciX

Google Scholar

Semantic Scholar

Loading...

Data provided by:

Bibliographic Tools

Bibliographic and Citation Tools

Bibliographic Explorer Toggle

Bibliographic Explorer (What is the Explorer?)

Connected Papers Toggle

Connected Papers (What is Connected Papers?)

Litmaps Toggle

Litmaps (What is Litmaps?)

scite.ai Toggle

scite Smart Citations (What are Smart Citations?)

Code, Data, Media

Code, Data and Media Associated with this Article

alphaXiv Toggle

alphaXiv (What is alphaXiv?)

Links to Code Toggle

CatalyzeX Code Finder for Papers (What is CatalyzeX?)

DagsHub Toggle

DagsHub (What is DagsHub?)

GotitPub Toggle

Gotit.pub (What is GotitPub?)

Huggingface Toggle

Hugging Face (What is Huggingface?)

ScienceCast Toggle

ScienceCast (What is ScienceCast?)

Demos

Demos

Replicate Toggle

Replicate (What is Replicate?)

Spaces Toggle

Hugging Face Spaces (What is Spaces?)

Spaces Toggle

TXYZ.AI (What is TXYZ.AI?)

Related Papers

Recommenders and Search Tools

Link to Influence Flower

Influence Flower (What are Influence Flowers?)

Core recommender toggle

CORE Recommender (What is CORE?)

Author

Venue

Institution

Topic

About arXivLabs

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)

Key points and analysis

Article intelligence

EngineersAdvanced

Key points

  • Cached dLLM generation stays accurate when it follows the full-denoising trajectory, with errors centered on unmask-order deviations
  • TraceQuery predicts a small set of near-future trajectory-relevant positions, queries only those candidates, and lets the backbone select which to commit
  • It delivers the best quality-computation trade-off among cache-based methods and generalizes across tasks, model variants, and families

Highlights and analysis are generated automatically and may contain errors. Check the original source.