mlsanityData to 7 Oct 2026

Deep Kernel Principal Component Analysis for Multi-level Feature Learning

arXiv 2302.11220 ↗First posted 22 Feb 2023cs.LGcited by 6

Not on the map. Why?

Abstract (arXiv)

Principal Component Analysis (PCA) and its nonlinear extension Kernel PCA (KPCA) are widely used across science and industry for data analysis and dimensionality reduction. Modern deep learning tools have achieved great empirical success, but a framework for deep principal component analysis is still lacking. Here we develop a deep kernel PCA methodology (DKPCA) to extract multiple levels of the most informative components of the data. Our scheme can effectively identify new hierarchical variables, called deep principal components, capturing the main characteristics of high-dimensional data through a simple and interpretable numerical optimization. We couple the principal components of multiple KPCA levels, theoretically showing that DKPCA creates both forward and backward dependency across levels, which has not been explored in kernel methods and yet is crucial to extract more informative features. Various experimental evaluations on multiple data types show that DKPCA finds more efficient and disentangled representations with higher explained variance in fewer principal components, compared to the shallow KPCA. We demonstrate that our method allows for effective hierarchical data exploration, with the ability to separate the key generative factors of the input data both for large datasets and when few training samples are available. Overall, DKPCA can facilitate the extraction of useful patterns from high-dimensional data by learning more informative features organized in different levels, giving diversified aspects to explore the variation factors in the data, while maintaining a simple mathematical formulation.

Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). Builds on 16 of its 48 references that are in the map. First posted on arXiv 22 Feb 2023.

Builds on

16 of 48 references.

References · 16

  1. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  2. 2013Auto-Encoding Variational Bayescited by 3,980
  3. 2018Challenging Common Assumptions in the Unsupervised Learning of Disentangled Representationscited by 929
  4. 2016InfoGAN: Interpretable Representation Learning by Information Maximizing Generative Adversarial Netscited by 858
  5. 2018Disentangling by Factorisingcited by 614
  6. 2018Riemannian Adaptive Optimization Methodscited by 187
  7. 2018Robustly Disentangled Causal Mechanisms: Validating Deep Representations for Interventional Robustnesscited by 108
  8. 2019Theory and Evaluation Metrics for Learning Disentangled Representationscited by 57
  9. 2018On Fast Leverage Score Sampling and Optimal Learningcited by 40
  10. 2017A representer theorem for deep kernel learningcited by 26
  11. 2020Backward Feature Correction: How Deep Learning Performs Deep (Hierarchical) Learningcited by 18
  12. 2018Autoencoding any Data through Kernel Autoencoderscited by 10
4 more
  1. 2020Unsupervised learning of disentangled representations in deep restricted kernel machines with orthogonality constraintscited by 9
  2. 2019Learning Interpretable Disentangled Representations using Adversarial VAEscited by 8
  3. 2019Generative Restricted Kernel Machines: A Framework for Multi-view Generation and Disentangled Feature Learningcited by 7
  4. 2020Diversity sampling is an implicit regularization for kernel methodscited by 4

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2023: 3; 2024: 0; 2025: 2; 2026: 1.

6 papers.