High-probability bounds for the reconstruction error of PCA

09/24/2019
by   Cassandra Uebel, et al.
0

We identify principal component analysis (PCA) as an empirical risk minimization problem and prove error bounds that hold with high probability. More precisely, we derive upper bounds for the reconstruction error of PCA that can be expressed relative to the minimal reconstruction error. The significance of these bounds is shown for the cases of functional and kernel PCA. In such scenarios, the eigenvalues of the covariance operator often decay at a polynomial or nearly exponential rate. Our results yield that the reconstruction error of PCA achieves the same rate as the minimal reconstruction error.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/23/2023

Two derivations of Principal Component Analysis on datasets of distributions

In this brief note, we formulate Principal Component Analysis (PCA) over...
research
02/08/2022

Entrywise Recovery Guarantees for Sparse PCA via Sparsistent Algorithms

Sparse Principal Component Analysis (PCA) is a prevalent tool across a p...
research
12/21/2014

Correlation of Data Reconstruction Error and Shrinkages in Pair-wise Distances under Principal Component Analysis (PCA)

In this on-going work, I explore certain theoretical and empirical impli...
research
12/18/2020

Upper and Lower Bounds on the Performance of Kernel PCA

Principal Component Analysis (PCA) is a popular method for dimension red...
research
03/28/2023

Operator learning with PCA-Net: upper and lower complexity bounds

PCA-Net is a recently proposed neural operator architecture which combin...
research
05/30/2020

An Analytical Formula for Spectrum Reconstruction

We study the spectrum reconstruction technique. As is known to all, eige...
research
06/26/2019

Principal Component Analysis for Multivariate Extremes

The first order behavior of multivariate heavy-tailed random vectors abo...

Please sign up or login with your details

Forgot password? Click here to reset