Paper Overview
Field: Computer Vision Authors: Rogerio Guimaraes, Pietro Perona Published: 2026-07-24 arXiv: 2507.19318
Abstract (translated)
Diffusion and flow-matching models dominate conditional image generation, yet inference-time scaling for these models is far less developed than for autoregressive language models. Because final quality is highly sensitive to the initial noise seed, many approaches spend extra compute on seed search or resampling under a black-box reward, typically maintaining a constant memory footprint throughout inference.
The authors show that relaxing this constraint enables an underexplored inference-time scaling axis: by front-loading exploration, evaluating many seeds early, and pruning aggressively, a fixed compute budget can be used more effectively.
Method: Progressive Seed Pruning (PSP)
- Score early: intermediate denoised estimates are scored to gauge trajectory promise.
- Prune progressively: the candidate seed set is gradually narrowed over denoising steps.
- Fixed evaluation budget: only promising trajectories are fully denoised, while the total number of model evaluations remains constant.
- Evaluated on diffusion and flow-matching backbones.
- PSP consistently improves over reward-guided selection baselines including best-of-N, importance sampling, and tree search at matched compute.
- Achieves higher GenEval scores (automatic evaluation) and better human-evaluated prompt alignment.
- Paper: https://arxiv.org/abs/2507.19318