Fixed-rank matrix factorizations and Riemannian low-rank optimizationReport as inadecuate



 Fixed-rank matrix factorizations and Riemannian low-rank optimization


Fixed-rank matrix factorizations and Riemannian low-rank optimization - Download this document for free, or read online. Document in PDF available to download.

Download or read this book online for free in PDF: Fixed-rank matrix factorizations and Riemannian low-rank optimization
Motivated by the problem of learning a linear regression model whose parameter is a large fixed-rank non-symmetric matrix, we consider the optimization of a smooth cost function defined on the set of fixed-rank matrices. We adopt the geometric framework of optimization on Riemannian quotient manifolds. We study the underlying geometries of several well-known fixed-rank matrix factorizations and then exploit the Riemannian quotient geometry of the search space in the design of a class of gradient descent and trust-region algorithms. The proposed algorithms generalize our previous results on fixed-rank symmetric positive semidefinite matrices, apply to a broad range of applications, scale to high-dimensional problems and confer a geometric basis to recent contributions on the learning of fixed-rank non-symmetric matrices. We make connections with existing algorithms in the context of low-rank matrix completion and discuss relative usefulness of the proposed framework. Numerical experiments suggest that the proposed algorithms compete with the state-of-the-art and that manifold optimization offers an effective and versatile framework for the design of machine learning algorithms that learn a fixed-rank matrix.



Author: B. Mishra; G. Meyer; S. Bonnabel; R. Sepulchre

Source: https://archive.org/







Related documents