Estimating the reach of a manifold via its convexity defect function
Not on the map. Why?
Abstract (arXiv)
The reach of a submanifold is a crucial regularity parameter for manifold learning and geometric inference from point clouds. This paper relates the reach of a submanifold to its convexity defect function. Using the stability properties of convexity defect functions, along with some new bounds and the recent submanifold estimator of Aamari and Levrard [Ann. Statist. 47 177-204 (2019)], an estimator for the reach is given. A uniform expected loss bound over a C^k model is found. Lower bounds for the minimax rate for estimating the reach over these models are also provided. The estimator almost achieves these rates in the C^3 and C^4 cases, with a gap given by a logarithmic factor.
Key facts. Cited by 6 papers in the map (data through 14 Oct 2026). First posted on arXiv 22 Jan 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 0; 2023: 1; 2024: 0; 2025: 1; 2026: 3.
6 papers.
- 2025Token embeddings violate the manifold hypothesiscited by 16
- 2021Topologically penalized regression on manifoldscited by 5
- 2023Why should autoencoders work?cited by 3
- 2026Revisiting Anisotropy in Language Transformers: The Geometry of Learning Dynamicscited by 3
- 2026The Data Manifold under the Microscopecited by 0
- 2026MGPO: Manifold-Guided Diffusion Alignment for Task-Aware Dataset Distillationcited by 0
- 2026MGPO: Manifold-Guided Diffusion Alignment for Task-Aware Dataset Distillation4 Oct 2026
- 2026The Data Manifold under the Microscope14 Jun 2026
- 2026Revisiting Anisotropy in Language Transformers: The Geometry of Learning Dynamics9 Apr 2026
- 2025Token embeddings violate the manifold hypothesis1 Apr 2025
- 2023Why should autoencoders work?3 Oct 2023
- 2021Topologically penalized regression on manifolds26 Oct 2021