

Seminar on Probability Theory and Mathematical Statistics
July 12, 2019 18:00–20:00, St. Petersburg, PDMI, room 311 (nab. r. Fontanki, 27)






Estimating the Reach of a Manifold
Eddie Aamari^{} 
Number of views: 
This page:  176 

Abstract:
Various problems within computational geometry and manifold learning encode geometric regularity through the socalled reach, a generalized convexity parameter. The reach $\tau_M$ of a submanifold $M \subset \mathbb R^D$ is the maximal offset radius on which the projection onto $M$ is well defined. The quantity $\tau_M$ renders a certain minimal scale of $M$, giving bounds on both maximum curvature and possible bottleneck structures. In this talk, we will study the geometry of the reach through an approximation theory perspective. We present new geometric results on the reach of submanifolds without boundary. An estimator $\hat{\tau}_n$ of $\tau_M$ will be described, in an idealized i.i.d. framework where tangent spaces are known. The estimator $\hat{\tau}_n$ is showed to achieve uniform expected loss bounds over a $\mathcal{C}^3$like model. Minimax upper and lower bounds are derived. We will conclude with an extension to a model in which tangent spaces are unknown.
Language: English

