January 2018 S M T W T F S « Sep 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 Pages
 1bit measurements
 Bregman iteration
 classification
 clustering
 compressed sensing
 computer vision
 conical hull problem
 convex optimization
 dimension reduction
 DivideandConquer
 elastic net
 fast algorithm
 fast SVD
 feature selection
 fixed point continuation
 game
 greedy search
 group sparsity
 Hamming Compressed Sensing
 iterative thresholding
 Kmeans
 latent variable model
 lowrank
 manifold learning
 matrix completion
 matrix factorization
 multilabel learning
 Ncut
 Nesterov's method
 NIPS 2011
 Nonnegative Matrix Factorization
 optimization
 Quantization recovery
 randomized optimization
 robust principal component analysis
 SDP
 Separable assumption
 sparse learning
 Spectral clustering
 structured learning
 SVM
ClustrMaps

What’s new
 List of Submodular Optimization on Streaming Data (In Update)
 DivideandConquer Learning by Anchoring a Conical Hull
 Multitask Copula – A semiparametric joint prediction model for multiple outputs with sparse graph structure
 NeSVM (Nesterov’s method for SVM) code for our ICDM 2010 paper
 AISTATS 2013 GreBsmo code is released
Articles
Tag Archives: DivideandConquer
DivideandConquer Learning by Anchoring a Conical Hull
Many wellknown machine learning methods aim to draw a line between two classes. However, in our recently accepted NIPS 2014 paper “DivideandConquer Learning by Anchoring a Conical Hull“, we reduce lots of fundamental machine learning problems (a broad class of … Continue reading
[Best student paper award] Welcome to my “DivideandConquer 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 hugescale dataset (ratings, movie, … Continue reading