Learning mixtures of low-rank models

Yanxi Chen, Cong Ma, H. Vincent Poor, Yuxin Chen

Research output: Contribution to journalArticlepeer-review

8 Scopus citations


We study the problem of learning mixtures of low-rank models, i.e. reconstructing multiple low-rank matrices from unlabelled linear measurements of each. This problem enriches two widely studied settings - low-rank matrix sensing and mixed linear regression - by bringing latent variables (i.e. unknown labels) and structural priors (i.e. low-rank structures) into consideration. To cope with the non-convexity issues arising from unlabelled heterogeneous data and low-complexity structure, we develop a three-stage meta-algorithm that is guaranteed to recover the unknown matrices with near-optimal sample and computational complexities under Gaussian designs. In addition, the proposed algorithm is provably stable against random noise. We complement the theoretical studies with empirical evidence that confirms the efficacy of our algorithm.

Original languageEnglish (US)
Article number9376988
Pages (from-to)4613-4636
Number of pages24
JournalIEEE Transactions on Information Theory
Issue number7
StatePublished - Jul 2021

All Science Journal Classification (ASJC) codes

  • Information Systems
  • Computer Science Applications
  • Library and Information Sciences


  • Heterogeneous data
  • Latent variable models
  • Matrix sensing
  • Meta-learning
  • Mixed linear regression
  • Non-convex optimization


Dive into the research topics of 'Learning mixtures of low-rank models'. Together they form a unique fingerprint.

Cite this