Skip to content
Preprint

Multimodal Alignment Through Joint Kernel Entropic Gromov--Wasserstein Optimal Transport

Aug 2026 · 0 citations · 61 references
Mathematics Computer Science

TL;DR

A structure-preserving alignment framework, joint kernel entropic Gromov--Wasserstein Optimal Transport (JK-EGW), which maps multiple modalities into a common latent space by minimizing a quadratic optimal transport objective and achieves improved multimodal retrieval performance compared to existing alignment baselines is proposed.

Abstract

We study the problem of aligning data from multiple modalities into a shared representation space, focusing on settings where strong pretrained unimodal encoders are available but cross-modal paired data are scarce. We propose a structure-preserving alignment framework, joint kernel entropic Gromov--Wasserstein Optimal Transport (JK-EGW), which maps multiple modalities into a common latent space by minimizing a quadratic optimal transport objective. JK-EGW leverages fine-grained similarity relationships within and across modalities to construct a global affinity kernel instead of relying on raw feature-space distances. Our framework naturally provides explicit control over the geometry and distribution of the latent embedding. On the theory side, we establish parametric sample complexity rate of $n^{-1/2}$, matching the corresponding rates for standard, entropic and Gromov--Wasserstein optimal transport. On the algorithmic side, we derive a scalable alternating procedure to solve JK-EGW with entropic optimal transport (EOT) updates through a low-rank kernel approximation and a variational lifting. This lifting scheme effectively relieves the burden of a quadratic objective, and allowing us to take the advantage of existing EOT solvers. Empirically, we focus on post-hoc alignment of embeddings from pretrained encoders in data-scarce regimes, and show that our proposed method achieves improved multimodal retrieval performance compared to existing alignment baselines.

View source

Similar papers

Open access 2026

Progressive Multi-Objective Optimization for Improved t-SNE Embeddings

A progressive multi-objective optimization framework is proposed that enhances t-SNE by integrating complementary loss functions, including a ranking-aware divergence (KLmax) and a Wasserstein-based term for global alignment.

S. Belhaouari, Skander Bensegueni, Lyes Fennour et al. · 0 citations
#machine learning Preprint Aug 2026

Unsupervised Multi-Scale Gromov-Wasserstein Hypergraph Alignment

This work introduces FALCON (Filtration-based hypergrAph aLignment via Cross-scale Optimal traNsport), an unsupervised optimal-transport framework for hypergraph alignment that constructs a filtration-induced sequence of clique-based co-occurrence dissimilarity matrices and jointly aligns all levels through one shared...

Lutz Oettershagen, Honglian Wang, A. Gionis · 0 citations
Preprint Aug 2026

Barycentric Fused Gromov-Wasserstein Balancing for Causal Inference under Multiple Treatments

Estimating heterogeneous single and interaction treatment effects from observational data under multiple simultaneous treatments is crucial for decision-making. To mitigate estimation variance, previous studies balance representation distributions between every pair of treatment patterns. However, such pairwise balanci...

Yuki Murakami, Takumi Hattori, Kohsuke Kubota · 0 citations
Preprint Aug 2026

TASSO: TAsk-Specific Subspace Optimization for Continual Learning of Vision-Language Models

TASSO, a new paradigm that efficiently preserves the latent space geometry while ensuring network plasticity, is introduced with two complementary techniques: subspace learning and geometry-aware knowledge distillation.

Chang-Ming Sun, Francesco Barbato, Matteo Caligiuri et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.