Fast gradient computation for Gromov-Wasserstein distance
From MaRDI portal
Cites work
- A course in metric geometry
- A review on distance based time series classification
- Algorithms for convex optimization
- Assignment Problems and the Location of Economic Activities
- Data clustering. Algorithms and applications
- Different approaches to forecast interval time series: a comparison in finance
- Efficient Approximation of Gromov-Wasserstein Distance Using Importance Sparsification
- Fast Sinkhorn. I: An \(O(N)\) algorithm for the Wasserstein-1 metric
- Fast sinkhorn. II: Collinear triangular matrix and linear time accurate computation of optimal transport
- Gromov-Wasserstein distances and the metric approach to object matching
- scientific article; zbMATH DE number 3296905 (Why is no real title available?)
- Iterative Bregman projections for regularized transportation problems
- Machine learning. A probabilistic perspective
- Metric structures for Riemannian and non-Riemannian spaces. Transl. from the French by Sean Michael Bates. With appendices by M. Katz, P. Pansu, and S. Semmes. Edited by J. LaFontaine and P. Pansu
- Mirror descent and nonlinear projected subgradient methods for convex optimization.
- Optimal transport for applied mathematicians. Calculus of variations, PDEs, and modeling
- Sampled Gromov Wasserstein
This page was built for publication: Fast gradient computation for Gromov-Wasserstein distance
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6955708)
