- Rating
- 3(+1)
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper studies representation distribution matching for one-step image generation along two axes: the distributional discrepancy and the feature representations. Its proposed recipe, iRDM, combines exact within-batch kernel repulsion with a frozen Nyström approximation of the reference attraction, large generated batches enabled by gradient caching, and adaptive weighting across ten frozen encoders. For text-to-image post-training, it additionally matches joint image–text feature distributions. The paper reports improvements over its ImageNet initialization on a fourteen-encoder Sliced-Wasserstein metric, including a four-encoder held-out subset, and on PickScore. It also reports one-step FLUX.2 results exceeding the four-step starting model on GenEval and PickScore. The main strengths are the practical distribution-matching recipe and its ablations; the main concerns concern evaluation independence, benchmark-conditioned reference curation, and the attribution of the reported gains.
Critical strengths
-
Practical distribution-matching design: Separating the stationary reference attraction from the moving generated-sample repulsion is a useful design. The frozen reference removes per-step reference-resampling noise, while gradient caching enables investigation of substantially larger generation batches (§§3.1–3.2).
-
Useful empirical decomposition: The batch-size, discrepancy, and encoder-weighting experiments provide actionable evidence about the recipe. In particular, the single-encoder experiment illustrates why matching one representation need not eliminate visible artifacts (§3.3; Appendices D–F).
-
Evidence beyond the directly optimized encoders: Table 1 reports an improvement on the four held-out encoders, from 1.98 to 1.54 relative to FD-SIM. The ImageNet PickScore comparison provides additional supporting evidence. These results should be acknowledged, although they do not fully establish perceptual superiority or resistance to metric gaming.
Critical weaknesses
-
Evaluation independence remains insufficiently established: Ten of the fourteen encoders in the primary metric also define the training objective. Switching from MMD to Sliced-Wasserstein changes the discrepancy but retains the same representations and their potential blind spots. The held-out improvement is encouraging; however, the training and held-out panels contain closely related model families (e.g., DINOv3 vs. DINOv2, SigLIP2 vs. SigLIP). This raises a legitimate question about evaluator redundancy rather than proving that the held-out results are invalid. As extensively discussed in prior literature on feature-space evaluation pitfalls (e.g., Stein et al., Exposing Flaws of Generative Model Evaluation Metrics and Their Unfair Treatment of Diffusion Models, NeurIPS 2023; Morozov et al., ICLR 2021), generative evaluation relying on correlated representations risks inheriting shared blind spots. Representation-similarity analysis, family-level holdouts, and blinded human evaluation would significantly strengthen the anti-gaming claim.
-
The text-to-image evaluation is confounded by benchmark-conditioned curation: Appendix H.1 constructs part of the reference from the 553 GenEval evaluation prompts, filters generations using the benchmark detector, and includes these prompts in the training conditioning pool. Consequently, the reported GenEval improvement does not establish generalization to unseen compositional prompts. Moreover, PickScore ranks candidates for the perception reference, making the subsequent T2I PickScore evaluation dependent on a scorer already used in the training-data pipeline. The absence of a direct reward loss does not remove this dependence. A benchmark-disjoint reference and evaluation on unseen prompts are necessary to support the broader claims.
-
Method, data-curation, and compute effects are not adequately separated: The T2I experiment changes both the sampling procedure and the target distribution, using selected teacher outputs rather than the teacher’s unfiltered distribution. The DMD2 baseline uses a different prompt pool and reaches its reported peak in approximately 10 H200 GPU-hours, versus 90 reported for iRDM (§4.2; Appendix H.2). These comparisons do not isolate the contribution of the matching objective. The paper should report end-to-end reference-construction costs and add controlled comparisons using matched prompt distributions, reference access where applicable, and compute budgets.
-
Some methodological claims exceed the supporting evidence: The controller ablation shows a modest aggregate improvement and a larger worst-encoder improvement, but does not demonstrate prevention of perceptual shortcut learning (Appendix E). Likewise, the evidence supports an effective post-training recipe, not yet a competitive from-scratch generator. The paper should calibrate these claims and better contextualize its multi-encoder supervision relative to Vision-Aided GAN (Kumari et al., CVPR 2022), which already uses frozen pretrained feature ensembles with trainable adversarial heads and progressive model selection. The relevant distinction is direct kernel matching and adaptive weighting, rather than multi-encoder supervision itself.
Questions for authors
- Evaluator independence: Given the already reported held-out improvement, can you provide representation-redundancy analysis (e.g., CKA), family-level holdout experiments, or blinded human comparisons? Were held-out metrics used for hyperparameter tuning or checkpoint selection?
- Benchmark-disjoint generalization: How much of the GenEval improvement remains when the reference and conditioning pool exclude the evaluation prompts? Can you separately ablate GenEval-detector filtering and PickScore-based selection, and evaluate on unseen compositional prompts?
- Fair comparison and full cost: Does the reported 90 GPU-hour budget include teacher sampling, filtering, encoder feature extraction, and Nyström construction? How does iRDM compare with DMD2 under controlled data and compute settings?
- Metric interpretation: Equation (5) makes the selected validation baseline equal to one by normalization, but does not establish one as a universal lower bound. Can the authors clarify the “real floor” terminology and report uncertainty across evaluation samples, projections, and training seeds?
General response: evaluation, FID, scope and text-to-image
We thank the reviewers. Four questions recur across the reviews; short answers first, then the details.
Details
1. Evaluation (mtSD-W1, Q1; mBiS-W1, Q1, Q4)
2. FID (4DFN-W2; mtSD-Q2)
3. Scope (4DFN-W1; mBiS-W4)
4. Text-to-image (mtSD-W2; mBiS-W2, W3, Q2, Q3)
Planned revisions. The revised paper will describe SW₍r14₎ as a different discrepancy checked on held-out and family-disjoint encoders, three preference models and GPT-6-Astra; report FID and FD_DINOv2 for every generator; scope the batch claim to post-training; rename "real floor" to "real-data reference level"; add the new text-to-image results and the full cost; and add Vision-Aided GAN, Stein et al. and Morozov et al. to related work.