activity
20112026
most citedNonconvex Optimization Meets Low-Rank Matrix Factorization: An Overview

378 citations · 1.8k across the 48 of their papers we have counts for

collaborators
Showing 2019Show all

5 papers · 1 filter

cs.LG2019

Nonconvex Low-Rank Tensor Completion from Noisy Data

Changxiao Cai, Gen Li, H. Vincent Poor +1

We study a noisy tensor completion problem of broad practical interest, namely, the reconstruction of a low-rank tensor from highly incomplete and randomly corrupted observations o…

math.ST2019★ 6 cited

Subspace Estimation from Unbalanced and Incomplete Data Matrices: Statistical Guarantees

Changxiao Cai, Gen Li, Yuejie Chi +2

This paper is concerned with estimating the column space of an unknown low-rank matrix , given noisy and partial observatio…

stat.ML2019★ 11 cited

Communication-Efficient Distributed Optimization in Networks with Gradient Tracking and Variance Reduction

Boyue Li, Shicong Cen, Yuxin Chen +1

There is growing interest in large-scale machine learning and optimization over decentralized networks, e.g. in the context of multi-agent learning and federated learning. Due to t…

stat.ML2019★ 129 cited

Inference and Uncertainty Quantification for Noisy Matrix Completion

Yuxin Chen, Jianqing Fan, Cong Ma +1

Noisy matrix completion aims at estimating a low-rank matrix given only partial and corrupted entries. Despite substantial progress in designing efficient estimation algorithms, it…

stat.ML2019★ 20 cited

Noisy Matrix Completion: Understanding Statistical Guarantees for Convex Relaxation via Nonconvex Optimization

Yuxin Chen, Yuejie Chi, Jianqing Fan +2

This paper studies noisy low-rank matrix completion: given partial and noisy entries of a large low-rank matrix, the goal is to estimate the underlying matrix faithfully and effici…