Slow subspace learning from stationary processes
published: Feb. 25, 2007, recorded: July 2006, views: 3118
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.
The talk presents a method of unsupervised learning from stationary, vector-valued processes. The method selects a subspace on the basis of an objective which can be used to bound the expected classification error for a family of tasks posessing a temporal continuity property. We prove bounds on the objective’s estimation error in terms of mixing coefficients and consistency for absolutely regular processes. Experiments with image processing demonstrate the algorithms ability to learn geometrically invariant feature maps.
Link this pageWould you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !