Tag Archives: Divide-and-Conquer

Divide-and-Conquer Learning by Anchoring a Conical Hull

Many well-known machine learning methods aim to draw a line between two classes. However, in our recently accepted NIPS 2014 paper “Divide-and-Conquer Learning by Anchoring a Conical Hull“, we reduce lots of fundamental machine learning problems (a broad class of … 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