Return the assignments by email to firstname.lastname@example.org by 5 June, 1600 hours. The subject of the email must start with [TADA]. The assignment must be returned as a PDF and the PDF must contain your name, matriculation number, and e-mail address together with the exact topic of the assignment.
Topic 4 is hard. Grading of this topic takes this hardness into account.
You will need a username and password to access the papers outside the MPI network. Contact the lecturers if you don't know the username or password.
For the topic of the assignment, choose one of the following:
The two survey articles on tensor factorizations [1, 2] list dozen different tensor decomposition models (even without counting the non-negative variants). Why are there so many differnt models? Are they all needed? Are some just trivial variants of others? What are the most and least important ones (in your opinion) and why?
Read  and . These papers present two diffent ways of analysing data using tensors. But do they really need tensors, or are they just working on a collection of matrices?  uses time in the third mode: is their use of tensor factorization still justified? Or do they ignore the temporal order? Try to identify other potential weaknesses on these papers.
Read . How does TensorFaces utilize the tensor decompositions. How does it improve over Eigenfaces  (if at all)? Could you replicate TensorFaces using just Eigenfaces? Is TensorFaces scalable (in time and space)? Is TensorFaces are special application, or does it exhibit some more general theme when moving from matrices (2-way tensors) to N-way tensors?
In  the authors present an idea to tile a database, that is, to represent a binary matrix as a union of all-1s submatrices. The authors of  extend this idea into 3-way binary tensors. Both of these methods, however, want to build exact representations and they use all-1s submatrices and tensors. In  the authors present a way to mine noise-tolerant patterns in N-ary relations. Could we use these noise-tolerant patterns to find an approximate representation of the given binary tensor as a union of dense subtensors? How would that look as a tensor factorization? Both  and  use the Set Cover algorithm to select the subtensors. Could we use the Set Cover also here? Why or why not? Would the Positive-Negative Partial Set Cover problem  be more appropriate? Why or why not?