The paper studies algorithms for computing the Entropic Gromov-Wasserstein (EGW) distance, a measure of discrepancy between metric measure spaces. It introduces Averaged Mirror Descent (AMD), which averages successive Mirror Descent steps and is proven to converge for any cost function, and shows that a dual gradient method with a fixed step size also converges for arbitrary costs, even when iterations are inexact. Empirical comparisons demonstrate that both AMD and the dual gradient method succeed on cases where classical Mirror Descent fails.
By Joanna Marks, Gabriel Rioux, Riccardo Passeggeri
arXiv:2609.15437v1 Announce Type: cross
Abstract: End-to-end Supervised Graph Prediction (SGP) requires a permutation-invariant loss to compare predicted and target graphs with arbitrary node orderin...
By Federico M\'endez, Paul Krzakala, Gabriel Melo, Charlotte Laclau, R\'emi Flamary, Florence d'Alch\'e-Buc
The paper introduces a generalized score matching objective for parameter estimation on convex subsets of ρ^d, derived from Minimum Probability Flow learning. It shows that this objective is a proper local scoring rule of second order, ensuring recovery of the true density when minimized, and proves convexity and consistency for exponential family models under standard conditions. Experiments demonstrate the method’s effectiveness on constrained domains where the partition function is intractable, including a generative modeling use‑case.
By Nishanth Shetty, Saisuchith Mahajan, Chandra Sekhar Seelamantula
The paper presents a new duality formulation for the Gromov‑Wasserstein distance that applies to all finitely supported metric‑measure spaces, with and without entropic regularization. Using this duality, the authors derive sample‑complexity bounds and limit distributions for empirical GW distances, and introduce algorithms with formal convergence guarantees. These results enable a principled, efficient method for testing isomorphism between distributions on graphs with a fixed number of nodes based on samples.
By Gabriel Rioux, Joanna Marks, Riccardo Passeggeri, Ziv Goldfeld
arXiv:2412. 16457v3 Announce Type: replace-cross Abstract: In this paper, we focus on the matching recovery problem between a pair of correlated Gaussian Wigner matrices with a latent vertex correspondence.
By Zhangsong Li
arXiv:2605. 14981v2 Announce Type: replace Abstract: Gromov--Wasserstein (GW) distances compare graphs, shapes, and point clouds through internal distances, without requiring a common coordinate system.
By Ao Xu, Tieru Wu
arXiv:2608. 04234v1 Announce Type: cross 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.
By Yixuan Florence Wu, Yilun Zhu, Naichen Shi
The paper introduces HOT-POT, a method that applies optimal transport to sparse stereo matching, addressing challenges such as occlusions, motion, and camera distortions. By modeling camera‑projected points as half‑lines and using epipolar and 3D ray distances as cost functions, the authors formulate efficient assignment problems for unsupervised sparse matching. The approach is extended to hierarchical optimal transport for unsupervised object matching, with experiments demonstrating its effectiveness in facial analysis for aligning different landmarking conventions.
By Antonin Clerc, Michael Quellmalz, Moritz Piening, Philipp Flotho, Gregor Kornhardt, Gabriele Steidl
arXiv:2602. 10691v2 Announce Type: replace-cross Abstract: We study the slice-matching scheme, an efficient iterative method for distribution matching based on sliced optimal transport.
By Gauthier Thurin (ENS-PSL), Claire Boyer (LMO, IUF, CELESTE), Kimia Nadjahi (ENS-PSL)
BridgeMatch is a two‑stage generative solver that preserves the full soft matching matrix for 3D deformable registration. Stage I uses denoising diffusion to estimate a global matching matrix at a coarse resolution, then lifts it to high resolution while maintaining hierarchy and rank constraints. Stage II refines this lifted matrix via a conditional transport bridge, implemented with either a deterministic Flow Matching ODE or a stochastic Brownian‑bridge SDE, and demonstrates improved correspondence accuracy and registration performance on 4DMatch, 4DLoMatch, CAPE, and DeepDeform datasets, especially in low‑overlap scenarios.
By Qianliang Wu, Haobo Jiang, Guangwei Gao, Shuo Chen, Jin Xie, Jian Yang, Yaqing Ding
arXiv:2608.29635v1 Announce Type: new
Abstract: We study unsupervised hypergraph alignment, where the goal is to infer node correspondences between two hypergraphs using only structural information,...
By Lutz Oettershagen, Honglian Wang, Aristides Gionis
arXiv:2606. 19876v1 Announce Type: new Abstract: The score matching problem is a central training objective in modern generative modeling, diffusion models, fitting unnormalized statistical models, and inverse problems.
By Alexander Tyurin