An online algorithm for contrastive Principal Component Analysis
Not on the map. Why?
Abstract (arXiv)
Finding informative low-dimensional representations that can be computed efficiently in large datasets is an important problem in data analysis. Recently, contrastive Principal Component Analysis (cPCA) was proposed as a more informative generalization of PCA that takes advantage of contrastive learning. However, the performance of cPCA is sensitive to hyper-parameter choice and there is currently no online algorithm for implementing cPCA. Here, we introduce a modified cPCA method, which we denote cPCA*, that is more interpretable and less sensitive to the choice of hyper-parameter. We derive an online algorithm for cPCA* and show that it maps onto a neural network with local learning rules, so it can potentially be implemented in energy efficient neuromorphic hardware. We evaluate the performance of our online algorithm on real datasets and highlight the differences and similarities with the original formulation.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 6 of its 16 references that are in the map. First posted on arXiv 14 Nov 2022.
Builds on
6 of 16 references.
References · 6
- 2016First Efficient Convergence for Streaming k-PCA: a Global, Gap-Free, and Near-Optimal Ratecited by 32
- 2015A Hebbian/Anti-Hebbian Neural Network for Linear Subspace Learning: A Derivation from Multidimensional Scaling of Streaming Datacited by 26
- 2019Supporting Analysis of Dimensionality Reduction Results with Contrastive Learningcited by 26
- 2020A biologically plausible neural network for multi-channel Canonical Correlation Analysiscited by 9
- 2020A biologically plausible neural network for Slow Feature Analysiscited by 8
- 2017Contrastive Principal Component Analysiscited by 7
Built on by
Citing papers per year: 2023: 1; 2024: 0; 2025: 1.
2 papers.