Manifold Learning with Geodesic Minimal Spanning Trees

07/16/2003
by   Jose Costa, et al.
0

In the manifold learning problem one seeks to discover a smooth low dimensional surface, i.e., a manifold embedded in a higher dimensional linear vector space, based on a set of measured sample points on the surface. In this paper we consider the closely related problem of estimating the manifold's intrinsic dimension and the intrinsic entropy of the sample points. Specifically, we view the sample points as realizations of an unknown multivariate density supported on an unknown smooth manifold. We present a novel geometrical probability approach, called the geodesic-minimal-spanning-tree (GMST), to obtaining asymptotically consistent estimates of the manifold dimension and the Rényi α-entropy of the sample density on the manifold. The GMST approach is striking in its simplicity and does not require reconstructing the manifold or estimating the multivariate density of the samples. The GMST method simply constructs a minimal spanning tree (MST) sequence using a geodesic edge matrix and uses the overall lengths of the MSTs to simultaneously estimate manifold dimension and entropy. We illustrate the GMST approach for dimension and entropy estimation of a human face dataset.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/23/2022

Your diffusion model secretly knows the dimension of the data manifold

In this work, we propose a novel framework for estimating the dimension ...
research
07/24/2013

Cluster Trees on Manifolds

In this paper we investigate the problem of estimating the cluster tree ...
research
10/12/2021

Tangent Space and Dimension Estimation with the Wasserstein Distance

We provide explicit bounds on the number of sample points required to es...
research
03/30/2020

Learning Theory for Estimation of Animal Motion Submanifolds

This paper describes the formulation and experimental testing of a novel...
research
11/25/2020

Minimax Estimation of Distances on a Surface and Minimax Manifold Learning in the Isometric-to-Convex Setting

We start by considering the problem of estimating intrinsic distances on...
research
11/08/2019

Approximation Bounds for Interpolation and Normals on Triangulated Surfaces and Manifolds

How good is a triangulation as an approximation of a smooth curved surfa...
research
10/15/2019

Shapley Homology: Topological Analysis of Sample Influence for Neural Networks

Data samples collected for training machine learning models are typicall...

Please sign up or login with your details

Forgot password? Click here to reset