Uniform Convergence of Adaptive Graph-Based Regularization
From MaRDI portal
Recommendations
Cited in
(17)- Density estimation on manifolds with boundary
- Spectral convergence of graph Laplacian and heat kernel reconstruction in L^ from random samples
- Optimality of spectral clustering in the Gaussian mixture model
- The SPDE approach to Matérn fields: graph representations
- 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
- Concentration of kernel matrices with application to kernel spectral clustering
- Hearing the clusters of a graph: A distributed algorithm
- The game theoretic p-Laplacian and semi-supervised learning with few labels
- On the consistency of graph-based Bayesian semi-supervised learning and the scalability of sampling algorithms
- Continuum limits of nonlocal p-Laplacian variational problems on graphs
- Analysis of p-Laplacian regularization in semisupervised learning
- Spatiotemporal analysis using Riemannian composition of diffusion operators
- Spectral clustering and the high-dimensional stochastic blockmodel
- Consistency of fractional graph-Laplacian regularization in semisupervised learning with finite labels
- Spectral convergence of symmetrized graph Laplacian on manifolds with boundary
- Discrete-to-continuum rates of convergence for nonlocal p-Laplacian evolution problems
This page was built for publication: Uniform Convergence of Adaptive Graph-Based Regularization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5307558)