Multiscale Supervised Unbalanced Optimal Transport Flow Matching

• URL: http://arxiv.org/abs/2605.16529v1
• Date: Fri, 15 May 2026 18:26:50 GMT
• Title: Multiscale Supervised Unbalanced Optimal Transport Flow Matching
• Abstract summary: Unbalanced optimal transport (UOT) provides a principled framework for modeling single-cell transitions and birth-death dynamics.<n>We introduce Multiscale Supervised Unbalanced Optimal Transport Flow Matching (MUST-FM), a simulation-free framework that scales UOT by leveraging hierarchical data structure.
• Score: 2.421459418045937
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: Unbalanced optimal transport (UOT) provides a principled framework for modeling single-cell transitions and birth-death dynamics, but its high computational cost limits scalability to large-scale datasets. Although single-cell data often contain hierarchical annotations and known transition priors, existing UOT approximations rarely exploit this multiscale structure or prior knowledge. We introduce Multiscale Supervised Unbalanced Optimal Transport Flow Matching (MUST-FM), a simulation-free framework that scales UOT by leveraging hierarchical data structure. MUST-FM further supports an optional supervised formulation that incorporates transition priors, such as cell lineages, to guide the learning of displacement fields and mass variations. Experiments show that MUST-FM reduces computational overhead while achieving robust and biologically meaningful trajectory inference, enabling dynamic modeling of atlas-scale single-cell datasets.

Related papers

• Multi-Scale Convolution with Optimal Transport Attention Effect on Multivariate Time Series [2.161642470654705]
  Multi-Scale Convolution with Optimal Transport Attention (MSC-OT) is proposed in this paper.<n>MSC-OT combines multi-scale convolution with Sinkhorn optimal transport method based on inverted embedding.<n>Experiments on widely-used datasets, including ETT, Electricity, Traffic, Solar-Energy, and Exchange-Rate, show that MSC-OT achieves well performance in both short-term and long-term forecasting tasks.
  arXiv  Detail & Related papers  (2026-07-12T12:47:50Z)
• Unlocking Feature Learning in Gated Delta Networks at Scale [52.705562336559446]
  Training and scaling Large Language Models demand enormous computational resources.<n>We derive the scaling rules for Gated Delta Network.<n> Experiments on language-model pre-training confirm that our configurations enable stable learning-rate transfer.
  arXiv  Detail & Related papers  (2026-06-02T08:45:24Z)
• A Biconvex Formulation for Stable Transport of Mixture Models with a Unique Solution [2.476989126504885]
  Optimal transport (OT) provides a computationally framework for mapping between distributions.<n>We demonstrate the effectiveness and practicality, including image data and perturbation and real-world data.
  arXiv  Detail & Related papers  (2026-06-01T17:26:04Z)
• U-STS-LLM A Unified Spatio-Temporal Steered Large Language Model for Traffic Prediction and Imputation [6.194596351746244]
  We present U-STS-LLM, a unified framework built on a-temporal-ly steered LLM.<n>Our core innovation is a Dynamic S-Lo Concurrent Attention Bias Generator that synthesizes a persistent functional graph with transient nodal states.<n>Experiments on real-world cellular datasets demonstrate that U-STS-LLM establishes new state-of-the-art performance in both long-horizon forecasting and high-missing-rate imputation.
  arXiv  Detail & Related papers  (2026-05-12T08:16:22Z)
• MTFM: A Scalable and Alignment-free Foundation Model for Industrial Recommendation in Meituan [28.96814648857816]
  We propose MTFM (Meituan Foundation Model for Recommendation), a transformer-based framework that addresses these challenges.<n>Instead of pre-aligning inputs, MTFM transforms cross-domain data into heterogeneous tokens, capturing multi-scenario knowledge in an alignment-free manner.
  arXiv  Detail & Related papers  (2026-02-11T16:37:29Z)
• WFR-MFM: One-Step Inference for Dynamic Unbalanced Optimal Transport [9.661016195647212]
  We propose a mean-flow framework for unbalanced flow matching that summarizes both transport and mass-growth dynamics over arbitrary time intervals.<n>We further build on this framework to develop Wasserstein-Fisher-Rao Mean Flow Matching (WFR-MFM)<n>WFR-MFM achieves orders-of-magnitude faster inference than a range of existing baselines while maintaining high predictive accuracy.
  arXiv  Detail & Related papers  (2026-01-28T13:41:52Z)
• High-Fidelity Scientific Simulation Surrogates via Adaptive Implicit Neural Representations [51.90920900332569]
  Implicit neural representations (INRs) offer a compact and continuous framework for modeling spatially structured data.<n>Recent approaches address this by introducing additional features along rigid geometric structures.<n>We propose a simple yet effective alternative: Feature-Adaptive INR (FA-INR)
  arXiv  Detail & Related papers  (2025-06-07T16:45:17Z)
• Efficient Transformed Gaussian Process State-Space Models for Non-Stationary High-Dimensional Dynamical Systems [49.819436680336786]
  We propose an efficient transformed Gaussian process state-space model (ETGPSSM) for scalable and flexible modeling of high-dimensional, non-stationary dynamical systems.<n>Specifically, our ETGPSSM integrates a single shared GP with input-dependent normalizing flows, yielding an expressive implicit process prior that captures complex, non-stationary transition dynamics.<n>Our ETGPSSM outperforms existing GPSSMs and neural network-based SSMs in terms of computational efficiency and accuracy.
  arXiv  Detail & Related papers  (2025-03-24T03:19:45Z)
• Minimally Supervised Learning using Topological Projections in Self-Organizing Maps [55.31182147885694]
  We introduce a semi-supervised learning approach based on topological projections in self-organizing maps (SOMs) Our proposed method first trains SOMs on unlabeled data and then a minimal number of available labeled data points are assigned to key best matching units (BMU) Our results indicate that the proposed minimally supervised model significantly outperforms traditional regression techniques.
  arXiv  Detail & Related papers  (2024-01-12T22:51:48Z)
• Towards Long-Term Time-Series Forecasting: Feature, Pattern, and Distribution [57.71199089609161]
  Long-term time-series forecasting (LTTF) has become a pressing demand in many applications, such as wind power supply planning. Transformer models have been adopted to deliver high prediction capacity because of the high computational self-attention mechanism. We propose an efficient Transformerbased model, named Conformer, which differentiates itself from existing methods for LTTF in three aspects.
  arXiv  Detail & Related papers  (2023-01-05T13:59:29Z)
• Data-driven Control of Agent-based Models: an Equation/Variable-free Machine Learning Approach [0.0]
  We present an Equation/Variable free machine learning (EVFML) framework for the control of the collective dynamics of complex/multiscale systems. The proposed implementation consists of three steps: (A) from high-dimensional agent-based simulations, machine learning (in particular, non-linear manifold learning (DMs)) We exploit the Equation-free approach to perform numerical bifurcation analysis of the emergent dynamics. We design data-driven embedded wash-out controllers that drive the agent-based simulators to their intrinsic, imprecisely known, emergent open-loop unstable steady-states.
  arXiv  Detail & Related papers  (2022-07-12T18:16:22Z)
• 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)

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.