Tag Archives: Nonnegative Matrix Factorization

AISTATS 2013 GreBsmo code is released

Here is the GreBsmo code for our AISTATS 2013 paper. You can use it as a greedy version of GoDec solver for X=L+S problem. It is much faster and more robust. There are three video subsequences you can play in … Continue reading

Posted in Tianyi's work | Tagged , , , , | Leave a comment

[Best student paper award] Welcome to my “Divide-and-Conquer Anchoring (DCA)” talk at ICDM Dallas Dec 8

Is it possible to finish a 60000×10000 matrix decomposition (NMF, PCA, etc)  or completion in 6 seconds on your laptop’s matlab? Can we make it even faster by a simple distributable scheme? How to summarize a huge-scale dataset (ratings, movie, … Continue reading

Posted in Tianyi's work | Tagged , , , , , , | Leave a comment