Adaptation to Intrinsic Dependence in Diffusion Language Models
Fuente:
arXiv
Saved in:
| Main Authors: | Zhao, Yunxiao, Cai, Changxiao |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Breaking AR's Sampling Bottleneck: Provable Acceleration via Diffusion Language Models
by: Li, Gen, et al.
Published: (2025)
by: Li, Gen, et al.
Published: (2025)
Minimax Optimality of the Probability Flow ODE for Diffusion Models
by: Cai, Changxiao, et al.
Published: (2025)
by: Cai, Changxiao, et al.
Published: (2025)
Diffusion Models Are Statistically Optimal for Learning Low-Dimensional Multi-Modal Distributions
by: Wu, Jingda, et al.
Published: (2026)
by: Wu, Jingda, et al.
Published: (2026)
Is Q-Learning Minimax Optimal? A Tight Sample Complexity Analysis
by: Li, Gen, et al.
Published: (2021)
by: Li, Gen, et al.
Published: (2021)
Confidence-Based Decoding is Provably Efficient for Diffusion Language Models
by: Cai, Changxiao, et al.
Published: (2026)
by: Cai, Changxiao, et al.
Published: (2026)
Dimension-Free Convergence of Diffusion Models for Approximate Gaussian Mixtures
by: Li, Gen, et al.
Published: (2025)
by: Li, Gen, et al.
Published: (2025)
Are First-Order Diffusion Samplers Really Slower? A Fast Forward-Value Approach
by: Jiao, Yuchen, et al.
Published: (2025)
by: Jiao, Yuchen, et al.
Published: (2025)
Transfer Learning for Contextual Multi-armed Bandits
by: Cai, Changxiao, et al.
Published: (2022)
by: Cai, Changxiao, et al.
Published: (2022)
Minimax-optimal trust-aware multi-armed bandits
by: Cai, Changxiao, et al.
Published: (2024)
by: Cai, Changxiao, et al.
Published: (2024)
Efficient Sampling with Discrete Diffusion Models: Sharp and Adaptive Guarantees
by: Dmitriev, Daniil, et al.
Published: (2026)
by: Dmitriev, Daniil, et al.
Published: (2026)
Towards Faster Non-Asymptotic Convergence for Diffusion-Based Generative Models
by: Li, Gen, et al.
Published: (2023)
by: Li, Gen, et al.
Published: (2023)
Minimax Optimality of Score-based Diffusion Models: Beyond the Density Lower Bound Assumptions
by: Zhang, Kaihong, et al.
Published: (2024)
by: Zhang, Kaihong, et al.
Published: (2024)
On the Nonasymptotic Scaling Guarantee of Hyperparameter Estimation in Inhomogeneous, Weakly-Dependent Complex Network Dynamical Systems
by: Yu, Yi, et al.
Published: (2026)
by: Yu, Yi, et al.
Published: (2026)
Characterizing Dependence of Samples along the Langevin Dynamics and Algorithms via Contraction of $Φ$-Mutual Information
by: Liang, Jiaming, et al.
Published: (2024)
by: Liang, Jiaming, et al.
Published: (2024)
Federated PCA and Estimation for Spiked Covariance Matrices: Optimal Rates and Efficient Algorithm
by: Li, Jingyang, et al.
Published: (2024)
by: Li, Jingyang, et al.
Published: (2024)
Variational Optimality of Föllmer Processes in Generative Diffusions
by: Chen, Yifan, et al.
Published: (2026)
by: Chen, Yifan, et al.
Published: (2026)
Optimal Differentially Private PCA and Estimation for Spiked Covariance Matrices
by: Cai, T. Tony, et al.
Published: (2024)
by: Cai, T. Tony, et al.
Published: (2024)
Minimax Hypothesis Testing for the Bradley-Terry-Luce Model
by: Makur, Anuran, et al.
Published: (2024)
by: Makur, Anuran, et al.
Published: (2024)
Precise Asymptotics for Spectral Methods in Mixed Generalized Linear Models
by: Zhang, Yihan, et al.
Published: (2022)
by: Zhang, Yihan, et al.
Published: (2022)
Foundation of Calculating Normalized Maximum Likelihood for Continuous Probability Models
by: Suzuki, Atsushi, et al.
Published: (2024)
by: Suzuki, Atsushi, et al.
Published: (2024)
The Curious Price of Distributional Robustness in Reinforcement Learning with a Generative Model
by: Shi, Laixi, et al.
Published: (2023)
by: Shi, Laixi, et al.
Published: (2023)
Orthogonal Approximate Message Passing with Optimal Spectral Initializations for Rectangular Spiked Matrix Models
by: Chen, Haohua, et al.
Published: (2025)
by: Chen, Haohua, et al.
Published: (2025)
Orthogonal Approximate Message Passing Algorithms for Rectangular Spiked Matrix Models with Rotationally Invariant Noise
by: Chen, Haohua, et al.
Published: (2026)
by: Chen, Haohua, et al.
Published: (2026)
Information-Geometric Decomposition of Generalization Error in Unsupervised Learning
by: Kim, Gilhan
Published: (2026)
by: Kim, Gilhan
Published: (2026)
Unifying AMP Algorithms for Rotationally-Invariant Models
by: Liu, Songbin, et al.
Published: (2024)
by: Liu, Songbin, et al.
Published: (2024)
Sample efficient inductive matrix completion with noise and inexact side information
by: Yang, Yuepeng, et al.
Published: (2026)
by: Yang, Yuepeng, et al.
Published: (2026)
Decoupled Descent: Exact Test Error Tracking Via Approximate Message Passing
by: Lovig, Max
Published: (2026)
by: Lovig, Max
Published: (2026)
Order-Optimal Sequential 1-Bit Mean Estimation in General Tail Regimes
by: Lau, Ivan, et al.
Published: (2026)
by: Lau, Ivan, et al.
Published: (2026)
Breaking the Finite-Sample Barrier in Entropy Coupling
by: Asoodeh, Shahab, et al.
Published: (2026)
by: Asoodeh, Shahab, et al.
Published: (2026)
Minimax optimal differentially private synthetic data for smooth queries
by: Ding, Rundong, et al.
Published: (2026)
by: Ding, Rundong, et al.
Published: (2026)
Accurate Evaluation of Quickest Changepoint Detectors via Non-parametric Survival Analysis
by: Miyagawa, Taiki, et al.
Published: (2026)
by: Miyagawa, Taiki, et al.
Published: (2026)
Minimax optimal submatrix detection: Sharp non-asymptotic rates
by: Knight, Parker, et al.
Published: (2026)
by: Knight, Parker, et al.
Published: (2026)
Optimal training-conditional regret for online conformal prediction
by: Liang, Jiadong, et al.
Published: (2026)
by: Liang, Jiadong, et al.
Published: (2026)
Thompson sampling: Precise arm-pull dynamics and adaptive inference
by: Han, Qiyang
Published: (2026)
by: Han, Qiyang
Published: (2026)
Instance-Optimal Estimation with Multiple LLM Judges on a Budget
by: Lee, Junghyun, et al.
Published: (2026)
by: Lee, Junghyun, et al.
Published: (2026)
On Observation Time for Recovering Latent Hawkes Networks
by: Linkerhägner, Jonas, et al.
Published: (2026)
by: Linkerhägner, Jonas, et al.
Published: (2026)
Price of Quality: Sufficient Conditions for Sparse Recovery using Mixed-Quality Data
by: Chaabouni, Youssef, et al.
Published: (2026)
by: Chaabouni, Youssef, et al.
Published: (2026)
On the Sample Complexity of Robust Binary Hypothesis Testing
by: Vallinayagam, Shankar, et al.
Published: (2026)
by: Vallinayagam, Shankar, et al.
Published: (2026)
Fine-Grained Uncertainty Quantification via Collisions
by: Friedbaum, Jesse, et al.
Published: (2024)
by: Friedbaum, Jesse, et al.
Published: (2024)
Statistical-Computational Trade-offs in Tensor PCA and Related Problems via Communication Complexity
by: Dudeja, Rishabh, et al.
Published: (2022)
by: Dudeja, Rishabh, et al.
Published: (2022)
Similar Items
-
Breaking AR's Sampling Bottleneck: Provable Acceleration via Diffusion Language Models
by: Li, Gen, et al.
Published: (2025) -
Minimax Optimality of the Probability Flow ODE for Diffusion Models
by: Cai, Changxiao, et al.
Published: (2025) -
Diffusion Models Are Statistically Optimal for Learning Low-Dimensional Multi-Modal Distributions
by: Wu, Jingda, et al.
Published: (2026) -
Is Q-Learning Minimax Optimal? A Tight Sample Complexity Analysis
by: Li, Gen, et al.
Published: (2021) -
Confidence-Based Decoding is Provably Efficient for Diffusion Language Models
by: Cai, Changxiao, et al.
Published: (2026)