arXiv (All)
open access
Constraints Are Graphs, Not Chains: Exact Decoding for Diffusion Language Models
Diffusion language models (dLLMs) predict masked positions in arbitrary order, but their exact constrained decoders still encode constraints as sequential languages, whose state must track every unresolved dependency between positions. For relational constraints this encoding grows exponentially: fo
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Neural Language Models’ sensitivity to long-distance dependencies and their island constraints is not universal: a comparison between English and Dutch humans and models#331597
- Block Parallelism For Efficient Distributed Long-Context Diffusion Language Model Training#1013840
- Continuous Latent Diffusion Language Model#168355
- RiLM: Parameter-Efficient Language Modeling via Geodesic Decoding#997198
- The Canonical Order Problem: When Large Language Models Are Unreliable Knowledge Bases for Multi-Valued Relations#1131051
Record · ID 1117612
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive