Title
Uniform convergence of adaptive graph-based regularization
Abstract
The regularization functional induced by the graph Laplacian of a random neighborhood graph based on the data is adaptive in two ways. First it adapts to an underlying manifold structure and second to the density of the data-generating probability measure. We identify in this paper the limit of the regularizer and show uniform convergence over the space of Hölder functions. As an intermediate step we derive upper bounds on the covering numbers of Hölder functions on compact Riemannian manifolds, which are of independent interest for the theoretical analysis of manifold-based learning methods.
Year
DOI
Venue
2006
10.1007/11776420_7
COLT
Keywords
Field
DocType
Riemannian Manifold,Uniform Convergence,Spectral Cluster,Compact Riemannian Manifold,Neighborhood Graph
Laplacian matrix,Topology,Mathematical optimization,Random graph,Riemannian manifold,Probability measure,Uniform convergence,Manifold alignment,Manifold,Mathematics,Laplace operator
Conference
Volume
ISSN
ISBN
4005
0302-9743
3-540-35294-5
Citations 
PageRank 
References 
11
3.84
6
Authors
1
Name
Order
Citations
PageRank
Matthias Hein166362.80