Modeling Temporal scRNA-seq Data with Latent Gaussian Process and Optimal Transport
Pith reviewed 2026-05-21 05:51 UTC · model grok-4.3
The pith
A latent heteroscedastic Gaussian process with optimal transport alignment can infer cell trajectories from static single-cell RNA snapshots.
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
Core claim
We propose a generative framework that models population trends using a latent heteroscedastic Gaussian process approximated by Hilbert space methods. To address the absence of genuine cell trajectories, we leverage an optimal transport objective that aligns generated and observed population distributions. Our method explicitly captures biological heterogeneity by incorporating cell-specific latent time and cell type conditioning to disentangle temporal asynchrony and trajectories to different cell types.
What carries the argument
latent heteroscedastic Gaussian process approximated by Hilbert space methods, combined with an optimal transport objective that aligns generated and observed population distributions
If this is right
- The framework achieves state-of-the-art performance on complex interpolation and extrapolation benchmarks for temporal scRNA-seq data.
- A gradient-based strategy becomes available for inferring how perturbations shift cell trajectories.
- Cell-specific latent times and cell-type conditioning disentangle temporal asynchrony from branching trajectories to distinct cell fates.
- Biological variability is modeled explicitly through the heteroscedastic Gaussian process and per-cell parameters.
Where Pith is reading between the lines
- If the optimal transport alignment recovers trajectories reliably, the approach could be used to simulate long-term cell state changes in tissues where live tracking is impossible.
- The gradient-based perturbation method could be tested on datasets with measured drug responses to see whether predicted shifts match observed experimental outcomes.
- Integrating the model with multi-omics measurements might yield joint trajectories that link gene expression changes to other molecular layers.
- Similar distribution-alignment ideas might be combined with other generative models to improve handling of sparse or noisy single-cell measurements.
Load-bearing premise
Aligning generated and observed population distributions via optimal transport is sufficient to recover meaningful individual cell trajectories and separate timing differences from path differences when no true trajectories are available.
What would settle it
On a dataset that pairs scRNA-seq snapshots with ground-truth cell paths obtained from continuous time-lapse imaging, compare the model's inferred cell-specific trajectories and latent times against the recorded paths and check whether the alignment error remains low.
Figures
read the original abstract
Single-cell RNA sequencing provides insights into gene expression at single-cell resolution, yet inferring temporal processes from these static snapshot measurements remains a fundamental challenge. Current approaches utilizing neural differential equations and flows are sensitive to overfitting and lack careful considerations of biological variability. In this work, we propose a generative framework that models population trends using a latent heteroscedastic Gaussian process (GP) approximated by Hilbert space methods. To address the absence of genuine cell trajectories, we leverage an optimal transport (OT) objective that aligns generated and observed population distributions. Our method explicitly captures biological heterogeneity by incorporating cell-specific latent time and cell type conditioning to disentangle temporal asynchrony and trajectories to different cell types. We demonstrate state-of-the-art performance on complex interpolation and extrapolation benchmarks and introduce a novel gradient-based strategy for inferring perturbation trajectories.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper proposes a generative framework for inferring temporal dynamics from static scRNA-seq snapshots. It models population-level trends via a latent heteroscedastic Gaussian process approximated by Hilbert-space methods, uses an optimal transport objective to align generated and observed marginal distributions in the absence of ground-truth trajectories, and introduces cell-specific latent time variables together with cell-type conditioning to disentangle asynchrony and differentiation paths. The authors report state-of-the-art performance on interpolation and extrapolation benchmarks and present a gradient-based procedure for inferring perturbation trajectories.
Significance. If the identifiability concerns can be resolved, the combination of a scalable GP prior with OT-based distribution matching would constitute a useful advance over neural differential equations and flow-based methods for single-cell trajectory inference. The explicit handling of biological heterogeneity via cell-specific latent times and the Hilbert-space approximation for computational efficiency are positive features that could improve robustness to variability in real datasets.
major comments (2)
- [Abstract] Abstract (paragraph on OT objective and cell-specific latent time): The assertion that an OT objective aligning generated and observed population distributions, together with cell-specific latent time and cell-type conditioning, suffices to recover meaningful individual trajectories and disentangle temporal asynchrony is not supported by the given description. OT yields a coupling between marginals without guaranteeing a unique or biologically faithful per-cell mapping; multiple latent-time assignments can produce identical population distributions while implying divergent paths. The heteroscedastic GP prior and Hilbert-space approximation do not, by themselves, resolve this non-identifiability in the absence of ground-truth trajectories or additional constraints on the latent-time posterior.
- [Abstract] Abstract (benchmark claims): The statement of state-of-the-art performance on complex interpolation and extrapolation benchmarks is presented without reference to specific quantitative metrics, baseline implementations, or error-bar reporting. Because the optimization and regularization details of the OT objective are not described, it is impossible to determine whether the reported gains follow from the proposed model or from implementation choices.
minor comments (2)
- [Abstract] The abstract would benefit from a concise statement of how the Hilbert-space approximation is applied to the heteroscedastic GP (e.g., which kernel and which basis functions are used).
- [Abstract] Notation for the cell-specific latent time variable should be introduced explicitly when first mentioned to avoid ambiguity with population-level time.
Simulated Author's Rebuttal
We thank the referee for their constructive and insightful comments on our manuscript. These have highlighted important areas for clarification regarding identifiability and the presentation of empirical results. We address each major comment point by point below, indicating the revisions we will make to strengthen the paper.
read point-by-point responses
-
Referee: [Abstract] Abstract (paragraph on OT objective and cell-specific latent time): The assertion that an OT objective aligning generated and observed population distributions, together with cell-specific latent time and cell-type conditioning, suffices to recover meaningful individual trajectories and disentangle temporal asynchrony is not supported by the given description. OT yields a coupling between marginals without guaranteeing a unique or biologically faithful per-cell mapping; multiple latent-time assignments can produce identical population distributions while implying divergent paths. The heteroscedastic GP prior and Hilbert-space approximation do not, by themselves, resolve this non-identifiability in the absence of ground-truth trajectories or additional constraints on the latent-time posterior.
Authors: We agree that identifiability of individual trajectories from population-level marginals is a fundamental challenge and that OT couplings alone are not unique. Our framework addresses this through the combination of a structured latent heteroscedastic GP prior (imposing temporal smoothness and heteroscedasticity on dynamics), cell-type conditioning (constraining differentiation paths), and joint inference of cell-specific latent times under the OT objective. These elements together regularize the solution space beyond what marginal matching provides. We will revise the abstract to moderate the claim, stating that the model recovers plausible trajectories consistent with the observed distributions under these priors. We will also add a new subsection to the Methods section providing a discussion of identifiability assumptions, including conditions (e.g., sufficient cell-type diversity and monotonic latent-time progression) under which the posterior over latent times is better constrained, along with supporting simulation experiments that compare inferred trajectories against ground-truth where available. revision: yes
-
Referee: [Abstract] Abstract (benchmark claims): The statement of state-of-the-art performance on complex interpolation and extrapolation benchmarks is presented without reference to specific quantitative metrics, baseline implementations, or error-bar reporting. Because the optimization and regularization details of the OT objective are not described, it is impossible to determine whether the reported gains follow from the proposed model or from implementation choices.
Authors: We accept that the abstract's brevity omits necessary specifics for evaluating the benchmark claims. The full manuscript reports these details in Section 4 (Experiments), including tables with mean squared error for interpolation tasks and Wasserstein-2 distance for extrapolation, compared to baselines such as Neural ODEs, scVelo, and TrajectoryNet, with standard deviations computed over five random seeds. The OT objective employs entropic regularization (with parameter ε = 0.1) and is solved via the Sinkhorn algorithm, as specified in Section 3.3. In the revised manuscript we will update the abstract to briefly reference the key metrics and direct readers to the relevant tables and sections for full quantitative results, baseline implementations, and error bars. revision: yes
Circularity Check
No circularity: OT objective and GP prior form standard generative training loop
full rationale
The paper defines a generative model with a latent heteroscedastic GP (Hilbert-space approximated) whose parameters are optimized via an OT loss that matches generated and observed population marginals, plus cell-specific latent time and cell-type conditioning. This is a conventional variational or adversarial-style training setup in which the OT term serves as an explicit training objective rather than a derived prediction that reduces to the fitted inputs by construction. No equations or sections in the provided text show a self-definitional loop, a fitted parameter renamed as an out-of-sample prediction, or a load-bearing self-citation whose uniqueness theorem is invoked to close the argument. Performance claims rest on interpolation/extrapolation benchmarks, which constitute external evaluation rather than internal re-derivation of the same quantities.
Axiom & Free-Parameter Ledger
axioms (2)
- domain assumption Hilbert-space approximation accurately represents the latent heteroscedastic Gaussian process for the observed data scales
- domain assumption Optimal transport distance between generated and observed population distributions recovers biologically meaningful alignment
invented entities (1)
-
cell-specific latent time variable
no independent evidence
Reference graph
Works this paper leans on
-
[1]
Probabilistic machine learning: Advanced topics , author=. 2023 , publisher=
work page 2023
-
[2]
Advances in neural information processing systems , volume=
Sinkhorn distances: Lightspeed computation of optimal transport , author=. Advances in neural information processing systems , volume=
-
[3]
Computational optimal transport: With applications to data science , author=. Foundations and Trends. 2019 , publisher=
work page 2019
- [4]
-
[5]
The annals of mathematical statistics , volume=
A relationship between arbitrary positive matrices and doubly stochastic matrices , author=. The annals of mathematical statistics , volume=. 1964 , publisher=
work page 1964
-
[6]
Pacific Journal of Mathematics , volume=
Concerning nonnegative matrices and doubly stochastic matrices , author=. Pacific Journal of Mathematics , volume=. 1967 , publisher=
work page 1967
-
[7]
Gaussian processes for machine learning , author=. 2006 , publisher=
work page 2006
-
[8]
Random-effects models for longitudinal data , author=. Biometrics , pages=. 1982 , publisher=
work page 1982
-
[9]
Artificial intelligence and statistics , pages=
Variational learning of inducing variables in sparse Gaussian processes , author=. Artificial intelligence and statistics , pages=. 2009 , organization=
work page 2009
-
[10]
Statistics and Computing , volume=
Hilbert space methods for reduced-rank Gaussian process regression , author=. Statistics and Computing , volume=. 2020 , publisher=
work page 2020
-
[11]
lgpr: an interpretable non-parametric method for inferring covariate effects from longitudinal data , author=. Bioinformatics , volume=. 2021 , publisher=
work page 2021
-
[12]
A mixed-categorical correlation kernel for Gaussian process , author=. Neurocomputing , volume=. 2023 , publisher=
work page 2023
-
[13]
Dealing with categorical and integer-valued variables in bayesian optimization with gaussian processes , author=. Neurocomputing , volume=. 2020 , publisher=
work page 2020
-
[14]
Theory of linear operators in Hilbert space , author=. 2013 , publisher=
work page 2013
-
[15]
Stochastic equations in infinite dimensions , author=. 2014 , publisher=
work page 2014
-
[16]
Statistics and Computing , volume=
Practical Hilbert space approximate Bayesian Gaussian processes for probabilistic programming , author=. Statistics and Computing , volume=. 2023 , publisher=
work page 2023
-
[17]
Deep generative modeling for single-cell transcriptomics , author=. Nature methods , volume=. 2018 , publisher=
work page 2018
-
[18]
scVAE: variational auto-encoders for single-cell gene expression data , author=. Bioinformatics , volume=. 2020 , publisher=
work page 2020
-
[19]
International Conference on Learning Representations , year=
Wasserstein Auto-Encoders , author=. International Conference on Learning Representations , year=
-
[20]
Kernels for vector-valued functions: A review , author=. Foundations and Trends. 2012 , publisher=
work page 2012
-
[21]
2nd International Conference on Learning Representations , year=
Auto-Encoding Variational Bayes , author=. 2nd International Conference on Learning Representations , year=
-
[22]
Advances in neural information processing systems , volume=
Gaussian process prior variational autoencoders , author=. Advances in neural information processing systems , volume=
-
[23]
International conference on artificial intelligence and statistics , pages=
Gp-vae: Deep probabilistic time series imputation , author=. International conference on artificial intelligence and statistics , pages=. 2020 , organization=
work page 2020
-
[24]
International Conference on Artificial Intelligence and Statistics , pages=
Scalable gaussian process variational autoencoders , author=. International Conference on Artificial Intelligence and Statistics , pages=. 2021 , organization=
work page 2021
-
[25]
International Conference on Artificial Intelligence and Statistics , pages=
Longitudinal variational autoencoder , author=. International Conference on Artificial Intelligence and Statistics , pages=. 2021 , organization=
work page 2021
-
[26]
International Conference on Machine Learning , pages=
Fully bayesian autoencoders with latent sparse gaussian processes , author=. International Conference on Machine Learning , pages=. 2023 , organization=
work page 2023
-
[27]
Forty-second International Conference on Machine Learning , year =
Neighbour-Driven Gaussian Process Variational Autoencoders for Scalable Structured Latent Modelling , author=. Forty-second International Conference on Machine Learning , year =
-
[28]
Proceedings of the 42nd International Conference on Machine Learning , pages =
Bal. Proceedings of the 42nd International Conference on Machine Learning , pages =. 2025 , publisher =
work page 2025
-
[29]
Single-cell RNA-seq and computational analysis using temporal mixture modeling resolves TH1/TFH fate bifurcation in malaria , author=. Science immunology , volume=. 2017 , publisher=
work page 2017
-
[30]
Pseudotime estimation: deconfounding single cell time series , author=. Bioinformatics , volume=. 2016 , publisher=
work page 2016
-
[31]
the Journal of machine Learning research , volume=
Stochastic variational inference , author=. the Journal of machine Learning research , volume=. 2013 , publisher=
work page 2013
-
[32]
What do single-cell models already know about perturbations? , author=. Genes , volume=. 2025 , publisher=
work page 2025
-
[33]
The Thirty-ninth Annual Conference on Neural Information Processing Systems , year=
Joint Velocity-Growth Flow Matching for Single-Cell Dynamics Modeling , author=. The Thirty-ninth Annual Conference on Neural Information Processing Systems , year=
-
[34]
scNODE: generative model for temporal single cell transcriptomic data prediction , author=. Bioinformatics , volume=. 2024 , publisher=
work page 2024
-
[35]
Advances in neural information processing systems , volume=
Manifold interpolating optimal-transport flows for trajectory inference , author=. Advances in neural information processing systems , volume=
-
[36]
A physics-informed neural SDE network for learning cellular dynamics from time-series scRNA-seq data , author=. Bioinformatics , volume=. 2024 , publisher=
work page 2024
-
[37]
Nature communications , volume=
Generative modeling of single-cell time series with PRESCIENT enables prediction of cell trajectories with interventions , author=. Nature communications , volume=. 2021 , publisher=
work page 2021
-
[38]
International conference on machine learning , pages=
Trajectorynet: A dynamic optimal transport network for modeling cellular dynamics , author=. International conference on machine learning , pages=. 2020 , organization=
work page 2020
-
[39]
The Eleventh International Conference on Learning Representations , year=
Flow Matching for Generative Modeling , author=. The Eleventh International Conference on Learning Representations , year=
-
[40]
Transactions on Machine Learning Research , issn=
Improving and generalizing flow-based generative models with minibatch optimal transport , author=. Transactions on Machine Learning Research , issn=. 2024 , url=
work page 2024
-
[41]
Tong, Alexander Y. and Malkin, Nikolay and Fatras, Kilian and Atanackovic, Lazar and Zhang, Yanlei and Huguet, Guillaume and Wolf, Guy and Bengio, Yoshua , booktitle =. Simulation-Free. 2024 , editor =
work page 2024
-
[42]
ICML Workshop on New Frontiers in Learning, Control, and Dynamical Systems , year=
Unbalanced Diffusion Schr\"odinger Bridge , author=. ICML Workshop on New Frontiers in Learning, Control, and Dynamical Systems , year=
-
[43]
Nature Machine Intelligence , volume=
Reconstructing growth and dynamic trajectories from single-cell transcriptomics data , author=. Nature Machine Intelligence , volume=. 2024 , publisher=
work page 2024
-
[44]
The Thirteenth International Conference on Learning Representations , year=
Learning stochastic dynamics from snapshots through regularized unbalanced optimal transport , author=. The Thirteenth International Conference on Learning Representations , year=
-
[45]
Single-cell reconstruction of developmental trajectories during zebrafish embryogenesis , author=. Science , volume=. 2018 , publisher=
work page 2018
-
[46]
The continuum of Drosophila embryonic development at single-cell resolution , author=. Science , volume=. 2022 , publisher=
work page 2022
-
[47]
Optimal-transport analysis of single-cell gene expression identifies developmental trajectories in reprogramming , author=. Cell , volume=. 2019 , publisher=
work page 2019
-
[48]
SCANPY: large-scale single-cell gene expression data analysis , author=. Genome biology , volume=. 2018 , publisher=
work page 2018
-
[49]
Integrated analysis of multimodal single-cell data , author=. Cell , volume=. 2021 , publisher=
work page 2021
-
[50]
International Conference on Medical Image Computing and Computer-Assisted Intervention , pages=
Fast and scalable optimal transport for brain tractograms , author=. International Conference on Medical Image Computing and Computer-Assisted Intervention , pages=. 2019 , organization=
work page 2019
-
[51]
Journal of Machine Learning Research , volume=
Pot: Python optimal transport , author=. Journal of Machine Learning Research , volume=
-
[52]
Advances in neural information processing systems , volume=
Pytorch: An imperative style, high-performance deep learning library , author=. Advances in neural information processing systems , volume=
-
[53]
Adam: A Method for Stochastic Optimization
Adam: A method for stochastic optimization , author=. arXiv preprint arXiv:1412.6980 , year=
work page internal anchor Pith review Pith/arXiv arXiv
-
[54]
Decoupled Weight Decay Regularization
Decoupled weight decay regularization , author=. arXiv preprint arXiv:1711.05101 , year=
work page internal anchor Pith review Pith/arXiv arXiv
-
[55]
Molecular identification of spadetail: regulation of zebrafish trunk and tail mesoderm formation by T-box genes , author=. Development , volume=. 1998 , publisher=
work page 1998
-
[56]
Molecular brain research , volume=
Zygotic expression of the zebrafish Sox-19, an HMG box-containing gene, suggests an involvement in central nervous system development , author=. Molecular brain research , volume=. 1996 , publisher=
work page 1996
-
[57]
Proceedings of the National Academy of Sciences , volume=
Fundamental limits on dynamic inference from single-cell snapshots , author=. Proceedings of the National Academy of Sciences , volume=. 2018 , publisher=
work page 2018
-
[58]
The Twelfth International Conference on Learning Representations , year=
Stable Neural Stochastic Differential Equations in Analyzing Irregular Time Series Data , author=. The Twelfth International Conference on Learning Representations , year=
-
[59]
Peter Z. G Qian and Huaiqing Wu and C. F. Jeff Wu , title =. Technometrics , volume =. 2008 , publisher =
work page 2008
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.