arXiv CS
open access
Query-Efficient Rejection Sampling for Parallel Masked Diffusion
Masked diffusion models (MDMs) accelerate generation by unmasking multiple tokens in parallel, but sampling these tokens independently ignores their correlations and biases the output. Anari et al. (2026) corrected this bias with rejection sampling, decomposing the log acceptance probability into a
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
- Query-Efficient Rejection Sampling for Parallel Masked Diffusion#1357893
- When Are Concepts Erased From Diffusion Models?#1187231
- UltraDiff: Transferring High-Fidelity Priors to Compressed Latent Spaces for High-Resolution Image Generation#1356538
- Follow the Latent Roadmap: Navigating Revocable Decoding for Diffusion LLMs with Anchor Tokens#924097
- Follow the Latent Roadmap: Navigating Revocable Decoding for Diffusion LLMs with Anchor Tokens#919868
Record · ID 1348850
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