Convergence of graph Laplacian with kNN self-tuned kernels
Convergence of graph Laplacian with kNN self-tuned kernels
复制标题
图拉普拉斯算子与 kNN 自调整核的收敛
DOI:
10.1093/imaiai/iaab019
复制
发表时间:
2021
期刊:
影响因子:
--
通讯作者:
Wu, Hau-Tieng
中科院分区:
文献类型:
--
作者:
Cheng, Xiuyuan;Wu, Hau-Tieng
Kernelized Gram matrixconstructed from data pointsasis widely used in graph-based geometric data analysis and unsupervised learning. An important question is how to choose the kernel bandwidth, and a common practice called self-tuned kernel adaptively sets aat each pointby the-nearest neighbor (kNN) distance. Whens are sampled from a-dimensional manifold embedded in a possibly high-dimensional space, unlike with fixed-bandwidth kernels, theoretical results of graph Laplacian convergence with self-tuned kernels have been incomplete. This paper proves the convergence of graph Laplacian operatorto manifold (weighted-)Laplacian for a new family of kNN self-tuned kernels, whereis the estimated bandwidth function by kNN and the limiting operator is also parametrized by. When, the limiting operator is the weighted manifold Laplacian. Specifically, we prove the point-wise convergence ofand convergence of the graph Dirichlet form with rates. Our analysis is based on first establishing aconsistency forwhich bounds the relative estimation erroruniformly with high probability, whereandis the data density function. Our theoretical results reveal the advantage of the self-tuned kernel over the fixed-bandwidth kernel via smaller variance error in low-density regions. In the algorithm, no prior knowledge ofor data density is needed. The theoretical results are supported by numerical experiments on simulated data and hand-written digit image data.