PreprintLicence not statedarXiv (Cornell University)
The data geometry of masking diffusion: Certified-optimal schedules via unmasking growth complexity
- 1Lab for Information and Decision Systems Statistics and Data Science Center EECS and Mathematics , Massachusetts Institute of Technology
Related
- The information geometry of product-reference discrete diffusion: Interaction growth complexity and optimal scheduling
- Serial Depth of Adaptive Parallel Sampling: Lower Bounds and Schedules for Masked Diffusion Models
- Certified Inference and Training for Deep Equilibrium Networks: A Continuation Framework with Polynomial Complexity Guarantees
- Pay Only for Disagreement: Certified No-Regression Verdicts for Model Updates with Matching Label-Complexity Bounds
- Algorithmic Information Dynamics of Learning: A Certified, Differentiable Complexity Controller for Grokking
BibTeX
@misc{wainwright2026data,
title = {{The data geometry of masking diffusion: Certified-optimal schedules via unmasking growth complexity}},
author = {Martin J. Wainwright},
howpublished = {arXiv (Cornell University)},
year = {2026},
month = aug,
doi = {10.48550/arxiv.2608.13520},
url = {https://arxiv.org/abs/2608.13520},
}
RIS
TY - UNPB
TI - The data geometry of masking diffusion: Certified-optimal schedules via unmasking growth complexity
AU - Martin J. Wainwright
PY - 2026
DA - 2026/08/13
PB - arXiv (Cornell University)
DO - 10.48550/arxiv.2608.13520
UR - https://arxiv.org/abs/2608.13520
SN - 2331-8422
ER -