Uniform Convergence of Adaptive Graph-Based Regularization

DOI10.1007/11776420_7zbMath1143.68416OpenAlexW1563644419MaRDI QIDQ5307558

Matthias Hein

Publication date: 14 September 2007

Published in: Learning Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11776420_7

Mathematics Subject Classification ID

Computational learning theory (68Q32) Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (14)

Density estimation on manifolds with boundary ⋮ Unnamed Item ⋮ Concentration of kernel matrices with application to kernel spectral clustering ⋮ Eigen-convergence of Gaussian kernelized graph Laplacian by manifold heat interpolation ⋮ Continuum Limits of Nonlocal $p$-Laplacian Variational Problems on Graphs ⋮ Error estimates for spectral convergence of the graph Laplacian on random geometric graphs toward the Laplace-Beltrami operator ⋮ Spatiotemporal analysis using Riemannian composition of diffusion operators ⋮ Hearing the clusters of a graph: A distributed algorithm ⋮ Spectral clustering and the high-dimensional stochastic blockmodel ⋮ Spectral convergence of graph Laplacian and heat kernel reconstruction in \(L^\infty\) from random samples ⋮ The game theoreticp-Laplacian and semi-supervised learning with few labels ⋮ Optimality of spectral clustering in the Gaussian mixture model ⋮ Analysis of $p$-Laplacian Regularization in Semisupervised Learning ⋮ The SPDE approach to Matérn fields: graph representations

This page was built for publication: Uniform Convergence of Adaptive Graph-Based Regularization