Randomized PCA Algorithms with Regret Bounds that are Logarithmic in the Dimension
Randomized PCA Algorithms with Regret Bounds that are Logarithmic in the Dimension
Feb 25, 2007 5434 views 
en-de
en-es
en-fr
en-sl
en
en-zh
0.25
0.5
0.75
1.25
1.5
1.75
2
We design an on-line algorithm for Principal Component Analysis. The instances are projected into a probabilistically chosen low dimensional subspace. The total expected quadratic approximation error equals the total quadratic approximation error of the best subspace chosen in hindsight plus some additional term that grows linearly in dimension of the subspace but logarithmically in the dimension of the instances.