addressalign-toparrow-leftarrow-rightbackbellblockcalendarcameraccwchatcheckchevron-downchevron-leftchevron-rightchevron-small-downchevron-small-leftchevron-small-rightchevron-small-upchevron-upcircle-with-checkcircle-with-crosscircle-with-pluscrosseditemptyheartfacebookfolderfullheartglobegmailgoogleimagesinstagramlinklocation-pinmagnifying-glassmailminusmoremuplabelShape 3 + Rectangle 1outlookpersonplusprice-ribbonImported LayersImported LayersImported Layersshieldstartickettrashtriangle-downtriangle-uptwitteruseryahoo

Divide-and-Conquer Matrix Factorization

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/

 

Meetup Format:

 

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

 

Join or login to comment.

40 went

Our Sponsors

People in this
Meetup are also in:

Sign up

Meetup members, Log in

By clicking "Sign up" or "Sign up using Facebook", you confirm that you accept our Terms of Service & Privacy Policy