Randomized PCA Algorithms with Regret Bounds that are Logarithmic in the Dimension
published: Feb. 25, 2007, recorded: August 2006, views: 312
Report a problem or upload filesIf you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
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.
Link this pageWould you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !