A Dimension-Independent Generalization Bound for Kernel Supervised Principal Component Analysis


Kernel supervised principal component analysis (KSPCA) is a computationally efficient supervised feature extraction method that can learn non-linear transformations. We start the study of the statistical properties of KSPCA, providing the first bound on its sample complexity. This bound is dimension-independent, which justifies the good performance of KSPCA… (More)


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.


Citations per Year

Citation Velocity: 9

Averaging 9 citations per year over the last 2 years.

Learn more about how we calculate this metric in our FAQ.

Slides referencing similar topics