On Uniform Consistency of Spectral Embeddings
Abstract
In this paper, we study the convergence of the spectral embeddings obtained from the leading eigenvectors of certain similarity matrices to their population counterparts. We opt to study this convergence in a uniform (instead of average) sense and highlight the benefits of this choice. Using the Newton-Kantorovich Theorem and other tools from functional analysis, we first establish a general perturbation result for orthonormal bases of invariant subspaces. We then apply this general result to normalized spectral clustering. By tapping into the rich literature of Sobolev spaces and exploiting some concentration results in Hilbert spaces, we are able to prove a finite sample error bound on the uniform consistency error of the spectral embeddings in normalized spectral clustering.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.