Optimal reach estimation and metric learning

From MaRDI portal
Publication:6136583




Abstract: We study the estimation of the reach, an ubiquitous regularity parameter in manifold estimation and geometric data analysis. Given an i.i.d. sample over an unknown d-dimensional mathcalCk-smooth submanifold of mathbbRD, we provide optimal nonasymptotic bounds for the estimation of its reach. We build upon a formulation of the reach in terms of maximal curvature on one hand, and geodesic metric distortion on the other hand. The derived rates are adaptive, with rates depending on whether the reach of M arises from curvature or from a bottleneck structure. In the process, we derive optimal geodesic metric estimation bounds.



Cites work







This page was built for publication: Optimal reach estimation and metric learning

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6136583)