research
∙
10/28/2020
Intrinsic Sliced Wasserstein Distances for Comparing Collections of Probability Distributions on Manifolds and Graphs
Collections of probability distributions arise in a variety of statistic...
share
research
∙
05/31/2019
Kernel Mean Embedding Based Hypothesis Tests for Comparing Spatial Point Patterns
This paper introduces an approach for detecting differences in the first...
research
∙
01/10/2019
Closed-form Expressions for Maximum Mean Discrepancy with Applications to Wasserstein Auto-Encoders
The Maximum Mean Discrepancy (MMD) has found numerous applications in st...
research
∙
04/10/2018
Graph Matching with Anchor Nodes: A Learning Approach
In this paper, we consider the weighted graph matching problem with part...
research
∙
09/14/2017
Interpretable Graph-Based Semi-Supervised Learning via Flows
In this paper, we consider the interpretability of the foundational Lapl...
research
∙
10/10/2011