Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar (in cooperation with M. Ghaffari, A. Steger and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Tuesday, October 06, 2009, 12:15 pm

Duration: This information is not available in the database

Location: CAB G51

Speaker: Martin Jaggi

Approximate SDP solvers, Matrix Factorizations, the Netflix Prize, and PageRank

We will present a new simple approximation algorithm of Hazan [Hazan LATIN '08] to solve arbitrary semidefinite programs (SDPs).

Furthermore, we will discuss matrix factorization techniques in machine learning. The task here is that given just a few of the entries of a large real matrix, we try to predict the unknown entries by building a simple factor model of the matrix. Here 'simple' either means low rank or low norm. Such matrix factorization techniques are at the core of current recommender systems as in the recently ended Netflix Prize competition [Short IEEE article,   Wikipedia: Netflix Prize].

In the last part we will apply Hazan's approximate SDP solver to solve matrix factorization problems, and observe that its performance is comparable to the best existing algorithms. The performance is limited by how fast we can find the principal eigenvector of the adjacency matrix of a weighted bipartite graph.


Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   2017  2016  2015  2014  2013  2012  2011  2010  2009  2008  2007  2006  2005  2004  2003  2002  2001  2000  1999  1998  1997  1996  

Information for students and suggested topics for student talks


Automatic MiSe System Software Version 1.4803M   |   admin login