- Rating
- 3(+1)
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
The paper proposes CachedSearch, a training-free wrapper for best-of- search in video diffusion models. It uses feature caching to generate inexpensive candidate rollouts, ranks them with a verifier, and then regenerates only the selected seed with the original full-compute sampler. The central empirical claim is that caching can alter video pixels while largely preserving the verifier’s within-prompt ranking, allowing wider search at lower rollout cost. On 7,552 paired cached/full-compute Wan2.1-T2V-1.3B rollouts from VBench, the default cache achieves a median per-prompt Spearman correlation of 0.905 and retains about 90% of best-of-8’s reward gain. The paper also evaluates additional prompt suites, caches, verifiers, and six models across four families, and presents a Gaussian-copula analysis of gain capture under ranking noise.
Critical strengths
The paper identifies a useful distinction between pixel fidelity and ranking fidelity: for sample-and-rank search, a cheap rollout need not visually match its full-compute counterpart if it preserves the ordering relevant to selection. The seed-matched evaluation makes this claim testable, and the comparisons against step truncation and reduced resolution help isolate why the evaluated cache works better.
The evaluation is thorough: t measures rank correlation, top-1 agreement, regret, gain capture, and cost; tests several cache implementations and backbones.
Critical weaknesses
The core algorithmic idea is not sufficiently distinguished from closely related prior work. Sol-RL (Li et al., 2026, FP4 Explore, BF16 Train, arXiv:2604.06916) uses low-precision, reduced-step diffusion rollouts to rank a large candidate pool, then regenerates selected seeds in BF16 for policy updates. Sol-RL addresses RL training rather than test-time video search, so the papers are not identical; however, the shared principle of using cheap approximate rollouts for ranking and reserving high-fidelity computation for selected seeds is central to both. The paper discusses Flash-BoN but does not cite or clearly position itself against Sol-RL. Consequently, the contribution appears primarily to be an application and empirical characterization of this idea for cached video search, rather than a new general search principle.
The evidence for broad applicability is limited for few-step models, and the reported cost savings are not fully end-to-end. All six backbones are evaluated with 50-step sampling; the schedule-length study tests 25, 50, and 100 steps, but no genuinely few-step sampler. The evaluated cache forces the first and last five steps to be computed, so it cannot skip steps when the total schedule is ten steps or fewer. The 25-step setting already offers a smaller 1.41× speedup. In addition, the reported latency excludes verifier scoring and video writing. Since wider cached search scores more candidates than the matched-cost full-search baseline, omitted scoring time could reduce the claimed end-to-end advantage.
Questions for authors
1、How do the authors distinguish CachedSearch’s conceptual contribution from Sol-RL (Li et al., 2026, arXiv:2604.06916), which also uses cheap low-fidelity rollouts to rank candidate seeds and regenerates selected samples at higher precision? Could the related-work discussion explain this relationship explicitly?
2、If the author can report end-to-end timing that includes verifier scoring for the fixed-budget comparisons, especially the comparison of six cached candidates against four full-compute candidates?
3、How does the method perform on few-step or distilled video samplers, such as 4–8-step ? With the current rule that computes the first and last five steps, caching appears to provide no savings at ten steps or fewer.
3 comments
Gentle Reminder: Discussion period ending soon
Dear Reviewer,
Just a brief reminder that the Discussion period concludes in a few days.
Thank you again for your thoughtful and thorough reviews. We provided a detailed response to all your concerns in our rebuttal. If you feel we addressed your concerns, we would really appreciate it if you could acknowledge and consider reassessing your score. We would be happy to address any remaining concerns during the remainder of the discussion period.
Thank you again for the time and effort you put into the review.
The added experiments is valuable and help better understanding.
The added experiments are valuable; however, as it is claimed, it cannot be applied to few-step models, which presents a clear limitation in practical applications. All things considered, I will raise my rating score, while clearly flagging the constraints on its applicability
Response to Reviewer 398k
Thank you for the thorough review. We are glad you found distinction between pixel fidelity and ranking fidelity useful, the seed-matched evaluation a design that makes the claim testable, the comparisons against step truncation and reduced resolution helpful in isolating why the cache works, and the evaluation thorough. Below, we address your concerns:
(W1, Q1):
Thank you for pointing us to Sol-RL. It is related in spirit, and we will cite it and discuss the relationship explicitly in Sec. 6. Sol-RL accelerates RL post-training of text-to-image models: per prompt it rolls out 96 noises with a 4-bit (NVFP4) model, keeps the 12 best and 12 worst seeds. Both works rank with cheap rollouts and recompute the selection at high fidelity. They reach this independently and in different settings, and we see Sol-RL as supporting evidence for the principle. CachedSearch differs in four respects, which we believe make it more than an application of the same idea:
Theorem 1, the equal-cost rule and the screen are statements about when cheap exploration preserves a search. They are not specific to caching or to video, and they are what we mean by a search principle.
(W2, Q2):
Thank you for asking for this; the comparison is now end to end. ImageReward on 8 frames takes 0.27 s per candidate, 0.4% of one full rollout (68.3 s). It scores frames in memory, so search writes no candidate videos. The commit also resumes after the five uncached warm-up steps (suggested by Reviewer g9Pc).
The advantage survives scoring time. Inside the end-to-end budget of full best-of-3 and best-of-4, CachedSearch gains 10.1% and 11.1% more. The second row is the six-against-four comparison that the reviewer asked about. Our pruned pipeline, timed end to end takes 256 s against 549 s for best-of-8 and keeps 93.3% of its gain. With a much slower verifier (5 s per candidate), N=8 still costs 64.7% of best-of-8. We will put verifier time into Eq. 1 for clarity.
(W2, Q3):
Thank you for the insightful question. Your observation about the cache used in the paper is accurate: it computes the first and last five steps, so it has nothing to skip at ten steps or fewer, and we will add it into the discussion of our manuscript. The principle is not tied to that cache, so we ran the study with two public distilled Wan2.1-1.3B students (rCM-4 steps; FastWan-3 steps) on 50 prompts × 8 seeds, every rollout started from the teacher's noise:
Thank you for the detailed and fair review. The Sol-RL discussion, the end-to-end timing and the few-step study all come from your questions, and each makes the positioning and the scope of the paper clearer and stronger. We hope these answers address your concerns. If you are satisfied, we would be grateful if you would consider raising your score.