Barycentric Weak Inner-Product Gromov-Wasserstein
math.OC, stat.ML
Submitted: 2026-08-25
Updated: 2026-08-25
Code: https://github.com/IBM/USD
License: http://creativecommons.org/licenses/by/4.0/
The gist: Gromov-Wasserstein (GW) compares distributions through relations within each space.
Terminology
Abstract
Gromov-Wasserstein (GW) compares distributions through relations within each space. This pointwise comparison can be too sensitive in one-to-many settings, where several target outcomes refine one source state and their mean carries the geometry of interest. We introduce a weak GW framework that compares source relations with relations between the target conditional laws induced by a coupling. For inner-product relations, we retain the conditional means m π(x)= E π[Y X=x]. The resulting barycentric weak inner-product GW (wIGW) satisfies wIGW bar 2(μ,ν)= η cxν IGW 2(μ,η). Here η cxν means that ν is a mean-preserving spread of η. Thus wIGW searches for an intermediate target geometry that can be refined into the prescribed target law without changing conditional means. Under finite second moments, minimizers exist and martingale gluing recovers an optimal coupling. With ridge regularization, moment duality gives an A - B min-max problem whose inner step is weak optimal transport with a quadratic cost parameterized by A and B; the outer problem optimizes these matrices. For finitely supported measures, we give an iterative algorithm. Under a quantitative ridge condition, the reduced problem is convex--concave, and the projected outer iteration satisfies an explicit contraction bound for inexact inner solves. Point cloud and graph feature refinement experiments illustrate how mean-preserving target refinements can have zero cost. A paired peripheral blood mononuclear cell (PBMC) multiome study evaluates atlas based cell type transfer through RNA/ATAC alignment in cell to cell and prototype to cell settings, with the prototype to cell setting representing the one-to-many case.
Sources
- Learning with Stochastic Orders
- Algorithms for Weak Optimal Transport with an Application to Economics
- MIRROR: Aligning Semantic Relations from Language to Image via Gromov--Wasserstein
- Dynamic characterization of barycentric optimal transport problems and their martingale relaxation
- Entropic Regularization of the Nested Distance
Related papers
- Lions and Muons: Optimization via Stochastic Frank-Wolfe under Heavy-Tailed Noise
- Adam-HNAG: A Convergent Reformulation of Adam with Accelerated Rate
- Incremental Learning in Mirror Flows
- Online Control via Counterfactual Tracking
- Asynchronous Replanning in Two Population Linear Quadratic Mean Field Games: Information Requirements and Stability
- Petrov-Galerkin operator inference with application to stability-encouraging identification