Tag Archives: matrix completion

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

Posted on December 6, 2013 by tianyizhou

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

Greedy Bilateral (GreB) Paradigm for Large-scale Matrix Completion, Robust PCA and Low-rank Approximation

Posted on February 11, 2013 by tianyizhou

Our paper “Greedy Bilateral Sketch, Completion and Smoothing” has been accepted by AISIATS 2013. Abstracts reads below, PDF is here, and code will be coming soon. Abstract: Recovering a large low-rank matrix from highly corrupted, incomplete or sparse outlier overwhelmed … Continue reading →

Posted in Tianyi's work | Tagged , , , , , | 3 Comments

News about GoDec code and ICML 2011 paper

Posted on August 30, 2011 by tianyizhou

We recently published a google site for Go Decomposition (GoDec), presented on ICML 2011. Now you can find all the available information and upcoming news about GoDec on http://sites.google.com/site/godecomposition  On the new site, there are 3 resources about GoDec we … Continue reading →

Posted in Tianyi's work | Tagged , , , , , , , | 5 Comments

GoDec: Randomized Low-rank & Sparse Matrix Decomposition in Noisy Case

Posted on April 20, 2011 by tianyizhou

This paper is accepted by ICML 2011 for presentation. Now the final version is ready and can be downloaded from here GO. Abstract: Low-rank and sparse structures have been profoundly studied in matrix completion and compressed sensing. In this paper, we develop … Continue reading →

Posted in Tianyi's work | Tagged , , , , , , , , | 2 Comments