Error estimation of weighted nonlocal Laplacian on random point cloud
arXiv:1809.08622
Abstract
We analyze the convergence of the weighted nonlocal Laplacian (WNLL) on high dimensional randomly distributed data. The analysis reveals the importance of the scaling weight with and be the number of entire and labeled data, respectively. The result gives a theoretical foundation of WNLL for high dimensional data interpolation.
15 pages; 2 figures
References in corpus (1)
Cited by in corpus (4)
- Adversarial Defense via Data Dependent Activation Function and Total Variation Minimization
- A continuum limit for the PageRank algorithm
- Robust Certification for Laplace Learning on Geometric Graphs
- Graph Interpolating Activation Improves Both Natural and Robust Accuracies in Data-Efficient Deep Learning