- Rating
- 4(+1)
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 3
Read review
Paper summary
In this work, the authors study an extension of Drifting Models, a new paradigm for one-step generation that has received much recent attention. The authors modify the usual drifting procedure in two ways:
- They allow it to work even with single samples from the positive and negative distributions in each batch. In particular, in Eq (8) they modify the normalizing factors in the usual prescription (Eq (4)) in a manner that permits a non-trivial velocity field even when only a single positive and negative sample exist. Interestingly, this is then shown to be a gradient on a particular energy distance between probability distributions, hinting at good convergence properties.
- The ability to use single samples allows for a parallel to be made to flow matching: effectively there is now an option to regress a given input towards "it's own" positive, rather than the collective halo of positives as is done for the regular drifting mechanism.
This leads to immediate empirical benefits which are well-documented in the paper. Overall I think this is a strong paper and a valuable contribution to the literature.
Critical strengths
The methodology in the paper is very clearly explained and the connection to flow-matching seems natural. The theoretical description and justification of the results in terms of global scalar energies (e.g. in Eq (12)) is well done and important for drifting models, which do not always have such guarantees.
Operationally the method seems to work very well empirically, e.g. I was quite impressed by the rapid convergence displayed in Figure 3. The strong result on ImageNet in Table 5 is also quite impressive.
Critical weaknesses
Though the method clearly works, ultimately I ended up being a bit confused by the motivation behind it: though I understand the analogy to flow matching, over there one integrates from t = 0 to t = 1 at inference time. Whereas if I have understood the proposed method of this work correctly, in this approach at inference one simply evaluates the noise -> data map at t = 1. Why then does training a t-conditioned generator help? I feel that this is important to understand despite the empirical success of the method.
Questions for authors
-
Clarification request: it seems to me that the true motivation of lifting the single-pair degeneracy in Section 3.2 and 3.3 is to make it possible to implement the flow-matched training algorithm in Section 3.4. Is this true? If so, it would be good to emphasize this conceptual point. It is loosely suggested in the abstract that conventional drifting "requires large batches" and the new method allows for more flexibility -- should this be viewed as a significant benefit of the new method? If so, I think that Table 4 would then benefit from an ablation showing how the FID for vanilla drifting changes as one alters the batch size.
-
Clarification request: as mentioned above, could the authors provide a bit more explanation of why the flow-coupled training method explained in Algorithm 1 works better? If I understand correctly, we do not integrate across t at inference time, so why does the having a t-conditioned extension of the generator help? A pessimistic person might have thought that all the training of the generator f(z,t) at points at t < 1 simply is never really used at inference time and is somewhat superfluous. I think this is clearly not the case, but it would be good to understand clearly why. (Perhaps an extra picture in an appendix showing how the generator on some easy-to-visualize synthetic data evolves?) Overall I think this is a very strong paper and I would just like to request some further explanation of the motivation and conceptual background of the method.