- Rating
- 3
- Confidence
- 3
- Informativeness
- 3
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
The paper puts autoregressive, diffusion, and intermediate decoding schedules into a common framework: a schedule is a monotone path on a lattice of coordinate-wise corruption levels. A parallel transition is assigned a dependence cost given by the conditional total correlation lost when the exact joint transition is replaced by a product of coordinate conditionals. Under exact transitions, the sum of these costs is exactly the path-space KL divergence between joint and factorized sampling. For graph-Markov data, the paper further relates the minimum number of zero-cost steps to graph treedepth.
Since the exact cost is generally unavailable, the practical method estimates a pairwise dependence kernel from pretrained model weights and uses it to compare or construct schedules. The empirical section covers text8, MAR-B on ImageNet-256, LLaDA-8B, and Diffusion Forcing for video. Across these settings, spatially or sequentially separated updates are usually better than clustered updates at small step budgets, although the estimated cost does not always predict the ordering among the stronger schedules.
Critical strengths
-
The main theoretical picture is clean and useful. In particular, the KL/total-correlation identity makes precise what is lost by parallelizing a transition, and the treedepth result gives a nontrivial structural answer to when zero-cost parallel schedules exist. I found this connection more illuminating than treating each decoding family separately.
-
Several experiments are unusually well controlled for a scheduling paper. For example, the MAR-B weights and step budget are fixed while only the reveal order changes; at eight steps, the spread schedule improves FID from 13.02 to 9.44 relative to the model's random order. The LLaDA experiments show similarly large gains from simple separation constraints. The appendix is also candid about cases where the proxy does not predict the final ordering.
Critical weaknesses
-
The practical pairwise score is a lower bound on total correlation, not a generally order-preserving estimator of it. Exactness is obtained for a first-order Markov reference, while the evaluated models can contain substantial higher-order dependence. This matters in the reported results: nested is predicted below random for MAR but has worse FID, and low-discrepancy sampling beats spread despite the predicted order. I therefore view the pairwise construction as a useful heuristic, but the current text sometimes gives it a stronger predictive interpretation than the evidence supports.
-
I am less convinced by the transfer of the exact-transition theory to the finite-step continuous implementations. Proposition 1 concerns exact joint reverse kernels and their exact coordinate marginals, whereas the image and video experiments use conditional-mean or deterministic updates with model and discretization error. Those errors can themselves depend on the schedule. The paper discusses this qualitatively but does not show when the dependence-cost ordering should survive.
Questions for authors
-
Can the authors give an error decomposition for the finite-step continuous updates relative to the exact-transition path in Proposition 1? In particular, under what conditions would model and discretization errors preserve the schedule ordering?
-
Is there a checkable diagnostic for when the pairwise approximation is unreliable, or a practical higher-order correction? It would be helpful to use the MAR reversals as concrete test cases.
-
Which schedule rankings were specified before decoding results were observed? A single table of predicted versus observed rankings, with rank correlation across all schedule-budget pairs, would make the empirical claim much easier to assess.
3 comments
I thank the authors for their detailed response, which addresses some of my concerns. However, the ranking reversals observed on MAR and the reversal on LLaDA at 64 steps leave me only partially convinced that the method remains reliable when compared against stronger schedules. I will therefore maintain my current score.
Thank you for the follow up. It is true that our estimate cannot always rank the strongest schedules correctly, but these reversals only cause a small loss. On MAR-B, the rule that we predict as the best is within 0.15 FID of the measured best one from 16 steps. On LLaDA at 64 steps, the estimates of the rules only differ by 0.02 bits, so they are too close to rank. Thus, we can see that the estimate is reliable when the schedules clearly differ in their cost, and this is also where the choice of schedule matters most.
Thank you for the careful reading and for your positive assessment. In the following, the numbers refer to the revised version.
W1: The pairwise estimate is a lower bound on the total correlation, and it equals the total correlation only when the selected tokens have first-order Markov dependence. With higher-order dependence it does not have to preserve the order, so we use it as a heuristic to rank schedules. We now state this in Section 5, where the estimate is introduced. How well it ranks is an empirical question, which we answer in Q3 below.
W2 and Q1: Yes, there is an exact decomposition. A step that samples each coordinate from its own model conditional q_i is a product law, and for any product law KL(p ‖ ∏ q_i) = TC(p) + Σ_i KL(p_i ‖ q_i), where p_i is the exact coordinate conditional. This is the decomposition of Ben-Hamu et al. (2025, eq. 7) for masked models, and it holds on every path and channel. Summed along the path, a decode departs from the exact path by the dependence cost of Proposition 1 plus the error of the model's coordinate conditionals. For a Gaussian update, the second term includes the discretisation error. The ordering by dependence cost is preserved when the second term varies less across schedules than the first. On the absorbing lattice every schedule commits each coordinate once, and MAR's diffusion head samples with the same settings under every order, so the second term differs between schedules only through the states at which coordinates are committed. We measure both terms on text8 in Section 6.3: the dependence term is several times larger when steps are wide, and the conditional term determines the ranking when they are narrow. We now state this decomposition in Section 3.
Q2: Yes, we give a diagnostic in Table 15, where we add the triplet term of Lemma 2's proof to the pairwise estimate. Where the triplet term is large relative to the pairwise one, as for contiguous selection (0.62 to 0.90 bits at 8 steps), the pairwise ranking is least reliable. For spread and the separator rule it changes the estimate by at most 0.01 at 8 and 32 steps. We also give a second correction for the rules that rely on separation: with the kernel measured after a reveal between the pair, the estimate accounts for most of the midpoint rule's excess on text8 (Table 17). We give both on text8. On MAR the head gives a law only through samples, so a triplet term built from its proxy kernels would not separate a higher-order effect from the error of the proxy.
Q3: We compute every ranking in the paper from the kernel and the schedule alone, with no decoded sample, except the two that we mark in the captions: spread-then-raster's floor (Table 2) and the confidence rule's estimate (Table 15). The new Table 29 (Appendix C.12) lists predicted against measured rankings for every schedule and budget, with rank correlations: Spearman 0.98 pooled on text8, and 0.71 from 8 to 32 steps on MAR-B.
If these address your concerns, we would be grateful if you could raise your score.