%I Springer
%V 42
%T Accuracy of suboptimal solutions to kernel principal component analysis
%P 265-287
%N 2
%J Computational Optimization and Applications
%R 10.1007/s10589-007-9108-y
%D 2009
%L eprints1712
%X For Principal Component Analysis in Reproducing Kernel Hilbert Spaces (KPCA), optimization over sets containing only linear combinations of all n-tuples of kernel functions is investigated, where n is a positive integer smaller than the number of data. Upper bounds on the accuracy in approximating the optimal solution, achievable without restrictions on the number of kernel functions, are derived. The rates of decrease of the upper bounds for increasing number n of kernel functions are given by the summation of two terms, one proportional to n ?1/2 and the other to n ?1, and depend on the maximum eigenvalue of the Gram matrix of the kernel with respect to the data. Primal and dual formulations of KPCA are considered. The estimates provide insights into the effectiveness of sparse KPCA techniques, aimed at reducing the computational costs of expansions in terms of kernel units. 
%A Giorgio Gnecco
%A Marcello Sanguineti
%K Principal component analysis (PCA); Kernel methods; Suboptimal solutions; Primal and dual problems; Lagrangian; Regularized optimization problems