Intrinsic Sliced Wasserstein Distances for Comparing Collections of Probability Distributions on Manifolds and Graphs.
Raif M. RustamovSubhabrata MajumdarPublished in: ICML (2023)
Keyphrases
- probability distribution
- geometric structure
- random variables
- information retrieval
- probability measure
- graph matching
- distance measure
- manifold learning
- euclidean space
- graph databases
- data sets
- document collections
- feature space
- pointwise
- digital libraries
- graph partitioning
- graph structure
- arbitrary dimension
- random graphs
- graph mining
- graph theory
- euclidean distance
- graphical models
- low dimensional