2022
DOI: 10.48550/arxiv.2202.08789
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Hamilton-Jacobi equations on graphs with applications to semi-supervised learning and data depth

Abstract: Shortest path graph distances are widely used in data science and machine learning, since they can approximate the underlying geodesic distance on the data manifold. However, the shortest path distance is highly sensitive to the addition of corrupted edges in the graph, either through noise or an adversarial perturbation. In this paper we study a family of Hamilton-Jacobi equations on graphs that we call the p-eikonal equation. We show that the p-eikonal equation with p = 1 is a provably robust distance-type f… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2022
2022
2022
2022

Publication Types

Select...
1

Relationship

1
0

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 53 publications
(80 reference statements)
0
1
0
Order By: Relevance
“…4 Several recent papers have successfully used variational autoencoders (VAEs) for unsupervised feature extraction in hyperspectral imagery, 5 SAR imagery, 6,7 and for constructing similarity graphs in graph-based learning. 8,9 VAE feature learning is an unsupervised method that retains the power and flexibility of deep supervised learning, making it ideal for problems with limited amounts of data.…”
Section: Introductionmentioning
confidence: 99%
“…4 Several recent papers have successfully used variational autoencoders (VAEs) for unsupervised feature extraction in hyperspectral imagery, 5 SAR imagery, 6,7 and for constructing similarity graphs in graph-based learning. 8,9 VAE feature learning is an unsupervised method that retains the power and flexibility of deep supervised learning, making it ideal for problems with limited amounts of data.…”
Section: Introductionmentioning
confidence: 99%