- Rating
- 1
- Confidence
- 3
- Informativeness
- 1
- Presentation
- 1
- Soundness
- 2
Read review
Paper summary
-
DiffSched is an inference-time controller that plans the prompt into regions before sampling and, during sampling, uses a cheap residual to decide how much regional computation and how many VLM reviews each semantic group receives.
-
The claimed contribution is this joint, cost-gated scheduling, and it comes with a conditional optimality argument.
-
The validation runs on small benchmark subsets against heuristic, static and agentic baselines and reports large denoiser savings at higher GenEval 2 scores.
-
The design, the ablation protocol and the code release are all in good order.
-
However, the evidence does not yet carry the claims.
Critical strengths
A clear, well-motivated decomposition that is new relative to the closest prior work.
-
The two separations the method is built on, cheap signal from expensive observation and allocation bounded by the next checkpoint, are sensible design choices.
-
Gating the cost of its own feedback, jointly per group and per interval, is what none of the positioned prior works does.
Careful claim scoping and controlled, paired internal comparisons, with code released.
-
The paper is explicit about what its residual, its cost metric and its theory do not claim.
-
The internal comparisons are paired on everything but the component under test, and costs are reported at several levels.
Critical weaknesses
The headline claims outrun the evidence: one benchmark does not show the stated gain, the other is a small single-seed subset without variance.
-
On T2I-CompBench++ the tables show the heuristic baselines matching or beating DiffSched, not the improvement the abstract claims. Specifically, the abstract claims improved compositional scores on both benchmarks. Yet in Tables 1 and 5 Visual-Complexity beats DiffSched on T2I-CompBench++.
-
On GenEval 2 the margins are small, single-seed, single-subset, and carry no uncertainty estimate. Specifically, on GenEval 2 the margins over the heuristics are +1.42–1.55 GM and +0.48–1.28 AM. They come from one 100-prompt subset and seed 42. There is no confidence interval or paired test, so their stability across prompts and seeds is unknown.
End-to-end efficiency is not established against the baselines the 42–56% figure targets, and Fig. 4a does not match Table 1.
-
The saving is measured in denoiser evaluations against two heuristics whose end-to-end cost is never reported, so no wall-clock advantage over them is shown. Specifically, the 42–56% saving in denoiser evaluations is measured against Region-Size and Visual-Complexity. Table 2 reports end-to-end time for DiffSched and three external methods only. Those heuristics, Static-Semantic-Schedule, the backbone and MCCD have none. So no wall-clock advantage over the direct baselines is shown.
-
The Pareto figure misplaces the two heuristics and silently omits a method that would sit on the frontier. Specifically, Fig. 4a draws Region-Size and Visual-Complexity far left of their Table 1 NFE. It omits BiDPO (20.00 NFE, 56.70 AM) without saying which rows its frontier covers.
The anonymous repository carries local paths that may identify the authors.
Specifically, the given link of https://anonymous.4open.science/r/DIFFSCHED-E1BB/, in the introduction section, reveals the identity information: config/marginal_utility_calibration_v3.json, fields source.scores and source.adaptive_records. It may violate the paper submission requirement.
Questions for authors
See weaknesses.