A New Convex Relaxation for Tensor Completion
published: Nov. 7, 2013, recorded: September 2013, views: 2612
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.
Tensor factorization has received a lot of interest recently in the collaborative filtering field, as a natural extension of matrix completion. That is due to the capability of tensors to model the relationships between more than two entities, such as users, products, aspects, and time. In my research, I study the case where contextual information is available about the products (as in conjoint analysis). This scenario is modeled as a multitask learning problem where the input data are products descriptions so that tasks are learned for all combinations of the remaining entities, that is, in the previous example, a task will be learned to predict how each aspect of a product is valued by each user at a given time. Multilinear algebra concepts are used to describe the resultant problem. I will discuss different approaches to solve it and the challenges that they pose when managing large data sets.
Download slides: lsoldm2013_romera_paredes_tensor_completion_01.pdf (606.0 KB)
Link this pageWould you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !