- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 1
- Soundness
- 3
Read review
Paper summary
This paper presents convergence guarantees for the distribution learned by flow matching involving only the intrinsic dimension of the data. The authors work with a notion of data dimension arising from optimal transport, the -upper Wasserstein dimension, and show that the convergence rate of the learned distribution in Wasserstein space depends only on this dimension. This contribution is interesting and a potentially significant step in our understanding of flow models, and gives a result analogous to the geometric guarantees we have for classical manifold learning. The presentation of the problem is well done and the authors identify a clear gap in the literature. However, the paper needs some significant changes to both its mathematical presentation and experiments to be accepted. The theory is overly dense and difficult to follow, and the experiments are limited and do not address the main claims.
The paper is potentially a significant theoretic contribution, but needs much clearer presentation. Given a sufficient author response, I would be willing to increase my score.
Critical strengths
- The introduction clearly establishes the need for the work. I really like this motivation and the use of the optimal-transport-based distance to characterise the dimension is very interesting.
Critical weaknesses
- For a mostly theoretical paper, I think the results should be much more clearly presented and explained. While I don't doubt your AI use statement, I think the proliferation of AI based results makes it especially important to clarify the point or spirit of a technical assumption or results. For example, I have no idea how to interpret your 'design choices' for , and the standard examples are mentioned both before and after their statement. The main theorem is also nearly impossible to read, both in its formatting on the page and its content. Why should the network assumptions and hyperparameters satisfy these laws in , and what do they mean in practice? For example, a fuller and more intuitive explanation of the result and its practical consequences would be more useful than the Proof Sketch section, which could be in the appendix.
- Since the proof of concept experiment is an illustration on synthetic data, it would be useful to use an example with a more explicit metric than FID. FID is not a perfect metric for image quality, and is confounded by the choice of inception network - it may, for example, respond differently to the different dimensions you construct. It would be clearer to have synthetic data from a deliberately chosen manifold or stratified space where you could estimate the Wasserstein distance explictly? This would also allow you to fix the data distribution while lifting to higher ambient dimenions - I would find this to be more compelling evidence that the intrinsic dimension alone (or mostly) controls the convergence rate. As stated, the experiments do not support your claims, and the fact that lower-dimensional data is easier to learn is not a new result.
Questions for authors
- You say there's no Lipschitz assumption but the bounded-weight part of the assumption, together with Lipschitz activations, gives only Lipschitz functions. Does this affect your analysis?
- Could you discuss the relationship to methods that explicitly exploit low dimensional structure in flow matching, e.g. [1]?
[1] Bamberger, J., Jones, I., Duncan, D., Bronstein, M., Vandergheynst, P., & Gosztolai, A. (2026, April). Carré du champ flow matching: better quality-generalisation tradeoff in generative models.
4 comments
Thank you for your response and clarifications. I can see I misread the statement about design choices, so thank you for the correction.
While I can see that these amendments would address my concerns about presentation, you have not resubmitted a draft with these changes implemented. Also, while I agree that the proposed line segment experiment would go some way toward improving the empirical evidence for dimension-dependence, I think more substantial synthetic data evidence (or even real data) would be required for ICLR, and these experiments have also not been run. As such, I will maintain my current scores.
Revised Version
Dear Reviewer,
We thank you for your follow-up. We understand your concern that the proposed changes and experiments were insufficient without an updated manuscript and completed results.
We are providing the revised manuscript with this response. It incorporates the presentation changes discussed above, including a clearer explanation of the main theorem, the interpolation design choices, and the scope and limitations of the guarantee.
We have also added synthetic experiments beyond the line-segment example. In particular, we study a uniform five-dimensional torus embedded in ten dimensions, training a neural velocity field by conditional flow matching and sampling with the SDE. We evaluate six training sample sizes from 64 to 2,048, with five training seeds and error bars. The estimated Wasserstein-2 error has an observed log–log slope of −0.189, compared with the reference slope −1/5. We explicitly acknowledge that this finite-sample comparison does not establish the asymptotic rate. The line-segment experiments additionally examine changes in ambient dimension while preserving the target geometry.
The full BigGAN SDE evaluation remains underway. We appreciate your assessment and would be grateful if you could consider the revised manuscript and the additional completed experiments.
Thank you for providing these updated results. I appreciate the effort to improve the empirical evidence for the paper and think that it has improved.
However, I feel that the presentation remains a significant issue. The core of the paper is the main theorem and design choices, which remain completely impenetrable to a human reader. The very large number of technical assumptions and details of each constant provide no intuition. For example, the exponent for n in the rate for W can be enormous when D is high - what does this mean in practice? It seems that this has important consequences that are not discussed.
The same can be said for the new experiments, which show positive results but are not explained clearly enough for the reader. The details of the torus experiment, while providing important empirical evidence for the result, focus on bookkeeping not intuition. We don't need another explanation of flow matching and every hyperparameter choice (which can be in the appendix), but do need an explanation of what a 'Sobol reference' is, why it's appropriate, etc. This section should also appear after the theorem it is testing.
In light of these issues, I don't think the paper is yet ready for ICLR and will maintain my score.
Response to Reviewer mqXM
We sincerely thank the reviewer for their careful reading of our manuscript and thoughtful, constructive feedback. We particularly appreciate the reviewer's recognition that the work is well-motivated and potentially significant. Below, we respond to the reviewer's critiques in details.
Presentation We agree with the reviewer that the paper would benefit by a more detailed presentation and explanations of the main theorem. The network size and the hyperparameters are user-defined choices and the main theorem specifies that with suitable choices of network size, step size, and stopping time, the generated distribution is, with high probability, the Wasserstein error rate depends on the intrinsic data dimension of the target probability distribution.
The standard examples are mentioned both before and after not by mistake, but the latter emphasizes the choice of κ1 and κ2 for these popular choices. We will mention this only once (before D1) for better clarity in the revised draft.
To illustrate how these hyperparameters and network sizes scale in practice we will demonstrate with the linear and VP interpolation scheme and remove the proof-sketch to the appendix, following the reviewer's suggestion.
New Experiments We thank the reviewer for suggesting a more direct way to study the role of ambient dimension. The FID results in Figure 1 illustrate how performance varies across our synthetic image datasets. To complement them, we will conduct experiments with a uniform distribution on a line segment embedded isometrically in spaces of different ambient dimensions. For each embedding, we will vary the training sample size and use the SDE sampler from the paper. This will allow us to examine how the observed error varies with sample size and ambient dimension while keeping the intrinsic geometry fixed. We thank the reviewer for the discussion and will add the experiments in the final version of the paper.
Lipschitz assumption. We thank the reviewer for raising this point. Our statement refers to the true velocity field v⋆. Under bounded support and the conditions on the interpolation schedule, we show that, for each δ>0,
Lip(v⋆(⋅,t))≤Cδ,0≤t≤1−δ
Thus, Lipschitz continuity of v⋆ on the early-stopped interval follows from the analysis, and Cδ may grow as δ decreases. The reviewer is correct that each fitted ReLU network is Lipschitz. Our proof allows its Lipschitz constant to grow with the network size. We will clarify this distinction in the manuscript.
Relation to Carré du champ flow matching. For linear interpolation, our conditional path toward a training point xi is txi+(1−t)Z, where Z∼N(0,I). Bamberger et al. [1] add the term tΓi1/2Z, so setting their local covariance Γi to zero recovers our path exactly. To see what this changes, consider data lying on a curve. If Γi is concentrated along the tangent at xi, the noise perpendicular to the curve vanishes as t→1, while some variation along the tangent remains. Their method thus uses estimated geometry to spread mass locally around each observation. Our theorem, on the other hand, shows how the data's intrinsic geometry can govern the Wasserstein convergence rate even when the interpolation uses no such estimate. It would be interesting to see if the use of such geometric intuitions can benefit flow-matching, theoretically. We thank the reviewer for this interesting discussion and will add this to the final draft of the manuscript.