Gromov-Wasserstein distances: entropic regularization, duality and sample complexity
From MaRDI portal
Publication:6621540
DOI10.1214/24-aos2406MaRDI QIDQ6621540
Zhengxin Zhang, Bharath Sriperumbudur, Unnamed Author, Ziv Goldfeld
Publication date: 18 October 2024
Published in: The Annals of Statistics (Search for Journal in Brave)
strong dualitysample complexityGromov-Wasserstein distanceentropic regularizationempirical convergence
Cites Work
- Unnamed Item
- On the relation between optimal transport and Schrödinger bridges: a stochastic control viewpoint
- Constructive quantization: approximation by empirical measures
- On the rate of convergence in Wasserstein distance of the empirical measure
- Gromov-Wasserstein distances and the metric approach to object matching
- About the analogy between optimal transport and minimal entropy
- On concepts of directional differentiability
- A computational fluid mechanics solution to the Monge-Kantorovich mass transfer problem
- A formula for the time derivative of the entropic cost and applications
- Entropic optimal transport: convergence of potentials
- Central limit theorems for entropy-regularized optimal transport on finite spaces and statistical applications
- Empirical optimal transport on countable metric spaces: distributional limits and statistical applications
- Benamou-Brenier and duality formulas for the entropic cost on \(\mathsf{RCD}^*(K,N)\) spaces
- Sharp asymptotic and finite-sample rates of convergence of empirical measures in Wasserstein distance
- Optimal transport for applied mathematicians. Calculus of variations, PDEs, and modeling
- Central limit theorems for empirical transportation cost in general dimension
- On the mean speed of convergence of empirical and occupation measures in Wasserstein distance
- A generalized solution of the orthogonal Procrustes problem
- Covering Numbers for Convex Functions
- Mathematical Foundations of Infinite-Dimensional Statistical Models
- Inference for Empirical Wasserstein Distances on Finite Spaces
- Empirical Regularized Optimal Transport: Statistical Theory and Applications
- Gromov–Wasserstein distances between Gaussian distributions
- The Speed of Mean Glivenko-Cantelli Convergence
- Convergence of Entropic Schemes for Optimal Transport and Gradient Flows
- Optimal Transport
- The Space of Spaces: Curvature Bounds and Gradient Flows on the Space of Metric Measure Spaces
- On Assignment Problems Related to Gromov–Wasserstein Distances on the Real Line
- Sharp convergence rates for empirical optimal transport with smooth costs
- An Improved Central Limit Theorem and Fast Convergence Rates for Entropic Transportation Costs
- Weak convergence and empirical processes. With applications to statistics
- Limit theorems for entropic optimal transport maps and Sinkhorn divergence
- Limit distribution theory for smooth \(p\)-Wasserstein distances
- Empirical optimal transport between different measures adapts to lower complexity
This page was built for publication: Gromov-Wasserstein distances: entropic regularization, duality and sample complexity