Nuclear norm minimization and semidefinite-constrained ERM achieve optimal O(rn) sample complexity for low-rank matrix recovery under heavy-tailed quadratic sampling with only finite 4+δ moments.
Exact and stable covariance estimation from quadratic sampling via convex programming.IEEE Transactions on Information Theory, 61(7):4034–4059, 2015
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.ST 1years
2026 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Low-Rank Matrix Recovery via Heavy-Tailed Quadratic Sampling
Nuclear norm minimization and semidefinite-constrained ERM achieve optimal O(rn) sample complexity for low-rank matrix recovery under heavy-tailed quadratic sampling with only finite 4+δ moments.