- Rating
- 1
- Confidence
- 3
- Informativeness
- 1
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
This paper proposes SparseEdit, a training-free method to accelerate DiT-based image editing by updating only a subset of tokens at each denoising step. Motivated by an oracle analysis showing that update regions are clustered early and become fragmented later, it selects tokens with a locality prior that weakens over denoising. It also uses a short dense warmup to set per-request budgets and switches among dense refresh, sparse computation, and velocity reuse at each step. Across three editors and two benchmarks, it achieves 1.83–2.56× speedups while staying close to the dense outputs.
Critical strengths
-
The paper correctly identifies the cost structure specific to editing. The observation that reference tokens double the sequence length, and that the speedup of region-aware methods varies with the edited area, is well motivated. Assigning an explicit per-request update budget to secure consistent acceleration even for global edits is a practical design choice.
-
The ablation directly targets the core claim. Table 2 fixes the speedup at about 2.24× and compares fixed locality (LPIPS 0.064) and fixed pointwise selection (0.058) against stage-aware selection (0.037). Since the computation is controlled and only the selection rule changes, the comparison is clean.
-
The oracle analysis provides an intuitive motivation. The result that an oracle updating only 15% of tokens nearly reproduces the dense output (LPIPS 0.010) is a meaningful diagnostic that shows the upper bound of spatial sparsity in editing.
Critical weaknesses
-
The analysis is insufficient. Apart from the observation in Figure 1 that the tokens selected by the top-15% oracle become more dispersed in later denoising steps, there is little analysis. Even this observation is based on a single representative example (four including the appendix) and is not compared against a random mask with the same budget. On a 64×64 grid, a random 15% mask has about 437 connected components, and the late-stage mean of 362 is close to this value. The fragmentation may therefore be a trivial consequence of velocity changes becoming flat in later steps, which makes top-K selection close to random. In addition, the fact that edited regions change substantially early while unedited regions stabilize early has already been analyzed from a trajectory perspective by RegionE. The rest of the paper is an engineering design of how to combine refresh, sparse computation, and velocity reuse, which makes the scientific insight offered by this work unclear.
-
The novelty is limited. Sparse computation with cached K/V is the same as in RAS and ToCa, and the combination of reference-token caching and velocity reuse is nearly identical to RegionE. The budget-based velocity reuse is also structurally equivalent to TeaCache, which accumulates estimated changes and recomputes once a threshold is exceeded. The only new component is a rule that linearly interpolates between 5×5-averaged and pointwise scores according to the flow time. Moreover, although the paper targets image editing, it contains few components specific to editing. The core stage-aware selection relies only on velocity changes and could be applied directly to image generation, while editing information (the discrepancy from the reference) is used only as one term of the routing score.
-
Editing quality itself is not evaluated. All metrics are PSNR, SSIM, and LPIPS relative to the dense output. Caching and reuse may yield outputs similar to the dense output, but this does not guarantee a successful edit. In particular, whole-image metrics are dominated by the large unedited regions, so failures in which the instruction is only partially applied within the edited region can be hidden by small numerical differences. Comparisons with the baselines on such editing-quality metrics are essential.
-
There is no per-task analysis to support the claim against region-aware methods. The paper’s central argument is that region-aware methods lose acceleration on global edits, whereas SparseEdit maintains consistent speedup through its explicit budget. However, without a breakdown over the 11 tasks of GEdit-Bench and the 5 tasks of KontextBench, this claim cannot be verified. The background-editing and style-transfer examples in Figure 3 are insufficient, and a table reporting speedup and quality separately for local and global edits is needed.
Questions for authors
-
Could you report the connected-component statistics of the oracle masks over the full benchmarks, together with a random-mask baseline under the same budget? In addition, could you show whether imposing a locality prior on the oracle actually improves quality, and how your analysis differs from the trajectory analysis in RegionE?
-
Could you clarify which components are specific to image editing?
-
Could you provide a comparison of editing quality across all methods, for example using GPT-4o-based evaluation, rather than only measuring fidelity to the dense outputs?
-
Could you provide speedup and quality broken down by task, or at least separated into local and global edits, for SparseEdit and the region-aware baselines?