- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 1
Read review
Paper summary
This paper proposes Branched Optimal Transport Amortization (BOTA), a method for learning flow-based generative models whose trajectories exhibit hierarchical, tree-like branching structures. Inspired by the economy-of-scale principle of Branched Optimal Transport (BOT), the method encourages particles to share transport pathways before branching toward their respective destinations. Analogous to minibatch optimal transport, BOTA follows a two-stage procedure: (1) optimizing discrete particle trajectories using a BOT-inspired transport cost and (2) amortizing the optimized trajectories into a neural velocity field through flow matching.
A central challenge is that theoretical BOT requires atomic probability measures, whereas continuous normalizing flows operate on continuous distributions. To address this incompatibility, the authors introduce a differentiable soft-atomic relaxation that approximates the mass-dependent BOT cost using soft assignments of particles to proxy centers. The resulting discrete optimization combines this transport cost with a terminal matching objective. The proposed method is evaluated on Gaussian mixtures, simulated biological differentiation data (TedSim), and image datasets (MNIST and FFHQ). The experiments demonstrate branching-like trajectory structures and reduced soft-atomic transport costs compared with standard flow matching, while maintaining comparable distribution matching performance.
Critical strengths
Novelty. The paper presents a methodological contribution by introducing a differentiable, soft-atomic approximation of Branched Optimal Transport (BOT) and amortizing the resulting optimized particle trajectories into a neural velocity field. While the mass-dependent transport objective originates from classical BOT formulations, the general paradigm of incorporating optimal transport solutions into flow matching has been explored in prior work [1]. Furthermore, branching generative flows have already been investigated in Branched Schrödinger Bridge Matching [2], which also employs trajectory optimization followed by flow matching-based amortization. Thus, the primary novelty lies in the specific mass-dependent soft-atomic objective and its discrete numerical optimization, rather than the broader ideas of branching trajectories or trajectory optimization followed by amortization.
[1] Improving and Generalizing Flow-Based Generative Models with Minibatch Optimal Transport, TMLR, 2024.
[2] Branched Schrödinger Bridge Matching, ICLR, 2026.
Critical weaknesses
Insufficient theoretical justification. The proposed soft-atomic objective approximates BOT through particle clustering, but continuous normalizing flows cannot represent exact merging and splitting of trajectories. The theoretical connection between the proposed relaxation and true BOT remains insufficiently established, with no guarantees of optimality or convergence.
Insufficient experimental validation and baseline comparisons. The experiments primarily demonstrate visually plausible branching trajectories and reductions in the proposed soft-atomic cost, without establishing whether the learned trajectories recover meaningful hierarchical structures. Moreover, important baselines such as OT-CFM, ReFlow, and existing branching generative models are missing or insufficiently compared, making it difficult to assess the advantages of the proposed approach.
Missing ablations and unclear practical benefits. Despite the newly added analysis of the branching parameter , the paper lacks systematic ablations on key hyperparameters such as , , , and . Furthermore, although BOTA achieves lower branched transport costs, it does not demonstrate meaningful improvements in generation quality or sampling efficiency over standard Flow Matching, despite requiring approximately twice the training time.
Questions for authors
- Theoretical justification: Given that continuous normalizing flows cannot represent exact merging and splitting of trajectories, in what sense does the proposed soft-atomic relaxation approximate true Branched Optimal Transport? Can the authors provide stronger theoretical justification or clarify the limitations of this approximation?
- Validation of hierarchical structure: The experiments mainly demonstrate visually plausible branching trajectories and reductions in the proposed soft-atomic cost. Can the authors quantitatively evaluate whether the learned trajectories recover meaningful hierarchical structures, for example, using the ground-truth lineage information available in TedSim?
- Baseline comparisons and practical benefits: Can the authors provide comparisons against relevant OT-based methods, such as OT-CFM and ReFlow, as well as stronger comparisons with existing branching generative models? Beyond reducing the proposed transport cost, what practical advantages does BOTA offer in terms of generation quality, computational efficiency, or downstream applications?
- Hyperparameter sensitivity: Can the authors provide systematic ablations on the number of proxy centers , particle count , bandwidth , and terminal matching weight ? How sensitive are the learned branching structures and distribution matching performance to these choices?
2 comments
Thank you for the detailed response and additional experiments. I appreciate the new OT-CFM and ReFlow comparisons, which strengthen the empirical evidence that BOTA reduces the proposed soft-atomic transport cost while maintaining comparable endpoint matching. I also acknowledge the clarification that BOTA primarily aims to control transport geometry rather than improve generation quality or sampling efficiency.
However, two central concerns remain:
1. Insufficient theoretical justification. Lemma 1 (Section 4, p. 5) establishes convergence of soft assignments to hard nearest-center assignments as the bandwidth approaches zero. However, this does not establish that minimizing the proposed objective approximates solutions to the original BOT problem. In particular, convergence or optimality guarantees for the resulting transport trajectories remain unclear.
2. Lack of validation of meaningful hierarchical structure. In response to Question 2, the authors refer to their additional baseline comparisons, which demonstrate lower soft-atomic transport costs but do not establish whether the learned trajectories recover TedSim's ground-truth lineage relationships. Importantly, the authors explicitly acknowledge in Section 8 (p. 9, lines 454–456) that direct evaluation against TedSim's ancestor–descendant coupling is left to future work. This missing validation is particularly concerning given the paper's central motivation of learning meaningful hierarchical generative processes.
Overall, while the rebuttal strengthens the empirical evidence for the proposed objective, lower transport cost alone does not establish theoretical fidelity to BOT or recovery of meaningful data hierarchies. As these central concerns remain unresolved, I maintain my current rating of weak rejection.
Dear Reviewer, thank you for your feedback.
Answers to Weaknesses
Connection to branched optimal transport.
BOTA's contribution is the soft-atomic, mass-dependent objective (Section 4), which encourages shared routes. Within a Lipschitz ODE flow, branching takes the form of distinct, nearby paths traveling together before diverging.
Lemma 1 (p. 5, lines 239–254; Appendix A, pp. 11–12) establishes the hard-assignment limit as σ→0 for fixed centers and unique nearest-center assignments. For the mathematical objective without numerical stabilizers, the limiting cost equals the atomic BOT cost when each occupied cell represents one atom with a common velocity. Stage 1 optimizes paths for fixed source–target assignments with an endpoint-matching penalty (Section 5.1, p. 6, lines 290–298).
Evaluation and baseline comparisons.
Table 1 (p. 7) compares BOTA with BSBM, CNF, CFM, and FM. BOTA achieves approximately 2.3× lower soft-atomic cost than FM and CFM, with comparable endpoint matching (Section 6.2, p. 8, lines 388–395; Figure 8b, p. 14).
We have now added minibatch OT-CFM and ReFlow comparisons in a supplementary TedSim time-8-to-time-12 experiment. All methods are evaluated with the same BOT cost (α=0.5, shared bandwidth and number of integration steps). Values are mean ± sample SD over five training seeds on the same simulation.
BOTA achieves the lowest mean cost, 13.1% below OT-CFM.
Practical benefits and parameter analysis.
On FFHQ, BOTA's FID is comparable to FM: 10.46±1.80 versus 10.61±1.39 (Appendix Table 2, p. 12). Appendix Table 3 (p. 15) reports 425 s for offline optimization + 360 s for amortization, versus 360 s for FM. The reported sampling protocol uses the same network size and integration procedure. These submitted results demonstrate control over transport geometry alongside comparable endpoint and sample quality.
The α ablation shows how the branching exponent controls shared-trunk geometry (Figure 6, p. 13). Question 4 details the parameter settings and their roles.
Answers to Questions
In what sense does the relaxation approximate BOT?
Please see our response to Weakness 1 above.
Does BOTA recover the TedSim hierarchy?
Please see our response to Weakness 2 above.
What comparisons and practical benefits are established?
Please see our responses to Weaknesses 2 and 3 above.
How sensitive is BOTA to K, N, σ, and λ?
Appendix A.4 (p. 15, lines 758–773) reports K=50, σ=0.6, a stage-1 particle count of N=10,000, and λ=20, with centers following the particle cloud. K controls spatial resolution, N affects mass estimates, and λ balances endpoint matching against path cost. Large σ blurs assignments; very small σ makes them nearly one-hot, weakening positional gradients away from nearest-center ties (Section 8, p. 9, lines 450–452).
Figure 6 (p. 13) provides a qualitative ablation over α∈{0.1,0.5,0.9}: smaller values favor shared trunks.
Thank you again for your thoughtful review. We hope these responses clarify the contribution and would appreciate your reconsideration of the score.