- Rating
- 3(+1)
- Confidence
- 2
- Informativeness
- 1
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
The authors port logical guidance results that are typically well-known for diffusion to the stochastic interpolants/flow matching case. They show that the usual results tend to not hold in that (velocity field) case, and show how to correct for it instead. Empirical results are given for some simple logical tasks over QM9, EMNIST/CMNIST and CelebA.
Critical strengths
- The presentation of the paper is rather clear, and rather easy to follow.
- The experiments seem to demonstrate the advantage of the method for stochastic interpolants over more naive approaches, especially in Table 1.
Critical weaknesses
- I think my overall qualm is with the initial motivation of this method at all, and perhaps something critical eludes my understanding. In the Gaussian case, diffusion, flow matching, and stochastic interpolants can really be seen as equivalent: flow matching, as the authors point out, can be sampled through a marginally matched SDE, diffusion can instead be sampled deterministically, and stochastic interpolants are meant to encompass both paradigms, and are typically identified with flow matching. So, it is unclear to me why the authors want to port this paradigm (which is interesting) to the stochastic interpolants case. And then, regardless of the equivalence that we can perhaps disagree on, why do the authors want stochastic interpolants instead of using diffusion models? more general paths? Perhaps I have missed out on this motivational bit, but I think this is really crucial to make this paper stronger.
- Theorem 2’s hypotheses are extremely strong, if I understand correctly, especially the conditional independence of the atoms (in a neighbourhood around the considered point). I know that it is hard to formulate theorems in diffusion and ML in general, but I’m not certain that it is very informative. I understand this as some kind of counter-example to the equality between the fields, and am convinced of their inequality in general, but I am not certain that it is as general as hoped for. So, perhaps the “theorem” label is a bit too strong? Perhaps demoting it to a proposition would be better?
- The plots for the experimental section are very hard to read. I cannot tell what is going on, really. One of the plots has also the legend overlapping with a quarter of the results. It would be very important to replot these to be able to read those numbers. However, I appreciate the willingness to produce so many baselines.
Questions for authors
I am mostly concerned about the motivation of the paper, as explained in the weaknesses. I think the paper is relatively sound, although largely incremental, even if a justification for SI's over diffusion is provided. I would be happy to revise my score should clarity in the experimental results, and, most importantly, in the motivation were addressed.
3 comments
I thank the authors for their clarification on the motivation, which corresponded to my "In the Gaussian case, [...]", and "more general paths?" comments. I am aware of the Schrödinger Bridge literature too. I appreciate their useful edits in the introduction, which highlight the central contribution of the work, and which is now more obvious. Although I am not entirely convinced by the magnitude of the contribution, I raise my score to a 3, reflecting its soundness.
We thank the reviewer for engaging with our response and for raising their score; we are glad the revised introduction makes the central contribution clearer.
Rebuttal by authors
We thank the reviewer for the clear feedback and for stating what would change their assessment. We address motivation first, since the reviewer identifies it as the main concern.
Motivation: why stochastic interpolants instead of diffusion? We agree with the reviewer that in the Gaussian case, diffusion, flow matching, and stochastic interpolants are essentially equivalent. Our Proposition 1 makes exactly this point: on Gaussian paths, velocity and score are affinely related, and LogDiff carries over to velocities unchanged. If both endpoints of our problem were Gaussian noise and data, there would be no reason to go beyond diffusion, and no need for our method, if not for applying the LoGDiff rules to the velocities and not the scores.
Diffusion models map Gaussian noise to the data distribution. Our setting is different: we transport between two data distributions, ρ0→ρ1, starting from a concrete source sample. This is known as a bridge problem. Examples are editing a given letter into a digit with a prescribed colour (CMNIST experiments), a given face into one with glasses and a hat (CelebA experiments), or a given molecule into one with a ring and an oxygen atom (QM9 experiments). Bridge models, such as stochastic interpolants with data-dependent couplings [1], I2SB [2] or Schrödinger bridges, are the standard tool for this kind of data-to-data transport, and we use stochastic interpolants because they cover this case in a single framework.
Once the source is non-Gaussian, the equivalence the reviewer mentions breaks down. The velocity is no longer an affine function of the score (Eq. 9 has an additional drift term), and this is exactly why LogDiff-style composition fails for velocities (Thm. 2). In other words, the regime in which diffusion and SIs stop being interchangeable is precisely the regime our paper addresses. We made this motivation more explicit in the introduction, with the Gaussian-path equivalence stated as the starting point and the data-to-data setting as the reason to go beyond it.
Strength of the assumptions in Theorem 2. Conditional independence of the atoms is not an additional assumption of Theorem 2. It is the same assumption under which LogDiff's AND rule gives the exact composed score. We impose it deliberately: under conditional independence the scores compose exactly, so Theorem 2 shows that the velocities still fail to compose, and isolates the failure from any violation of conditional independence. Without the assumption, the scores would not compose exactly either, and the comparison would not be meaningful. The neighbourhood is needed only so that the identity can be differentiated in x. Within this setting, the theorem is more than a counterexample: it gives the bias in closed form for every interpolant, coupling and pair of endpoints, and an exact criterion (Δt=0) for when composition is exact. The explicit counterexample is in App. A.3. That said, we agree that the label may suggest more generality than intended, and we have renamed it to Proposition 2 in the revision.
Readability of the plots. We agree, and thank the reviewer for pointing out the overlapping legend. We have replotted Figs. 2–4: the legends moved outside the panels. Further, we coloured the curves by method instead of by logical statement, and showed only one logical statement in the FID (CMNIST) and novelty (QM9) plots. These changes shall provide an improved readability of the plots.
Incremental contribution. Please see our answer to Reviewer TebU, where we explain what is new relative to LogDiff and to standard predictor-corrector sampling. In short: (i) we show that LogDiff-style composition does not carry over to velocities on general stochastic interpolants, i.e. when bridging two arbitrary (non-Gaussian) data distributions, and give the resulting bias in closed form (Thms. 1–2); (ii) unlike standard predictor-corrector sampling, our corrector is needed even in continuous time, as it removes a bias of the predictor rather than discretization error; (iii) we show that the Gaussian-path rule is a good transport proxy (Table 1)
We thank the reviewer again for the constructive feedback. We hope that the clarified motivation and the planned revisions address the reviewer's main concerns and, as the reviewer kindly offered, that they would consider revising their score. We are happy to discuss any remaining questions.
[1] Albergo et al. (2024). Stochastic Interpolants with Data-Dependent Couplings. Proceedings of the 41st International Conference on Machine Learning (ICML).
[2] Liu et al. (2023). I²SB: Image-to-Image Schrödinger Bridge. Proceedings of the 40th International Conference on Machine Learning (ICML).