Low-Rank Matrix Completion By Riemannian Optimization
Related publications (73)
Graph Chatbot
Chat with Graph Search
Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
We present a new approach to the discrete-time Chandrasekhar recursions and some generalizations thereof. We extend the recursions to a class of structured time-variant state-space models, and discuss connections with the (generalized) Schur algorithm. We ...
In this paper, we prove that if f is a conformal map between two Riemannian surfaces, and if the curvature of the target is nonpositive and less than or equal to the curvature of the source, then the map is contracting. ...
