Fast and scalable Wasserstein-1 neural optimal transport solver for single-cell perturbation prediction
Not on the map. Why?
Abstract (arXiv)
Motivation: Predicting single-cell perturbation responses requires mapping between two unpaired single-cell data distributions. Optimal transport (OT) theory provides a principled framework for constructing such mappings by minimizing transport cost. Recently, Wasserstein-2 (W2) neural optimal transport solvers (textite.g., CellOT) have been employed for this prediction task. However, W2 OT relies on the general Kantorovich dual formulation, which involves optimizing over two conjugate functions, leading to a complex min-max optimization problem that converges slowly. Results: To address these challenges, we propose a novel solver based on the Wasserstein-1 (W1) dual formulation. Unlike W2, the W1 dual simplifies the optimization to a maximization problem over a single 1-Lipschitz function, thus eliminating the need for time-consuming min-max optimization. While solving the W1 dual only reveals the transport direction and does not directly provide a unique optimal transport map, we incorporate an additional step using adversarial training to determine an appropriate transport step size, effectively recovering the transport map. Our experiments demonstrate that the proposed W1 neural optimal transport solver can mimic the W2 OT solvers in finding a unique and ``monotonic" map on 2D datasets. Moreover, the W1 OT solver achieves performance on par with or surpasses W2 OT solvers on real single-cell perturbation datasets. Furthermore, we show that W1 OT solver achieves 25 ~ 45× speedup, scales better on high dimensional transportation task, and can be directly applied on single-cell RNA-seq dataset with highly variable genes. Availability and Implementation: Our implementation and experiments are open-sourced at https://github.com/poseidonchan/w1ot.
Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). Builds on 15 of its 44 references that are in the map. First posted on arXiv 1 Nov 2024.
Builds on
15 of 44 references.
References · 15
- 2020Denoising Diffusion Probabilistic Modelscited by 21,076
- 2022Flow Matching for Generative Modelingcited by 5,702
- 2017Improved Training of Wasserstein GANscited by 2,235
- 2018Computational Optimal Transportcited by 780
- 2016Input Convex Neural Networkscited by 414
- 2018Sorting out Lipschitz function approximationcited by 213
- 2019Optimal transport mapping via input convex neural networkscited by 206
- 2021Orthogonalizing Convolutional Layers with the Cayley Transformcited by 105
- 2021Do Neural Optimal Transport Solvers Work? A Continuous Wasserstein-2 Benchmarkcited by 96
- 2022Supervised Training of Conditional Monge Mapscited by 61
- 2022Predicting Cellular Responses to Novel Drug Perturbations at a Single-Cell Resolutioncited by 45
- 2022On amortizing convex conjugates for optimal transportcited by 31
3 more
- 2020Approximating Lipschitz continuous functions with GroupSort neural networkscited by 27
- 2022Kantorovich Strikes Back! Wasserstein GANs are not Optimal Transport?cited by 19
- 2022A new method for determining Wasserstein 1 optimal transport maps from Kantorovich potentials, with deep learning applicationscited by 2
Built on by
Citing papers per year: 2025: 2; 2026: 2.
4 papers.
- 2025Towards generalizable single-cell perturbation modeling via the Conditional Monge Gapcited by 3
- 2025Displacement-Sparse Neural Optimal Transportcited by 1
- 2026Modeling Cell-Cycle-Aware Single-Cell Drug Perturbation Responsescited by 0
- 2026CloneOT: predicting clone-specific perturbation responses with lineage-supervised neural inverse optimal transportcited by 0
- 2026CloneOT: predicting clone-specific perturbation responses with lineage-supervised neural inverse optimal transport12 Oct 2026
- 2026Modeling Cell-Cycle-Aware Single-Cell Drug Perturbation Responses29 Jun 2026
- 2025Towards generalizable single-cell perturbation modeling via the Conditional Monge Gap11 Apr 2025
- 2025Displacement-Sparse Neural Optimal Transport3 Feb 2025