Manifold approximation by moving least-squares projection (MMLS)

DOI10.1007/S00365-019-09489-8MaRDI QIDQ2216655zbMATH OpenOpenAlexWikidataFDO

Authors Yanyan Li

Publication date 16 December 2020

Published in Constructive Approximation (Search for Journal in Brave)

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

zbMATH Keywords

dimension reductionmanifold learningmoving least-squares methodmanifold denoisingmanifold approximation

Mathematics Subject Classification ID

Numerical approximation and computational geometry (primarily algorithms) (65D99) Approximation by arbitrary nonlinear expressions; widths and entropy (41A46) Numerical methods for low-rank matrix approximation; matrix compression (65F55)

Abstract: In order to avoid the curse of dimensionality, frequently encountered in Big Data analysis, there was a vast development in the field of linear and nonlinear dimension reduction techniques in recent years. These techniques (sometimes referred to as manifold learning) assume that the scattered input data is lying on a lower dimensional manifold, thus the high dimensionality problem can be overcome by learning the lower dimensionality behavior. However, in real life applications, data is often very noisy. In this work, we propose a method to approximate $mathcalM$ a $d$-dimensional $C^{m+1}$ smooth submanifold of $mathbb{R}^n$ ($dlln$) based upon noisy scattered data points (i.e., a data cloud). We assume that the data points are located "near" the lower dimensional manifold and suggest a non-linear moving least-squares projection on an approximating $d$-dimensional manifold. Under some mild assumptions, the resulting approximant is shown to be infinitely smooth and of high approximation order (i.e., $O(h^{m+1})$, where $h$ is the fill distance and $m$ is the degree of the local polynomial approximation). The method presented here assumes no analytic knowledge of the approximated manifold and the approximation algorithm is linear in the large dimension $n$. Furthermore, the approximating manifold can serve as a framework to perform operations directly on the high dimensional data in a computationally efficient manner. This way, the preparatory step of dimension reduction, which induces distortions to the data, can be avoided altogether.

Recommendations

• Approximation of functions over manifolds: a moving least-squares approach
• Manifold reconstruction and denoising from scattered data in high dimension
• Random projections of smooth manifolds
• A metric multidimensional scaling-based nonlinear manifold learning approach for unsupervised data reduction
• Scattered manifold-valued data approximation

Cites work

• scientific article; zbMATH DE number 1723518 (Why is no real title available?)
• scientific article; zbMATH DE number 3126094 (Why is no real title available?)
• scientific article; zbMATH DE number 47363 (Why is no real title available?)
• 10.1162/153244304322972667
• Approximation of functions over manifolds: a moving least-squares approach
• Curvature Measures
• Diffusion maps
• Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
• Manifold reconstruction from point samples
• Manifold reconstruction using tangential Delaunay complexes
• Mathematical Systems Theory I
• Matrix algorithms. Vol. 2: Eigensystems
• Multidimensional scaling. I: Theory and method
• Nonlinear Dimensionality Reduction
• Numerical Methods for Computing Angles Between Linear Subspaces
• Perturbation theory for normal operators
• Principal component analysis.
• Self-organized formation of topologically correct feature maps
• Self-organizing maps.
• Surfaces Generated by Moving Least Squares Methods
• The approximation power of moving least-squares
• \(C^1\) isometric imbeddings

Cited in

(11)

• Estimates for local approximations of functions on differential manifold
• Approximation of functions over manifolds: a moving least-squares approach
• Reconstruction of manifold embeddings into Euclidean spaces via intrinsic distances
• Fault and gradient fault detection and reconstruction from scattered data
• Concentration inequalities for cross-validation in scattered data approximation
• The reach of subsets of manifolds
• A fault detection method based on partition of unity and kernel approximation
• Kernel-based parameter estimation of dynamical systems with unknown observation functions
• Discontinuity detection by null rules for adaptive surface reconstruction
• Approximating the span of principal components via iterative least-squares
• Manifold reconstruction and denoising from scattered data in high dimension

This page was built for publication: Manifold approximation by moving least-squares projection (MMLS)

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