Non-Parametric Manifold Learning

07/16/2021
by   Dena Asta, et al.
0

We introduce an estimator for manifold distances based on graph Laplacian estimates of the Laplace-Beltrami operator. We show that the estimator is consistent for suitable choices of graph Laplacians in the literature, based on an equidistributed sample of points drawn from a smooth density bounded away from zero on an unknown compact Riemannian submanifold of Euclidean space. The estimator resembles, and in fact its convergence properties are derived from, a special case of the Kontorovic dual reformulation of Wasserstein distance known as Connes' Distance Formula.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/12/2020

Level set and density estimation on manifolds

Given an iid sample of a distribution supported on a smooth manifold M^d...
research
09/26/2013

The Bregman Variational Dual-Tree Framework

Graph-based methods provide a powerful tool set for many non-parametric ...
research
09/30/2020

Non-parametric regression for networks

Network data are becoming increasingly available, and so there is a need...
research
03/28/2023

Diffusion Maps for Group-Invariant Manifolds

In this article, we consider the manifold learning problem when the data...
research
10/23/2021

Universally consistent estimation of the reach

The reach of a set M ⊂ℝ^d, also known as condition number when M is a ma...
research
12/28/2020

Manifold learning with arbitrary norms

Manifold learning methods play a prominent role in nonlinear dimensional...
research
10/30/2020

Denoising and Interior Detection Problems

Let ℳ be a compact manifold of ℝ^d. The goal of this paper is to decide,...

Please sign up or login with your details

Forgot password? Click here to reset