- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
LoReS is a training-free inference method that generates and ranks multiple low-resolution candidates, promotes a small subset to high-resolution refinement, and selects the final output through a second ranking stage. Experiments on text-to-image generation and instruction-based editing report improved quality–latency trade-offs.
Critical strengths
-
The pipeline is simple and practical. It allocates expensive high-resolution computation to promising candidates while reusing their low-resolution states, and can be combined with caching, quantization, and distilled models.
-
The evaluation covers generation and editing across three main backbones, with useful ablations on search breadth, refinement depth, and retained-pool size. Improvements on held-out metrics and independent editing judges provide evidence beyond the verifier being optimized.
Critical weaknesses
-
The incremental contribution over closely related methods is insufficiently established. Low-resolution previews for candidate selection have been explored by Jeong et al. (2026b), while Flash-BoN already uses inexpensive drafts, verification, and subsequent refinement. LoReS offers a specific combination of dynamic-resolution sampling and two-stage selection, but neither of these closely related approaches is directly evaluated. Comparisons with PSP and conventional Best-of-N are useful, yet do not resolve whether the proposed combination provides a substantial advantage over the nearest alternatives.
-
The efficiency comparisons are not fully controlled. Appendices A.4–A.5 indicate that some baseline latencies are derived from previously reported speedups and rescaled to a common reference, rather than uniformly re-measured. Although LoReS accounts for decoding and verification in its own timing, heterogeneous implementations and resource settings weaken the central “faster-and-better” claim. Comparable GPU-resource and peak-memory reporting is also important when varying the candidate-pool size.
Questions for authors
-
How does LoReS compare with Flash-BoN and a verifier-based selection pipeline using Jeong et al.’s previews under matched hardware, verifier, and end-to-end time budgets?
-
Which baseline timings were directly measured and which were rescaled? Can the main efficiency conclusions be verified under a common execution environment, with verification overhead, GPU allocation, and peak memory reported?