Lester Mackey will be presenting "Divide-and-Conquer Matrix Factorization" (NIPS 2011).
Speaker Info: http://www.cs.berkeley.edu/~lmackey/
Abstract (from paper): This work introduces Divide-Factor-Combine (DFC), a parallel divide-and- conquer framework for noisy matrix factorization. DFC divides a large-scale matrix factorization task into smaller subproblems, solves each subproblem in parallel using an arbitrary base matrix factorization algorithm, and combines the sub- problem solutions using techniques from randomized matrix approximation. Our experiments with collaborative filtering, video background modeling, and simulated data demonstrate the near-linear to super-linear speed-ups attainable with this approach. Moreover, our analysis shows that DFC enjoys high-probability recovery guarantees comparable to those of its base algorithm.
Paper's website: http://www.cs.berkeley.edu/~ameet/dfc/
6:30-6:45 -- socializing
6:45-7:00 -- lightning talks (we have openings for three 5-minute lightning talks. Please contact me if you're interested in presenting)
7:00-8:00 -- main presentation
8:00-8:30 -- socializing