Statistical properties of Kernel Prinicipal Component Analysis

Laurent Zwald (1) , Olivier Bousquet (2) , Gilles Blanchard (3)

1 Département de Mathématiques [ORSAY]
2 Max Planck Institute for Biological Cybernetics
3 Fraunhofer FIRST.IDA - Department Intelligent Data Analysis [Berlin]

The properties of the eigenvalues of Gram matrices are studied in a non-asymptotic setting. Using local Rademacher averages, we provide data-dependent and tight bounds for their convergence towards eigenvalues of the corresponding kernel operator. We perform these computations in a functional analytic framework which allows to deal implicitly with reproducing kernel Hilbert spaces of infinite dimension. This can have applications to various kernel algorithms, such as Support Vector Machines (SVM). We focus on Kernel Principal Component Analysis (KPCA) and, using such techniques, we obtain sharp excess risk bounds for the reconstruction error. In these bounds, the dependence on the decay of the spectrum and on the closeness of successive eigenvalues is made explicit.

Domaines: Machine Learning [stat.ML]

Laurent Zwald, Olivier Bousquet, Gilles Blanchard. Statistical properties of Kernel Prinicipal Component Analysis. COLT, 2004, Banff, AB, Canada. ⟨hal-00373799⟩