Pith. sign in

REVIEW 4 cited by

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1011.6326 v1 pith:CZ57YI4Y submitted 2010-11-29 math.OC cs.ITmath.ITstat.ML

New Null Space Results and Recovery Thresholds for Matrix Rank Minimization

classification math.OC cs.ITmath.ITstat.ML
keywords thresholdsrankciteminimizationnullrecoveryresultsspace
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Nuclear norm minimization (NNM) has recently gained significant attention for its use in rank minimization problems. Similar to compressed sensing, using null space characterizations, recovery thresholds for NNM have been studied in \cite{arxiv,Recht_Xu_Hassibi}. However simulations show that the thresholds are far from optimal, especially in the low rank region. In this paper we apply the recent analysis of Stojnic for compressed sensing \cite{mihailo} to the null space conditions of NNM. The resulting thresholds are significantly better and in particular our weak threshold appears to match with simulation results. Further our curves suggest for any rank growing linearly with matrix size $n$ we need only three times of oversampling (the model complexity) for weak recovery. Similar to \cite{arxiv} we analyze the conditions for weak, sectional and strong thresholds. Additionally a separate analysis is given for special case of positive semidefinite matrices. We conclude by discussing simulation results and future research directions.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 4 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Testing Unate Distributions

    cs.DS 2026-07 unverdicted novelty 8.0

    Unate distributions require θ̃(n^{3/2}) samples for uniformity testing and allow Õ(n^{3/2}) conditional samples for unateness testing in the subcube model.

  2. Universality in Learning from Linear Measurements

    math.ST 2019-06 unverdicted novelty 7.0

    The number of linear measurements for perfect structured signal recovery depends only on first and second moments of the measurement distribution, reducing analysis to the Gaussian case and yielding 3n measurements fo...

  3. High-Dimensional Statistics: Reflections on Progress and Open Problems

    math.ST 2026-05 unverdicted novelty 2.0

    A survey synthesizing representative advances, common themes, and open problems in high-dimensional statistics while pointing to key entry-point works.

  4. High-Dimensional Statistics: Reflections on Progress and Open Problems

    math.ST 2026-05 unverdicted novelty 2.0

    This review synthesizes representative advances in high-dimensional statistics, highlights common themes and open problems, and points to key entry works.