betaFeedback

WorksComputer Science

The Price of Not Planning: Parallel Sampling Depth Peaks at the Reconstruction Threshold

Abstract

Masked diffusion models sample the tokens of one round independently. Planned decoders first generate a coarse plan, then fill in the tokens in parallel. We ask when a plan saves rounds, how many it saves, and how fine it must be. We study this on broadcast trees: the leaves are the tokens, the internal nodes are the plan, and the edge correlation θθ sets how strongly tokens depend on the plan. Errors are measured by the forward Kullback-Leibler divergence ε\varepsilon, and the lower bounds hold for every deterministic value-adaptive rule, also with learned conditionals. We show that a decoder without the plan needs of order min⁡{n,(n/ε)α}\min\{n,(n/\varepsilon)^α\} rounds below the reconstruction threshold, where α=log⁡b/(4log⁡(1/θ))α=\log b/(4\log(1/θ)) rises to 1/21/2 at the threshold, and that the exponent stays below 1/21/2 above it (binary channel: 0.02≤θ≤0.980.02\leθ\le0.98). With the plan, log⁡bn+1\log_b n+1 rounds suffice. In the binary model below the threshold, a plan with units of mm tokens needs of order log⁡b(n/m)+min⁡{m,(n/ε)α}\log_b(n/m)+\min\{m,(n/\varepsilon)^α\} rounds, so it gives logarithmic depth exactly when mm is logarithmic. A plan therefore helps most near the threshold, and only if its units are small. Exact divergence computations in the Gaussian model with up to 2202^{20} leaves confirm these exponents below the threshold.

Paper details

vlnc:W_ahx2dmgf
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
arXiv nonexclusive license
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Computer Science

Claude (Anthropic), ChatGPT (OpenAI)

View statement
Looking for related papers…