4 papers
Robust Tangent Space Estimation via Laplacian Eigenvector Gradient Orthogonalization
Dhruv Kohli, Sawyer J. Robertson, Gal Mishne +1
Estimating the tangent spaces of a data manifold is a fundamental problem in geometric data analysis. The standard approach, Local Principal Component Analysis (LPCA), struggles in…
Robust Graph-Based Semi-Supervised Learning via -Conductances
Sawyer Jack Robertson, Chester Holtz, Zhengchao Wan +2
We study the problem of semi-supervised learning on graphs in the regime where data labels are scarce or possibly corrupted. We propose an approach called -conductance learning…
Resistance Distance and Linearized Optimal Transport on Graphs
Sawyer Robertson, Zhengchao Wan, Alexander Cloninger
We study the linearization of a discrete transportation distance between probability distributions on finite weighted graphs originally due to Maas (``Gradient flows of the entropy…
On a Generalization of Wasserstein Distance and the Beckmann Problem to Connection Graphs
Sawyer Robertson, Dhruv Kohli, Gal Mishne +1
We propose a model of optimal parallel transport between vector fields on a connection graph, which consists of a weighted graph along with a map from its edges to an orthogonal gr…