Improved convergence rate of kNN graph Laplacians: differentiable self-tuned affinity
From MaRDI portal
Publication:7364175
Cites work
- Adaptive Bayesian regression on data with low intrinsic dimensionality
- Analysis and algorithms for \(\ell_p\)-based semi-supervised learning on graphs
- Analysis of p-Laplacian regularization in semisupervised learning
- Analysis of KNN Density Estimation
- Boundary detection algorithm inspired by locally linear embedding
- Consistency properties of nearest neighbor density function estimators
- Convergence of graph Laplacian with kNN self-tuned kernels
- Diffusion maps
- Eigen-convergence of Gaussian kernelized graph Laplacian by manifold heat interpolation
- Error estimates for spectral convergence of the graph Laplacian on random geometric graphs toward the Laplace-Beltrami operator
- From graph to manifold Laplacian: the convergence rate
- Graph Laplacians and their convergence on random neighborhood graphs
- scientific article; zbMATH DE number 52737 (Why is no real title available?)
- scientific article; zbMATH DE number 7626797 (Why is no real title available?)
- Improved spectral convergence rates for graph Laplacians on \(\varepsilon \)-graphs and \(k\)-NN graphs
- Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
- Learning Theory
- Lectures on the nearest neighbor method
- Lipschitz regularity of graph Laplacians on random data clouds
- Measure-based diffusion grid construction and high-dimensional data discretization
- Multivariate k-nearest neighbor density estimates
- Rate of strong uniform convergence of k-NN density estimates
- Riemannian Geometry
- Scalability and robustness of spectral embedding: landmark diffusion is all you need
- Semi-supervised learning on Riemannian manifolds
- Spectral analysis of weighted Laplacians arising in data clustering
- Spectral Convergence of Diffusion Maps: Improved Error Bounds and an Alternative Normalization
- Spectral convergence of graph Laplacian and heat kernel reconstruction in L^ from random samples
- Spectral convergence of the connection Laplacian from random samples
- The strong uniform consistency of nearest neighbor density estimates
- Think globally, fit locally under the manifold setup: asymptotic analysis of locally linear embedding
- Towards a theoretical foundation for Laplacian-based manifold methods
- Two-sample statistics based on anisotropic kernels
- Variable bandwidth diffusion kernels
- Über homogene Polynome in ($L^{2}$)
This page was built for publication: Improved convergence rate of \(k\mathrm{NN}\) graph Laplacians: differentiable self-tuned affinity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7364175)
