Matrix factorization with binary components

author: Martin Slawski, Department of Computer Science, Saarland University
published: Nov. 7, 2014,   recorded: January 2014,   views: 2212


Related Open Educational Resources

Related content

Report a problem or upload files

If 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.
Lecture popularity: You need to login to cast your vote.


Motivated by an application in computational biology, we consider constrained low-rank matrix factorization problems with {0,1}-constraints on one of the factors. In addition to the the non-convexity shared with more general matrix factorization schemes, our problem is further complicated by a combinatorial constraint set of size 2m⋅r, where m is the dimension of the data points and r the rank of the factorization. Despite apparent intractability, we provide −in the line of recent work on non-negative matrix factorization by Arora et al.(2012)− an algorithm that provably recovers the underlying factorization in the exact case with operations of the order O(mr2r+mnr) in the worst case. To obtain that result, we invoke theory centered around a fundamental result in combinatorics, the Littlewood-Offord lemma.

See Also:

Download slides icon Download slides: machine_slawski_binary_components_01.pdf (246.6 KB)

Help icon Streaming Video Help

Link this page

Would you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !

Write your own review or comment:

make sure you have javascript enabled or clear this field: