[W1] The main motivation of extending elastic OT framework to continuous setting was explained (see Introduction and Abstract) by the fact that this OT formulation relaxes the strict constraints in the classical OT problem and, thus, should be more robust to outliers and other imperfections in input data. Well-known extensions of the OT problem offering such kind of robustness include partial and unbalanced OT. The authors claim that elastic (or adaptive) OT offers another kind of flexibility which explains the importance of developing the related continuous solver. Thus, it is natural to expect that the paper will thoroughly analyse the differences and show the advantages of the developed approach in comparison to unbalanced and/or partial OT-based ones. However, actually, the method seems to be tailored to the particular biological tasks since all of the experiments are biological and even the cost function which is considered in most of the theoretical results seems to be motivated by the biological experiments considered further. Thus, I think that the paper should be enhanced by either considering a more broad scope of applications or stating the biological focus from the beginning. Maybe, this should be obvious even from the title - the paper of (Klein et al., 2024) is a good example.
[W2] Hereafter, I detail my concerns regarding the considered experiments taking into account that in the current version of the paper the method is positioned as a general one. The first significant gap is the absence of tests in toy experiments showing that (1) the method allows for learning the actual elastic transport maps and (2) it has differences and advantages over partial and unbalanced OT solvers in terms of robustness to outliers, class imbalance or other data imperfections. I kindly suggest the authors include these experiments in the paper.
[W3] In the biological experiments, the paper compares the proposed NAOT approach with several other OT-based methods, i.e., CellOT (Bunne et al., 2023), CondOT (Bunne et al., 2022) and GENOT (Klein et al., 2024). However, the paper does not sufficiently analyze the particular properties of the designed NAOT solver’s solutions in comparison with unbalanced or partial ones. In section 4.1, the authors claim that their approach leads to “significant performance gain” while from Table 1 it is obvious that the unbalanced OT-based method, GENOT, leads to better performance in Trametinib compound. Similar situation appears in experimental section 4.3, where the NAOT approach is beaten by other methods w.r.t. some metrics on both compounds. Why does this happen? How can the obtained results be explained from a biological point of view? Is there any explanation why relaxation of NAOT approach is meaningful in this setup and why it is better than unbalanced or partial ones?
[W4] The related issue is the limited number of considered baselines in section 4 - two of three competitors considered here correspond to classical OT case. This contradicts with the main idea of the paper where the authors claim to develop a continuous solver with a new type of relaxation. Thus, I believe that more unbalanced and unbalanced solvers should be considered here. There are a lot of papers on this topic published in recent years (Choi et al, 2023; Eyring et al., 2024; Lübeck et al., 2022; Gazdieva et al., 2024; Yang and Uhler, 2018) and I kindly suggest the authors to add some of them into comparison.
[W5] Importantly, in the experiments, the authors consider their NAOT approach conditioned on the biological context, e.g. drug dosages, and the related weakness is an unfair comparison with original CellOT and GENOT approaches which do not use conditioning by default. I kindly ask the authors to correct me, if I am wrong in understanding that they did not include conditioning into implementations of these approaches. (There are no realizations of these methods in the code and no explanations in the paper supporting this idea.) However, if I am correct in my understanding, then the generalization ability of the NAOT approach shown in experiment from section 4.2 can be treated just as a consequence of its conditional nature. Thus, I kindly suggest the authors consider the conditional versions of the baseline methods to ensure fair comparison here.
[W6] One more concern is related to the construction of the approach where the constraints in objective (14) are relaxed using the penalty term (16). It is not obvious whether the solutions of the final objective will be close to the solutions of the initial one. Thus, it is unclear whether the approach indeed allows for learning true adaptive plans. I kindly suggest the authors consider establishing some theoretical guarantee, e.g., deriving bounds on the discrepancy between the solutions of the initial and relaxed problems.
Overall, I see the significant gaps between the motivation of developing the adaptive solver and theoretical and, especially, experimental justifications which are particularly tailored to biological tasks. This raises questions regarding the overall positioning of the paper results, see the details above.
References.
Pei Yang, Yuhang Zhuang, and Qi Tan. Elastic optimal transport: Theory, application, and empirical evaluation. In The Fourteenth International Conference on Learning Representations (ICLR), 2026.
Charlotte Bunne, Andreas Krause, and Marco Cuturi. Supervised training of conditional monge maps. In Neural Information Processing Systems (NeurIPS), volume 35, pp. 6859–6872, 2022.
Charlotte Bunne, Stefan G Stark, Gabriele Gut, Jacobo Sarabia Del Castillo, Mitch Levesque, Kjong-Van Lehmann, Lucas Pelkmans, Andreas Krause, and Gunnar Ratsch. Learning single-cell perturbation responses using neural optimal transport. Nature Methods, 20:1759–1768, 2023.
Dominik Klein, Theo Uscidda, Fabian Theis, and Marco Cuturi. Genot: Entropic (gromov) wasser-stein flow matching with applications to single-cell genomics. Advances in Neural Information Processing Systems, 37:103897–103944, 2024.
J. Choi, J. Choi, and M. Kang. Generative modeling through the semi-dual formulation
of unbalanced optimal transport. In Advances in Neural Information Processing Systems,
volume 36, 2023.
L. Eyring, D. Klein, T. Uscidda, G. Palla, N. Kilbertus, Z. Akata, and F. Theis. Unbalancedness in neural monge maps improves unpaired domain translation. In The Twelfth International Conference on Learning Representations, 2024.
F. Lübeck, C. Bunne, G. Gut, J. S. del Castillo, L. Pelkmans, and D. Alvarez-Melis. Neural unbalanced optimal transport via cycle-consistent semi-couplings. arXiv preprint arXiv:2209.15621, 2022.
M. Gazdieva, A. Asadulaev, E. Burnaev, A. Korotin. Light unbalanced optimal transport. Advances in Neural Information Processing Systems, 2024
K. D. Yang and C. Uhler. Scalable unbalanced optimal transport using generative adversarial
networks. In International Conference on Learning Representations, 2018.