SINCO - An Efficient Greedy Method for Learning Sparse INverse COvariance Matrix
published: Jan. 19, 2010, recorded: December 2009, views: 260
Report a problem or upload filesIf you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Herein, we propose a simple greedy algorithm (SINCO) for solving this optimization problem. SINCO solves the primal problem (unlike its predecessors such as COVSEL  and glasso ), using coordinate ascent, in a greedy manner, thus naturally preserving the sparsity of the solution. As demonstrated by our empirical results, SINCO has better capability in reducing the false-positive error rate (while maintaining similar true positive rate when networks are sufficiently sparse) than glasso , because of its greedy incremental nature.
Download slides: nipsworkshops09_scheinberg_egm_01.pdf (211.3 KB)
Link this pageWould you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !