- Rating
- 1
- Confidence
- 4
- Informativeness
- 1
- Presentation
- 1
- Soundness
- 2
Read review
Paper summary
The paper proposes a continuous normalizing flow-based approach for dynamic Wasserstein-p dynamics. Training loss employed to train the flows consist of two weighted terms: (1) Potential matching loss, which is derived using Wasserstein-p extension of Benamou-Brenier formulation of dynamic optimal transport. (2) Terminal distribution loss, the term to enforce the matching for terminal distribution. The paper further applies the proposed methodology to toy transport geometry, density estimation and image color transformation problems.
Critical strengths
The paper studies the dynamic optimal transport, which is helpful in the better understanding of existing models and can be helpful in the development of new generative models.
Critical weaknesses
-
The preliminaries section of the paper does not properly motivate the discussion or establish the background. None of the equations discussed in Section 2.1 (for example, the Kantorovich problem, McCann interpolation, and the Hamilton-Jacobi-Bellman dual corresponding to the continuity equation) were originally proposed by the authors, but there is no citation whatsoever. In line 92, the existence of the Monge map is discussed without even defining it. Sections 2.2 and 2.3 do not properly establish the background required to understand the work done in the paper and fail to cite any references.
-
The main contributions of the paper are discussed in Section 3, but due to the poor development of ideas in Section 2, Section 3 also suffers. For example, Equation 1 is expressed as if it were a fact without any citations, and the discussion after Equation 2 contains redundant, non-standard notation, which requires careful reading for it to make sense. Also, the pushforward has been denoted by # in the main body and by in the appendix.
-
The discussion in Section 3 does not motivate the weighted objective; to fully understand the matching objective, one has to read lines 559–602 in the appendix. If one does not have sufficient background in dynamic optimal transport or generative models, it is almost impossible to follow Section 3.2. In Section 3.3, the discussion before and after Theorem 3.2 does not properly relate it to the subsequent development of the neural network parameterization framework.
-
The proof of theorem in the appendix is difficult to follow. One primary reason for this is the fact that the equations are not numbered, and the arguments are stated without any discussion.
-
Technically, the total potential matching optimal transport loss has three optimization variables, i.e., two weights and one flow variable. The paper fixes two scalars and parameterizes the potential using neural networks, which can result in suboptimality. The paper does not discuss how the scalar weights are chosen.
-
The experiments are lacking in both breadth and depth. The majority of the experiments are done on toy point clouds and are not fully representative of the capabilities of neural optimal transport and related generative models.
-
From section 3.2, it seems that optimal trajectories should be straight lines but trajectories in Figure 2(c) are not straight.
Questions for authors
-
It seems that potential matching objective is directly related to OT conditional flow matching and rectified flow matching, authors should elaborate on that.
-
In line 259, we see that one needs reference terminal density model to evaluate the negative log-likelihood, which was never mentioned before.
-
As discussed in weakness 7 above, the trajectories of learned flow maps are not straight lines, which can be interpreted as suboptimality of learned flow maps, if in practice, transport plan is suboptimal after employing actual learnt flow maps, what is the advantage of potential matching loss as compared to Flow-matching or Stochastic interpolant type objectives, as all estimate certain Wasserstein distances.
6 comments
Response to Reviewer ve1m (2/2): Questions Q1–Q3
Q1. How does PMOT relate to OT-CFM and rectified flow?
A1. At , a pair gives all three methods the same velocity target on the bridge . The endpoint is chosen differently. OT-CFM obtains pairs by solving OT within each minibatch. Rectified flow fixes the coupling within each round and can use the fitted flow to generate the next round’s pairs. PMOT uses its own current endpoint . Gradients pass through in both and the momentum target for general . (§§3.2, 3.4 and 5, lines 234–239, 273–289 and 514–522.)
Q2. Which terminal density enters the NLL?
A2. When the target log density is available, we evaluate it at in the CNF likelihood. Training needs no target samples, even when sampling is difficult. With samples alone, the same flow can match endpoints by MMD or energy distance. We use a Gaussian density on tabular data and MMD on RGB samples. (§§2.3 and 4.3, lines 162–174 and 475–477.)
Q3. What does matching offer when paths bend?
A3. Finite training rarely attains zero loss, so fitted paths can bend. FM and stochastic interpolants fit a chosen interpolation. PMOT learns the pairing under the chosen -cost from unpaired data, without an OT solver. On two disks, PMOT and minibatch -OT-FM both sent every point to the correct disk after 1,200 updates. PMOT’s mean pointwise map MSE was about 1/16 of OT-FM’s at and 1/283 at . On the square, its time-integrated MSE against the exact OT paths was and , respectively. (§4.1, lines 326–345 and 381–389.)
We hope the revised paper is easier to follow and that the additional experiments give you greater confidence in our results.
Follow-up on our response to Reviewer ve1m
Dear Reviewer ve1m,
We would appreciate your feedback on our point-by-point responses and revised manuscript. We have added experiments and theoretical clarifications addressing your comments, with references to the relevant sections and line numbers.
With the author–reviewer discussion closing on November 18, could you let us know whether our responses address your main concerns and which issues, if any, remain? Hearing from you before the deadline would give us time to provide further clarification or revisions.
Thank you for your time and consideration.
Response to Reviewer ve1m (1/2) : Weaknesses W1–W7
Thank you for taking the time to read our paper so carefully and for the thoughtful questions you raised about both the derivations and the experiments. In the revised manuscript, we mark changes addressing your comments in teal. Bracketed reviewer IDs indicate changes that address comments from more than one reviewer.
W1. Preliminaries and references.
A1. You are right that we omitted references for several standard results and used the term “Monge map” before defining it. We now cite Villani for static OT, Santambrogio for dynamic OT and displacement interpolation, and Chen et al. for CNFs. We also define couplings, Monge maps and pushforwards before explaining how the velocity along a displacement interpolation motivates our training target. (Sections 2.1–2.3, lines 91–107, 110–149 and 155–174.)
W2. Equation (1) and notation.
A2. We derive Eq. (1) by varying the action with respect to velocity and inverting the momentum relation. After Eq. (2), we define the trajectory, endpoint and time-t law in turn. We use # for pushforwards throughout. (§§2.2 and 3.1, lines 119–136 and 186–206, Appendix A.1, lines 630–631.)
W3. The two losses and the neural model.
A3. A constant potential leaves particles in place. If the marginals differ, matching loss is zero but terminal loss is positive. Several maps can match the same target, so we also match momentum along each bridge. Under its assumptions, Theorem 3.2 gives the optimal map and dynamics at zero population loss. We train a neural potential on the empirical objective. (§§3.2–3.4, lines 210–225, 244–258 and 266–269.)
W4. Proof of Theorem 3.2.
A4. ODE uniqueness identifies the trajectory with its straight bridge in (A.1). The adjusted potential satisfies the Hamilton–Jacobi equation in (A.2). Fenchel’s inequality gives (A.3), showing that permuting destinations cannot lower total cost. (Appendix A.1, lines 721, 829 and 887.)
W5. Choosing the weights.
A5. One practical advantage was that PMOT needed no dataset-specific weight tuning. We used (λPM,λNLL)=(1,5) on 8-Gaussians, Pinwheel and three tabular datasets. On 8-Gaussians, PMOT’s map MSE was 0.01971 at weight 5 and 0.01924–0.01971 in a separate 60-fold NLL weight sweep. OT-Flow reached 0.04815 at 5 and comparable errors at 50 and 300 (0.02000 and 0.01969). On Pinwheel, OT-Flow at 100 approached PMOT at 5 in reverse W22 (0.03430 vs. 0.03421). We fit the potential with fixed positive weights, preserving any common zero. (§3.2, lines 227–230, §4.2, Table 1, lines 424–431 and 450–466.)
W6. Breadth and depth of the experiments.
A6. We evaluated density estimation and generation on three high-dimensional tabular datasets (Table 2). In the reported runs, PMOT had lower test NLL than OT-Flow on MiniBooNE, POWER and HEPMASS. For generation, PMOT had lower MMD² on POWER and OT-Flow had lower MMD² on the other two. Figure 4 shows image color transfer using samples from the target color distribution. (§4.3, lines 470–477, 487–497 and 505–506.)
W7. Moons trajectories.
A7. Exact straightness holds at zero population loss. The fitted Moons model has a positive matching residual, so slight bending is expected. We chose (2,20) by generation quality and used only eight RK4 steps per training solve. For all 900 points in Figure 3(c) (originally 2(c)), paths averaged 1.26% longer than their chords at both 32 and 64 evaluation steps. (§§3.3 and 4.1, lines 244–256, 414–418 and 445–447.)