Rank Determination for Low-Rank Data Completion


Recently, fundamental conditions on the sampling patterns have been obtained for finite completability of low-rank matrices or tensors given the corresponding ranks. In this paper, we consider the scenario where the rank is not given and we aim to approximate the unknown rank based on the location of sampled entries and some given completion. We consider a… (More)


9 Figures and Tables

Slides referencing similar topics