AI Chat AI Image Generator AI Video Text to Speech

Effective Estimation of the Dimensions of a Manifold from Random Samples

09/05/2022
∙
by   Lucien Grillet, et al.
∙
0
∙

We give explicit theoretical and heuristical bounds for how big does a data set sampled from a reach-1 submanifold M of euclidian space need to be, to be able to estimate the dimension of M with 90

READ FULL TEXT

Related Research

research
∙ 09/06/2017

A Quasi-isometric Embedding Algorithm

The Whitney embedding theorem gives an upper bound on the smallest embed...
0 David W Dreisigmeyer, et al. ∙
research
∙ 06/13/2020

Sample complexity and effective dimension for regression on manifolds

We consider the theory of regression on a manifold using reproducing ker...
0 Andrew McRae, et al. ∙
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...
0 Uzu Lim, et al. ∙
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...
0 Alejandro Cholaquidis, et al. ∙
research
∙ 06/21/2022

Optimal homotopy reconstruction results à la Niyogi, Smale, and Weinberger

In this article we show that the proof of the homotopy reconstruction re...
0 Dominique Attali, et al. ∙
research
∙ 04/06/2020

Estimate of the Neural Net Dimension Using Algebraic Topology and Lie Theory

In this paper we present an approach to determine the smallest possible ...
0 Luciano Melodia, et al. ∙
research
∙ 07/13/2022

Optimal Reach Estimation and Metric Learning

We study the estimation of the reach, an ubiquitous regularity parameter...
0 Eddie Aamari, et al. ∙

Please sign up or login with your details

Forgot password? Click here to reset

Out of credits

Refill your membership to continue using DeepAI

Stripe
Paypal