{
  "id": 827651,
  "title": "The data geometry of masking diffusion: Certified-optimal schedules via unmasking growth complexity",
  "url": "https://urgent.news/2026/08/13/the-data-geometry-of-masking-diffusion-certified-optimal-schedules",
  "topic": "ai",
  "section": "AI",
  "published": "2026-08-13T17:40:17.000Z",
  "source": {
    "name": "arXiv cs.AI",
    "slug": "arxiv-cs-ai",
    "url": "https://arxiv.org/abs/2608.13520v1"
  },
  "original_language": "en",
  "account": null,
  "summary": "We study masking diffusion for discrete sampling and introduce a path-resolved measure of data geometry called the \\emph{unmasking growth complexity} ({\\textsf{UGC}\\xspace}). Its local increments directly control Kullback--Leibler (KL) discretization error, yielding a unified analysis of Bernoulli-subset and fixed-cardinality unmasking schemes. In log-reveal-odds coordinates, this structure…",
  "key_points": [],
  "editors_take": null,
  "illustration": null,
  "coverage": {
    "outlets": 1,
    "also_reported_by": []
  },
  "ai_generated": true,
  "disclaimer": "Summaries, key points and the editor’s take are written by software from other outlets’ reporting and may contain errors — always check the linked original."
}