资源分类
》 资源 》论文》A Combinatorial Algebraic Approach for the Identifiability of Low-Rank Matrix Completion

A Combinatorial Algebraic Approach for the Identifiability of Low-Rank Matrix Completion

2020-02-28 | |  66 |   57 |   0

Abstract

In this paper, we review the problem of matrix completion and expose its intimate relations with algebraic geometry, combinatorics and graph theory. We present the first necessary and sufficient combinatorial conditions for matrices of arbitrary rank to be identifiable from a set of matrix entries, yielding theoretical constraints and new algorithms for the problem of matrix completion. We conclude by algorithmically evaluating the tightness of the given conditions and algorithms for practically relevant matrix sizes, showing that the algebraic-combinatorial approach can lead to improvements over stateof-the-art matrix completion methods.

上一篇：Summarizing topical content with word frequency and exclusivity

下一篇：Feature Selection via Probabilistic Outputs

用户评价
全部评价

热门资源

  • The Variational S...

    Unlike traditional images which do not offer in...

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Rating-Boosted La...

    The performance of a recommendation system reli...