Manifold Fitting under Unbounded Noise
Not on the map. Why?
Abstract (arXiv)
There has been an emerging trend in non-Euclidean statistical analysis of aiming to recover a low dimensional structure, namely a manifold, underlying the high dimensional data. Recovering the manifold requires the noise to be of certain concentration. Existing methods address this problem by constructing an approximated manifold based on the tangent space estimation at each sample point. Although theoretical convergence for these methods is guaranteed, either the samples are noiseless or the noise is bounded. However, if the noise is unbounded, which is a common scenario, the tangent space estimation at the noisy samples will be blurred. Fitting a manifold from the blurred tangent space might increase the inaccuracy. In this paper, we introduce a new manifold-fitting method, by which the output manifold is constructed by directly estimating the tangent spaces at the projected points on the underlying manifold, rather than at the sample points, to decrease the error caused by the noise. Assuming the noise is unbounded, our new method provides theoretical convergence in high probability, in terms of the upper bound of the distance between the estimated and underlying manifold. The smoothness of the estimated manifold is also evaluated by bounding the supremum of twice difference above. Numerical simulations are provided to validate our theoretical findings and demonstrate the advantages of our method over other relevant manifold fitting methods. Finally, our method is applied to real data examples.
Key facts. Cited by 9 papers in the map (data through 7 Oct 2026). First posted on arXiv 23 Sep 2019.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2023: 1; 2024: 3; 2025: 2; 2026: 3.
9 papers.
- 2024Towards understanding how attention mechanism works in deep learningcited by 2
- 2024Design a Metric Robust to Complicated High Dimensional Noise for Efficient Manifold Denoisingcited by 1
- 2024Adaptive Bayesian Multivariate Spline Knot Inference with Prior Specifications on Model Complexitycited by 1
- 2023Ridge Estimation with Nonlinear Transformationscited by 0
- 2025Enhanced High-Dimensional Data Visualization through Adaptive Multi-Scale Manifold Embeddingcited by 0
- 2025Local Averaging Accurately Distills Manifold Structure From Noisy Datacited by 0
- 2026The Data Manifold under the Microscopecited by 0
- 2026RODR: Riemannian Orthogonally Decoupled Regularization for Disentangled Manifold Representationcited by 0
- 2026Stable Density Ridges: Consistency and Convergence of Subspace Constrained Mean Shiftcited by 0
- 2026Stable Density Ridges: Consistency and Convergence of Subspace Constrained Mean Shift5 Aug 2026
- 2026RODR: Riemannian Orthogonally Decoupled Regularization for Disentangled Manifold Representation27 Jul 2026
- 2026The Data Manifold under the Microscope14 Jun 2026
- 2025Local Averaging Accurately Distills Manifold Structure From Noisy Data23 Jun 2025
- 2025Enhanced High-Dimensional Data Visualization through Adaptive Multi-Scale Manifold Embedding18 Mar 2025
- 2024Towards understanding how attention mechanism works in deep learning24 Dec 2024
- 2024Adaptive Bayesian Multivariate Spline Knot Inference with Prior Specifications on Model Complexity22 May 2024
- 2024Design a Metric Robust to Complicated High Dimensional Noise for Efficient Manifold Denoising8 Jan 2024
- 2023Ridge Estimation with Nonlinear Transformations9 Jun 2023