Abstract
In the machine learning community it is generally believed that graph Laplacians corresponding to a finite sample of data points converge to a continuous Laplace operator if the sample size increases. Even though this assertion serves as a justification for many Laplacian-based algorithms, so far only some aspects of this claim have been rigorously proved. In this paper we close this gap by establishing the strong pointwise consistency of a family of graph Laplacians with data- dependent weights to some weighted Laplace operator. Our investigation also includes the important case where the data lies on a submanifold of \({\mathbb R}^{d}\).
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Belkin, M.: Problems of Learning on Manifolds. PhD thesis, University of Chicago (2003), http://www.people.cs.uchicago.edu/~misha/thesis.pdf
Belkin, M., Niyogi, P.: Towards a theoretical foundation for Laplacian-based manifold methods. In: Auer, P., Meir, R. (eds.) COLT 2005. LNCS (LNAI), vol. 3559, pp. 486–500. Springer, Heidelberg (2005)
Bousquet, O., Chapelle, O., Hein, M.: Measure based regularization. In: Advances in Neural Information Processing Systems, vol. 16 (2003)
Coifman, S., Lafon, S.: Diffusion maps (January 2005) (Preprint); To appear in Applied and Computational Harmonic Analysis (2005)
Greblicki, W., Krzyzak, A., Pawlak, M.: Distribution-free pointwise consistency of kernel regression estimate. Annals of Statistics 12, 1570–1575 (1984)
Klingenberg, W.: Riemannian Geometry. Walter de Gruyter, Berlin (1982)
Lafon, S.S.: Diffusion Maps and Geometric Harmonics. PhD thesis, Yale University (2004), http://www.math.yale.edu/~sl349/publications/dissertation.pdf
Niyogi, P.: Learning functional maps on Riemannian submanifolds. Talk presented at IPAM workshop on multiscale structures in the analysis of high-dimensional data (2004), available at http://www.ipam.ucla.edu/publications/mgaws3/mgaws3_5188.pdf
Smolyanov, O.G., von Weizsäcker, H., Wittich, O.: Brownian motion on a manifold as limit of stepwise conditioned standard Brownian motions. In: Stochastic processes, physics and geometry: new interplays, II (2000)
Smolyanov, O.G., von Weizsäcker, H., Wittich, O.: Chernoff’s theorem and discrete time approximations of Brownian motion on manifolds. Preprint (2004), available at http://lanl.arxiv.org/abs/math.PR/0409155
von Luxburg, U., Belkin, M., Bousquet, O.: Consistency of spectral clustering. Technical Report 134, Max Planck Institute for Biological Cybernetics (2004)
Zhou, D., Bousquet, O., Lal, T.N., Weston, J., Schölkopf, B.: Learning with local and global consistency. In: NIPS 16 (2004)
Zhou, D., Schölkopf, B., Hofmann, T.: Semi-supervised learning on directed graphs. In: NIPS 17 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hein, M., Audibert, JY., von Luxburg, U. (2005). From Graphs to Manifolds – Weak and Strong Pointwise Consistency of Graph Laplacians. In: Auer, P., Meir, R. (eds) Learning Theory. COLT 2005. Lecture Notes in Computer Science(), vol 3559. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11503415_32
Download citation
DOI: https://doi.org/10.1007/11503415_32
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26556-6
Online ISBN: 978-3-540-31892-7
eBook Packages: Computer ScienceComputer Science (R0)