Coupled Optimal Transport with Landmark Constraints

• URL: http://arxiv.org/abs/2608.19783v1
• Date: Thu, 20 Aug 2026 08:28:13 GMT
• Title: Coupled Optimal Transport with Landmark Constraints
• Abstract summary: An optimal transport (OT) model seeks a map or plan between distributions by minimizing a prescribed transport cost or distortion.<n>This paper proposes a novel coupled OT framework that leverages a small number of annotated landmarks to guide the recovery of an underlying deformation.<n>The proposed framework provides a principled connection between landmark-based registration and transport-based distribution matching.
• Score: 64.98367856457412
• License: http://creativecommons.org/publicdomain/zero/1.0/
• Abstract: Existing optimal transport (OT) models primarily seek an OT map or plan between distributions by minimizing a prescribed transport cost or distortion. However, minimizing transport cost or distortion alone may fail to identify a geometrically meaningful transformation between the two distributions. To address this limitation, this paper proposes a novel coupled OT framework that leverages a small number of annotated landmarks to guide the recovery of an underlying deformation governing the distribution transformation. The coupled OT framework integrates the optimization of the transport plan and the deformation field into a unified model, where the landmark-guided deformation field and the cost-driven transport plan are coupled through a mutual-consistency constraint. As a result, the deformation is jointly determined by the annotated landmarks and cost-driven distribution matching. The proposed framework provides a principled connection between landmark-based registration and transport-based distribution matching, enabling the recovery of transport maps from sparse geometric supervision. We establish the well-definedness of the proposed model in a general variational setting and develop a finite-element-based numerical algorithm for computation whose convergence properties are systematically analyzed. The practical effectiveness of the proposed approach is verified in shape matching.

Related papers

• Geometry-Aware Dataset Condensation for Diffusion Model Training [103.45641113998839]
  We propose to reformulate real subset selection as a geometry-aware distribution alignment problem.<n>By incorporating one-sided partial optimal transport, our method selectively aligns a compact subset with the full data distribution.<n>Experiments across diffusion variants, subset sizes, image resolutions, and training rounds show that our method achieves superior fidelity and distributional coverage.
  arXiv  Detail & Related papers  (2026-06-04T08:53:58Z)
• 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)
• Supervised Distributional Reduction via Optimal Transport and Dependence Maximization [1.0499611180329804]
  We propose Supervised Distribution Reduction (SDR), an algorithm for learning target-aware representations.<n>SDR builds on the Fused Gromov-Wasserstein (FGW) objective to align the relational structure of the input distribution with a set of representative points.<n>SDR naturally induces a data-dependent, non-stationary geometry that can be leveraged for settings such as Gaussian Process (GP) modelling.
  arXiv  Detail & Related papers  (2026-05-26T19:38:20Z)
• Probabilistic Geometric Alignment via Bayesian Latent Transport for Domain-Adaptive Foundation Models [0.0]
  Adapting large-scale foundation models to new domains with limited supervision remains a fundamental challenge.<n>This paper introduces an uncertainty-aware probabilistic latent transport framework that formulates domain adaptation as a geometric alignment problem.
  arXiv  Detail & Related papers  (2026-03-24T23:35:08Z)
• Efficient Transferable Optimal Transport via Min-Sliced Transport Plans [25.845827856681492]
  We study the min-Sliced Transport Plan (min-STP) framework and investigate the transferability of optimized slicers.<n>We show that optimized slicers remain close under slight perturbations of the data distributions, enabling efficient transfer across related tasks.
  arXiv  Detail & Related papers  (2025-11-24T21:59:12Z)
• Designing Ambiguity Sets for Distributionally Robust Optimization Using Structural Causal Optimal Transport [21.387312729118364]
  We propose incorporating structural equations, which include causal graph information, to enhance ambiguity sets.<n>We show how our method overcomes the curse of dimensionality in optimal transport problems, achieving faster shrinkage with-free order.
  arXiv  Detail & Related papers  (2025-10-01T07:26:47Z)
• Aligning Latent Spaces with Flow Priors [72.24305287508474]
  This paper presents a novel framework for aligning learnable latent spaces to arbitrary target distributions by leveraging flow-based generative models as priors.<n> Notably, the proposed method eliminates computationally expensive likelihood evaluations and avoids ODE solving during optimization.
  arXiv  Detail & Related papers  (2025-06-05T16:59:53Z)
• Optimal Transport Adapter Tuning for Bridging Modality Gaps in Few-Shot Remote Sensing Scene Classification [80.83325513157637]
  Few-Shot Remote Sensing Scene Classification (FS-RSSC) presents the challenge of classifying remote sensing images with limited labeled samples.<n>We propose a novel Optimal Transport Adapter Tuning (OTAT) framework aimed at constructing an ideal Platonic representational space.
  arXiv  Detail & Related papers  (2025-03-19T07:04:24Z)
• A Computational Framework for Solving Wasserstein Lagrangian Flows [48.87656245464521]
  In general, the optimal density path is unknown, and solving these variational problems can be computationally challenging. We propose a novel deep learning based framework approaching all of these problems from a unified perspective. We showcase the versatility of the proposed framework by outperforming previous approaches for the single-cell trajectory inference.
  arXiv  Detail & Related papers  (2023-10-16T17:59:54Z)
• InfoOT: Information Maximizing Optimal Transport [58.72713603244467]
  InfoOT is an information-theoretic extension of optimal transport. It maximizes the mutual information between domains while minimizing geometric distances. This formulation yields a new projection method that is robust to outliers and generalizes to unseen samples.
  arXiv  Detail & Related papers  (2022-10-06T18:55:41Z)
• Comparing Probability Distributions with Conditional Transport [63.11403041984197]
  We propose conditional transport (CT) as a new divergence and approximate it with the amortized CT (ACT) cost. ACT amortizes the computation of its conditional transport plans and comes with unbiased sample gradients that are straightforward to compute. On a wide variety of benchmark datasets generative modeling, substituting the default statistical distance of an existing generative adversarial network with ACT is shown to consistently improve the performance.
  arXiv  Detail & Related papers  (2020-12-28T05:14:22Z)

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.