Manifold Interpolating Optimal-Transport Flows for Trajectory Inference

• URL: http://arxiv.org/abs/2206.14928v1
• Date: Wed, 29 Jun 2022 22:19:03 GMT
• Title: Manifold Interpolating Optimal-Transport Flows for Trajectory Inference
• Authors: Guillaume Huguet, D.S. Magruder, Oluwadamilola Fasina, Alexander Tong, Manik Kuchroo, Guy Wolf, Smita Krishnaswamy
• Abstract summary: We present a method called Manifold Interpolating Optimal-Transport Flow (MIOFlow) MIOFlow learns, continuous population dynamics from static snapshot samples taken at sporadic timepoints. We evaluate our method on simulated data with bifurcations and merges, as well as scRNA-seq data from embryoid body differentiation, and acute myeloid leukemia treatment.
• Score: 64.94020639760026
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Here, we present a method called Manifold Interpolating Optimal-Transport Flow (MIOFlow) that learns stochastic, continuous population dynamics from static snapshot samples taken at sporadic timepoints. MIOFlow combines dynamic models, manifold learning, and optimal transport by training neural ordinary differential equations (Neural ODE) to interpolate between static population snapshots as penalized by optimal transport with manifold ground distance. Further, we ensure that the flow follows the geometry by operating in the latent space of an autoencoder that we call a geodesic autoencoder (GAE). In GAE the latent space distance between points is regularized to match a novel multiscale geodesic distance on the data manifold that we define. We show that this method is superior to normalizing flows, Schr\"odinger bridges and other generative models that are designed to flow from noise to data in terms of interpolating between populations. Theoretically, we link these trajectories with dynamic optimal transport. We evaluate our method on simulated data with bifurcations and merges, as well as scRNA-seq data from embryoid body differentiation, and acute myeloid leukemia treatment.

Related papers

• Dynamical Measure Transport and Neural PDE Solvers for Sampling [77.38204731939273]
  We tackle the task of sampling from a probability density as transporting a tractable density function to the target. We employ physics-informed neural networks (PINNs) to approximate the respective partial differential equations (PDEs) solutions. PINNs allow for simulation- and discretization-free optimization and can be trained very efficiently.
  arXiv  Detail & Related papers  (2024-07-10T17:39:50Z)
• Flow Map Matching [15.520853806024943]
  Flow map matching is an algorithm that learns the two-time flow map of an underlying ordinary differential equation. We show that flow map matching leads to high-quality samples with significantly reduced sampling cost compared to diffusion or interpolant methods.
  arXiv  Detail & Related papers  (2024-06-11T17:41:26Z)
• Efficient Trajectory Inference in Wasserstein Space Using Consecutive Averaging [3.8623569699070353]
  Trajectory inference deals with the challenge of reconstructing continuous processes from such observations. We propose methods for B-spline approximation of point clouds through consecutive averaging that is instrinsic to the Wasserstein space. We rigorously evaluate our method by providing convergence guarantees and testing it on simulated cell data.
  arXiv  Detail & Related papers  (2024-05-30T04:19:20Z)
• A Geometric Perspective on Diffusion Models [57.27857591493788]
  We inspect the ODE-based sampling of a popular variance-exploding SDE. We establish a theoretical relationship between the optimal ODE-based sampling and the classic mean-shift (mode-seeking) algorithm.
  arXiv  Detail & Related papers  (2023-05-31T15:33:16Z)
• Low-Rank Hankel Tensor Completion for Traffic Speed Estimation [7.346671461427793]
  We propose a purely data-driven and model-free solution to the traffic state estimation problem. By imposing a low-rank assumption on this tensor structure, we can approximate characterize both global patterns and the unknown complex local dynamics. We conduct numerical experiments on both synthetic simulation data and real-world high-resolution data, and our results demonstrate the effectiveness and superiority of the proposed model.
  arXiv  Detail & Related papers  (2021-05-21T00:08:06Z)
• Scalable nonparametric Bayesian learning for heterogeneous and dynamic velocity fields [8.744017403796406]
  We develop a model for learning heterogeneous and dynamic patterns of velocity field data. We show the effectiveness of our techniques to the NGSIM dataset of complex multi-vehicle interactions.
  arXiv  Detail & Related papers  (2021-02-15T17:45:46Z)
• Haar Wavelet based Block Autoregressive Flows for Trajectories [129.37479472754083]
  Prediction of trajectories such as that of pedestrians is crucial to the performance of autonomous agents. We introduce a novel Haar wavelet based block autoregressive model leveraging split couplings. We illustrate the advantages of our approach for generating diverse and accurate trajectories on two real-world datasets.
  arXiv  Detail & Related papers  (2020-09-21T13:57:10Z)
• TrajectoryNet: A Dynamic Optimal Transport Network for Modeling Cellular Dynamics [74.43710101147849]
  We present TrajectoryNet, which controls the continuous paths taken between distributions to produce dynamic optimal transport. We show how this is particularly applicable for studying cellular dynamics in data from single-cell RNA sequencing (scRNA-seq) technologies.
  arXiv  Detail & Related papers  (2020-02-09T21:00:38Z)
• A Near-Optimal Gradient Flow for Learning Neural Energy-Based Models [93.24030378630175]
  We propose a novel numerical scheme to optimize the gradient flows for learning energy-based models (EBMs) We derive a second-order Wasserstein gradient flow of the global relative entropy from Fokker-Planck equation. Compared with existing schemes, Wasserstein gradient flow is a smoother and near-optimal numerical scheme to approximate real data densities.
  arXiv  Detail & Related papers  (2019-10-31T02:26:20Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.