Linear-Time Gromov Wasserstein Distances using Low Rank Couplings and Costs.
Meyer ScetbonGabriel PeyréMarco CuturiPublished in: ICML (2022)
Keyphrases
- low rank
- hausdorff distance
- linear combination
- convex optimization
- missing data
- matrix factorization
- low rank matrix
- singular value decomposition
- matrix completion
- semi supervised
- rank minimization
- high order
- matrix decomposition
- distance measure
- singular values
- high dimensional data
- pointwise
- euclidean distance
- trace norm
- matching algorithm
- low rank matrices
- distance function
- computer vision
- minimization problems
- worst case
- pattern recognition
- data sets
- affinity matrix
- feature space