Adversarial manifold estimation

DOI10.1007/s10208-022-09588-2arXiv2011.04259MaRDI QIDQ6118078

Alexander Knop, Eddie Aamari

Publication date: 23 February 2024

Published in: Foundations of Computational Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2011.04259

zbMATH Keywords

geometric inferencereachmanifold estimationstatistical queries

Mathematics Subject Classification ID

Nonparametric robustness (62G35) Computational learning theory (68Q32) Nonparametric estimation (62G05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Manifold estimation and singular deconvolution under Hausdorff loss
• Tight minimax rates for manifold estimation under Hausdorff loss
• Halfspace matrices
• Learning with restricted focus of attention
• Global inversion of functions: An introduction
• A plug-in approach to support estimation
• Stability and minimax optimality of tangential Delaunay complexes for manifold reconstruction
• Nonasymptotic rates for manifold, tangent space and curvature estimation
• Minimax adaptive estimation in manifold inference
• Estimating the reach of a manifold via its convexity defect function
• The reach, metric distortion, geodesic convexity and the variation of tangent spaces
• Estimating the reach of a manifold
• Manifold reconstruction using tangential Delaunay complexes
• Finding the homology of submanifolds with high confidence from random samples
• Weakly learning DNF and characterizing statistical query learning using Fourier analysis
• Randomized Response: A Survey Technique for Eliminating Evasive Answer Bias
• What Can We Learn Privately?
• Efficient noise-tolerant learning from statistical queries
• Curvature Measures
• Curve and Surface Reconstruction
• A theory of the learnable
• Statistical Query Algorithms for Mean Vector Estimation and Stochastic Convex Optimization
• On the Complexity of Random Satisfiability Problems with Planted Solutions
• Statistical Algorithms and a Lower Bound for Detecting Planted Cliques
• A useful variant of the Davis–Kahan theorem for statisticians
• Approximate resilience, monotonicity, and the complexity of agnostic learning
• Minimax Manifold Estimation
• Nonlinear Dimensionality Reduction
• Theory of Cryptography
• A simple polynomial-time rescaling algorithm for solving linear programs
• The elements of statistical learning. Data mining, inference, and prediction
• Statistical query complexity of manifold estimation

This page was built for publication: Adversarial manifold estimation