arXiv Statistics ML By Youssef Mroueh

Barycentric Weak Inner-Product Gromov-Wasserstein

Read the original on arXiv Statistics ML →

The paper introduces a weak Gromov-Wasserstein (wGW) framework that compares source relations with relations between target conditional laws, focusing on inner-product relations and preserving conditional means. It defines the barycentric weak inner-product GW (wIGW) distance, proves existence of minimizers under finite second moments, and presents a ridge-regularized dual formulation leading to an iterative algorithm for finitely supported measures. Experiments on point clouds, graphs, and a PBMC multiome study demonstrate that mean-preserving target refinements can incur zero cost and improve atlas-based cell type transfer.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Statistics ML.

arXiv AI
Jun 16

Optimal Transport for Machine Learners

arXiv:2505. 06589v2 Announce Type: replace-cross Abstract: Modern machine learning repeatedly manipulates probability measures: empirical datasets, generated samples, latent distributions, class-conditional laws, particle systems, weights of wide networks and attention patterns.

By Gabriel Peyr\'e
arXiv Machine Learning
4d ago

Averaged Mirror Descent and Dual Gradient Methods: Convergent Algorithms for Entropic Gromov-Wasserstein Problems

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