mlsanityData to 7 Oct 2026

ROP: Matrix recovery via rank-one projections

arXiv 1310.5791 ↗First posted 22 Oct 2013math.ST cs.IT math.ITcited by 18

Not on the map. Why?

Abstract (arXiv)

Estimation of low-rank matrices is of significant interest in a range of contemporary applications. In this paper, we introduce a rank-one projection model for low-rank matrix recovery and propose a constrained nuclear norm minimization method for stable recovery of low-rank matrices in the noisy case. The procedure is adaptive to the rank and robust against small perturbations. Both upper and lower bounds for the estimation accuracy under the Frobenius norm loss are obtained. The proposed estimator is shown to be rate-optimal under certain conditions. The estimator is easy to implement via convex programming and performs well numerically. The techniques and main results developed in the paper also have implications to other related statistical problems. An application to estimation of spiked covariance matrices from one-dimensional random projections is considered. The results demonstrate that it is still possible to accurately estimate the covariance matrix of a high-dimensional distribution based only on one-dimensional projections.

Key facts. Cited by 18 papers in the map (data through 7 Oct 2026). First posted on arXiv 22 Oct 2013.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 3; 2022: 3; 2023: 4; 2024: 1; 2025: 2; 2026: 5.

18 papers.

Sort:

  1. 2021On Riemannian Optimization over Positive Definite Matrices with the Bures-Wasserstein Geometrycited by 32
  2. 2022Flat minima generalize for low-rank matrix recoverycited by 28
  3. 2023A General Algorithm for Solving Rank-one Matrix Sensingcited by 15
  4. 2021Low-rank Tensor Estimation via Riemannian Gauss-Newton: Statistical Optimality and Second-Order Convergencecited by 13
  5. 2023Computationally Efficient and Statistically Optimal Robust High-Dimensional Linear Regressioncited by 4
  6. 2021Nonconvex Factorization and Manifold Formulations are Almost Equivalent in Low-rank Matrix Optimizationcited by 3
  7. 2023Perceptual adjustment queries and an inverted measurement paradigm for low-rank metric learningcited by 3
  8. 2025Theoretical Guarantees for Low-Rank Compression of Deep Neural Networkscited by 3
  9. 2026Provably Learning Multi-Head Attention with Queriescited by 2
  10. 2022ROP inception: signal estimation with quadratic random sketchingcited by 1
  11. 2022Learning the Structure of Large Networked Systems Obeying Conservation Lawscited by 1
  12. 2023Compressive Recovery of Sparse Precision Matricescited by 1
6 more
  1. 2026Provably Learning Attention with Queriescited by 1
  2. 2024Matrix Completion via Residual Spectral Matchingcited by 0
  3. 2025A Smoothing Newton Method for Rank-one Matrix Recoverycited by 0
  4. 2026Robust Sparse Signal Recovery with Outliers: A Hard Thresholding Pursuit Approach Based on LADcited by 0
  5. 2026SCaLE: Switching Cost aware Learning and Explorationcited by 0
  6. 2026Random features for Grassmannian kernel approximation with bounded rank-one projectionscited by 0