Systems | Information | Learning | Optimization
 

Finding low-rank solutions via the Burer-Monteiro approach, efficiently and provably

Video: https://vimeo.com/192676538 A low rank matrix can be described as the outer product of two tall matrices, where the total number of variables is much smaller. One could exploit this observation in optimization: e.g., consider the minimization of a convex function f over low-rank matrices, where the low-rank set is …