Rates of convergence for robust geometric inference
Not on the map. Why?
Abstract (arXiv)
Distances to compact sets are widely used in the field of Topological Data Analysis for inferring geometric and topological features from point clouds. In this context, the distance to a probability measure (DTM) has been introduced by Chazal et al. (2011) as a robust alternative to the distance a compact set. In practice, the DTM can be estimated by its empirical counterpart, that is the distance to the empirical measure (DTEM). In this paper we give a tight control of the deviation of the DTEM. Our analysis relies on a local analysis of empirical processes. In particular, we show that the rates of convergence of the DTEM directly depends on the regularity at zero of a particular quantile fonction which contains some local information about the geometry of the support. This quantile function is the relevant quantity to describe precisely how difficult is a geometric inference problem. Several numerical experiments illustrate the convergence of the DTEM and also confirm that our bounds are tight.
Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). First posted on arXiv 28 May 2015.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 0; 2023: 3.
4 papers.
- 2023Convergence of Message Passing Graph Neural Networks with Generic Aggregation On Large Random Graphscited by 9
- 2023Topological Interpretability for Deep-Learningcited by 2
- 2023Differentially Private Topological Data Analysiscited by 1
- 2021Statistical embedding: Beyond principal componentscited by 0
- 2023Topological Interpretability for Deep-Learning15 May 2023
- 2023Differentially Private Topological Data Analysis5 May 2023
- 2023Convergence of Message Passing Graph Neural Networks with Generic Aggregation On Large Random Graphs21 Apr 2023
- 2021Statistical embedding: Beyond principal components3 Jun 2021