Statistical query complexity of manifold estimation

DOI10.1145/3406325.3451135MaRDI QIDQ6065175zbMATH OpenOpenAlexFDO

Authors Eddie Aamari, Alexander Knop

Publication date 14 November 2023

Published in Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/3406325.3451135

zbMATH Keywords

geometric inferencemanifold estimationreachstatistical queries

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cited in

(6)

• Manifold reconstruction and denoising from scattered data in high dimension
• The reach of subsets of manifolds
• Adversarial manifold estimation
• The medial axis of any closed bounded set is Lipschitz stable with respect to the Hausdorff distance under ambient diffeomorphisms
• Tight bounds for the learning of homotopy à la Niyogi, Smale, and Weinberger for subsets of Euclidean spaces and of Riemannian manifolds
• The medial axis of any closed bounded set is locally Lipschitz stable with respect to the Hausdorff distance under ambient diffeomorphisms

This page was built for publication: Statistical query complexity of manifold estimation

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