mlsanityData to 14 Oct 2026

Linearized Optimal Transport for Analysis of High-Dimensional Point-Cloud and Single-Cell Data

arXiv 2510.22033 ↗First posted 24 Oct 2025cs.LG q-bio.QM stat.MLcited by 1

Not on the map. Why?

Abstract (arXiv)

Single-cell technologies generate high-dimensional point clouds of cells, enabling detailed characterization of complex patient states and treatment responses. Yet each patient is represented by an irregular point cloud rather than a simple vector, making it difficult to directly quantify and compare biological differences between individuals. Nonlinear methods such as kernels and neural networks achieve predictive accuracy but act as black boxes, offering little biological interpretability. To address these limitations, we adapt the Linear Optimal Transport (LOT) framework to this setting, embedding irregular point clouds into a fixed-dimensional Euclidean space while preserving distributional structure. This embedding provides a principled linear representation that preserves optimal transport geometry while enabling downstream analysis. It also forms a registration between any two patients, enabling direct comparison of their cellular distributions. Within this space, LOT enables: (i) accurate and interpretable classification of COVID-19 patient states, where classifier weights map back to specific markers and spatial regions driving predictions; and (ii) synthetic data generation for patient-derived organoids, exploiting the linearity of the LOT embedding. LOT barycenters yield averaged cellular profiles representing combined conditions or samples, supporting drug interaction testing. Together, these results establish LOT as a unified framework that bridges predictive performance, interpretability, and generative modeling. By transforming heterogeneous point clouds into structured embeddings directly traceable to the original data, LOT opens new opportunities for understanding immune variation and treatment effects in high-dimensional biological systems.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 8 of its 14 references that are in the map. First posted on arXiv 24 Oct 2025.

Builds on

8 of 14 references.

References · 8

  1. 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,316
  2. 2020Linear Optimal Transport Embedding: Provable Wasserstein classification for certain rigid transformations and perturbationscited by 37
  3. 2020Linearized Optimal Transport for Collider Eventscited by 16
  4. 2022Supervised learning of sheared distributions using linearized optimal transportcited by 14
  5. 2023Linearized Wasserstein dimensionality reduction with approximation guaranteescited by 12
  6. 2022Geodesic Sinkhorn for Fast and Accurate Optimal Transport on Manifoldscited by 10
  7. 2024Linear optimal transport subspaces for point set classificationcited by 1
  8. 2025Linearized Optimal Transport pyLOT Library: A Toolkit for Machine Learning on Point Cloudscited by 1

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 1.

1 paper.