aiqbench analysis
Pheno-GS introduces a scalable algorithmic framework for computing geodesic optimal transport distances on large-scale single-cell datasets, addressing critical bottlenecks in patient-level heterogeneity analysis. By integrating graph connectivity regularization and unbalanced formulations, the method significantly accelerates pairwise distance calculations while preserving manifold structure in sparse biological data. This advancement directly enhances the efficiency of machine learning pipelines designed for high-throughput phenoscaping tasks.
Pheno-GS: Phenoscape-scale Geodesic Sinkhorn
arXiv:2609.27633v1 Announce Type: new Abstract: High-throughput single-cell data is now collected across large patient cohorts. Understanding patient-level heterogeneity from cellular-level data motivates phenoscaping: embedding each single-cell distribution as a "datapoint," with distances given by optimal transport (OT). Computing geometry-aware OT at this scale, between all pairs of patient datasets, remains an open challenge, since existing methods either rely on Euclidean ground metrics that distort manifold structure or fail under sparse, unevenly sampled, or large-scale data. We present \textbf{Pheno-GS} (Phenoscape-scale Geodesic Sinkhorn), which computes accurate, scalable geodesic transport distances under noisy, unbalanced, large-scale settings via three components: ($1$) graph connectivity regularization for well-defined geodesics on sparse/disconnected manifolds; ($2$) an unbalanced OT formulation via KL marginal penalties; and ($3$) a batched matrix algorithm computing all pairwise distances in one heat diffusion (over $200 \times$ faster than Geodesic Sinkhorn for $500$ distributions). We validate Pheno-GS on synthetic benchmarks and a CyTOF perturbation dataset.
Abstract:High-throughput single-cell data is now collected across large patient cohorts. Understanding patient-level heterogeneity from cellular-level data motivates phenoscaping: embedding each single-cell distribution as a "datapoint," with distances given by optimal transport (OT). Computing geometry-aware OT at this scale, between all pairs of patient datasets, remains an open challenge, since existing methods either rely on Euclidean ground metrics that distort manifold structure or fail under sparse, unevenly sampled, or large-scale data. We present \textbf{Pheno-GS} (Phenoscape-scale Geodesic Sinkhorn), which computes accurate, scalable geodesic transport distances under noisy, unbalanced, large-scale settings via three components: ($1$) graph connectivity regularization for well-defined geodesics on sparse/disconnected manifolds; ($2$) an unbalanced OT formulation via KL marginal penalties; and ($3$) a batched matrix algorithm computing all pairwise distances in one heat diffusion (over $200 \times$ faster than Geodesic Sinkhorn for $500$ distributions). We validate Pheno-GS on synthetic benchmarks and a CyTOF perturbation dataset.
Machine Learning (cs.LG); Quantitative Methods (q-bio.QM)
arXiv:2609.27633 [cs.LG]
(or arXiv:2609.27633v1 [cs.LG] for this version)
https://doi.org/10.48550/arXiv.2609.27633 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 242 words
Related coverage
Probabilistic Geodesic Flow Matching on Location-Scale Families
arXiv · Sep 30, 2026
Annealed Sinkhorn with Momentum: Certified Unregularized Optimal Transport in Linear Memory
arXiv · Sep 30, 2026
How Inefficient Is Natural Gradient Descent? From Exact Optimality to \Theta ( \sqrt{ \log d } ) Divergence
arXiv · Oct 7, 2026
Tight Nonasymptotic Local Convergence of Sinkhorn-Knopp
arXiv · Sep 30, 2026