Alert button
Picture for Antôni H. Ribeiro

Antôni H. Ribeiro

Alert button

Invertible Kernel PCA with Random Fourier Features

Add code
Bookmark button
Alert button
Mar 09, 2023
Daniel Gedon, Antôni H. Ribeiro, Niklas Wahlström, Thomas B. Schön

Figure 1 for Invertible Kernel PCA with Random Fourier Features
Figure 2 for Invertible Kernel PCA with Random Fourier Features
Figure 3 for Invertible Kernel PCA with Random Fourier Features
Figure 4 for Invertible Kernel PCA with Random Fourier Features

Kernel principal component analysis (kPCA) is a widely studied method to construct a low-dimensional data representation after a nonlinear transformation. The prevailing method to reconstruct the original input signal from kPCA -- an important task for denoising -- requires us to solve a supervised learning problem. In this paper, we present an alternative method where the reconstruction follows naturally from the compression step. We first approximate the kernel with random Fourier features. Then, we exploit the fact that the nonlinear transformation is invertible in a certain subdomain. Hence, the name \emph{invertible kernel PCA (ikPCA)}. We experiment with different data modalities and show that ikPCA performs similarly to kPCA with supervised reconstruction on denoising tasks, making it a strong alternative.

* This work has been submitted to the IEEE for possible publication. Copyright may be transferred without notice, after which this version may no longer be accessible 
Viaarxiv icon
Github IconAccess Paper or Ask Questions
Twitter IconFacebook IconLinkedin IconWhatsapp IconMessenger Icon