{"total":17,"rows":[{"id":"2603.22248","title":"Confidence-Based Decoding is Provably Efficient for Diffusion Language Models","created":"2026-03-23","cited_by_count":18,"area":"diffusion"},{"id":"2602.20126","title":"Adaptation to Intrinsic Dependence in Diffusion Language Models","created":"2026-02-23","cited_by_count":10,"area":"diffusion"},{"id":"2602.22505","title":"Sharp Convergence Rates for Masked Diffusion Models","created":"2026-02-26","cited_by_count":9,"area":"diffusion"},{"id":"2607.00773","title":"Accelerating Discrete Diffusion Models with Parallel-In-Time Sampling","created":"2026-07-01","cited_by_count":4,"area":"diffusion"},{"id":"2608.23554","title":"Provably adaptive sampling with uniform and remasking discrete diffusion models","created":"2026-08-24","cited_by_count":4,"area":"diffusion"},{"id":"2605.17232","title":"Vocabulary-size-independent Convergence of Discrete Diffusion Models: adjoint equations induce the right space","created":"2026-05-17","cited_by_count":3,"area":"diffusion"},{"id":"2605.30153","title":"Diffusion Models Are Statistically Optimal for Learning Low-Dimensional Multi-Modal Distributions","created":"2026-05-28","cited_by_count":3,"area":"diffusion"},{"id":"2608.20635","title":"Minimax Optimality of Score-Entropy Discrete Diffusion","created":"2026-08-21","cited_by_count":3,"area":"diffusion"},{"id":"2608.23551","title":"ConvergeFlow: Language Flow with Provable Convergence to Token Embeddings","created":"2026-08-24","cited_by_count":2,"area":"diffusion"},{"id":"2608.28949","title":"The information geometry of product-reference discrete diffusion: Interaction growth complexity and optimal scheduling","created":"2026-08-28","cited_by_count":2,"area":"diffusion"},{"id":"2605.08882","title":"Discrete Flow Matching: Convergence Guarantees Under Minimal Assumptions","created":"2026-05-09","cited_by_count":1,"area":"diffusion"},{"id":"2605.27352","title":"From Scores to Gibbs Correctors: Accelerating Uniform-Rate Discrete Diffusion Models","created":"2026-05-26","cited_by_count":1,"area":"diffusion"},{"id":"2606.23627","title":"Diffusion Models Adapt to Low-Dimensional Structure Under Flexible Coefficient Choices","created":"2026-06-22","cited_by_count":1,"area":"diffusion"},{"id":"2607.27529","title":"Latent-Kernel Discrete Flow Maps for Few-Step Generation","created":"2026-07-29","cited_by_count":1,"area":"diffusion"},{"id":"2609.20539","title":"Parallelism, critical windows, and separations among diffusion language models","created":"2026-09-17","cited_by_count":1,"area":"diffusion"},{"id":"2609.21960","title":"Schedule optimization for tau-leaping in masked discrete diffusion","created":"2026-09-18","cited_by_count":0,"area":"diffusion"},{"id":"2610.02128","title":"Sample complexity bounds for categorical Markov random fields via Discrete Diffusions","created":"2026-10-01","cited_by_count":0,"area":"diffusion"}],"next_cursor":null}