Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat

The DOI matches its Crossref record; 267 of the 279 references it cites were found in a registry or an index.

Nonconvex Optimization Meets Low-Rank Matrix Factorization: An Overview

Open access
Chi, Yuejie, Lu, Yue M., Chen, Yuxin · 2019 · IEEE Transactions on Signal Processing

Abstract

Substantial progress has been made recently on developing provably accurate and efficient algorithms for low-rank matrix factorization via nonconvex optimization. While conventional wisdom often takes a dim view of nonconvex optimization algorithms due to their susceptibility to spurious local minima, simple iterative methods such as gradient descent have been remarkably successful in practice. The theoretical footings, however, had been largely lacking until recently. In this tutorial-style overview, we highlight the important role of statistical models in enabling efficient nonconvex optimization with performance guarantees. We review two contrasting approaches: (1) two-stage algorithms, which consist of a tailored initialization step followed by successive refinement; and (2) global landscape analysis and initialization-free algorithms. Several canonical matrix factorization problems are discussed, including but not limited to matrix sensing, phase retrieval, matrix completion, blind deconvolution, and robust principal component analysis. Special care is taken to illustrate the key technical insights underlying their analyses. This article serves as a testament that the integrated consideration of optimization and statistics leads to fruitful research findings.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/tsp.2019.2937282

Cites

267 of 267 references verified0 citation errors · 0 not checkable

Statistics

Figures

Fig. 1 An example of f ( · ) taken from [21]. Here, f ( x ) = x 2 if x ∈ [ -6 , 6] and f ( x ) = x 2 +1 . 5 | x | (cos( | x | -6) -1) if | x | > 6 . It satisfies RC ( μ, λ , ζ ) with some μ, λ > 0 and ζ = ∞ , but is clearly nonconvex.
Fig. 1 An example of f ( · ) taken from [21]. Here, f ( x ) = x 2 if x ∈ [ -6 , 6] and f ( x ) = x 2 +1 . 5 | x | (cos( | x | -6) -1) if | x | > 6 . It satisfies RC ( μ, λ , ζ ) with some μ, λ > 0 and ζ = ∞ , but is clearly nonconvex.CC-BY · From the PDF
Fig. 2 Illustration of the function f ( x ) = 1 4 ‖ xx ⊤ -M ‖ 2 F , where x = [ x 1 , x 2 ] ⊤ and M =[ 1 -0 . 5 -0 . 5 1 ] .
Fig. 2 Illustration of the function f ( x ) = 1 4 ‖ xx ⊤ -M ‖ 2 F , where x = [ x 1 , x 2 ] ⊤ and M =[ 1 -0 . 5 -0 . 5 1 ] .CC-BY · From the PDF
Fig. 3 The GD iterates and the locally strongly convex and smooth region (the shaded region). (Left) When this region is an ℓ 2 ball, standard GD theory implies ℓ 2 convergence. (Right) When this region is a polytope, the implicit regularization phenomenon implies that GD iterates stay within this nice region.
Fig. 3 The GD iterates and the locally strongly convex and smooth region (the shaded region). (Left) When this region is an ℓ 2 ball, standard GD theory implies ℓ 2 convergence. (Right) When this region is a polytope, the implicit regularization phenomenon implies that GD iterates stay within this nice region.CC-BY · From the PDF
Fig. 4 Comparisons of 3 designs of the preprocessing function for estimating a 64 × 64 cameraman image from phaseless measurements under Poisson noise. (Red curve) the subset scheme in (119), where the parameter γ has been optimized for each fixed α ; (Green curve) the function T ∗ α ( · ) defined in [129]; (Blue curve) the uniformly optimal design T ∗ ( · ) in [130].
Fig. 4 Comparisons of 3 designs of the preprocessing function for estimating a 64 × 64 cameraman image from phaseless measurements under Poisson noise. (Red curve) the subset scheme in (119), where the parameter γ has been optimized for each fixed α ; (Green curve) the function T ∗ α ( · ) defined in [129]; (Blue curve) the uniformly optimal design T ∗ ( · ) in [130].CC-BY · From the PDF

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 279 references

Research works printed but not linked: 5

  1. allen-zhu, 0, Proc Neural Inf Process Syst, 3716
  2. qu, 0, Convolutional phase retrieval, Proc Neural Inf Process Syst, 6086
  3. allen-zhu, 2017, Recent advances in stochastic convex and non-convex optimization, ICML Tut
  4. duchi, 0, Efficient projections onto the $\ell _1$-ball for learning in high dimensions, Proc Int Conf Mach Learn, 272
  5. zhao, 0, Proc Adv Neural Inf Process Syst, 559

Cited by

See all 390

Metadata

Authors
Chi, Y., Lu, Y. M., & Chen, Y.
Affiliations
  • Carnegie Mellon University (US)
  • Harvard University (US)
  • Princeton University (US)
Venue
IEEE Transactions on Signal Processing
Published
2019-10-15
Volume
67
Issue
20
Pages
5239-5269
ISSN
  • 1053-587X (ISSN-L)
  • 1941-0476
OpenAlex
W2969215180
Cited by
360
References
279
Citations by year
2026: 20 · 2025: 33 · 2024: 36 · 2023: 50 · 2022: 40 · 2021: 80 · 2020: 65 · 2019: 32
FWCI
37.03
Type
journal article
Language
en
Open access
Locations
  • IEEE Transactions on Signal Processing (publishedVersion, cc-by)
  • arXiv (Cornell University) (submittedVersion)
  • arXiv (Cornell University)
Funders
  • Office of Naval Research (N00014-18-1-2142, N00014-19-1-2404)
  • Army Research Office (W911NF-18-1-0303)
  • Air Force Office of Scientific Research (FA9550-15-1-0205)
  • National Science Foundation (CCF-1901199, CCF-1806154, ECCS-1818571, CCF-1718698, CCF-1910410, CCF-1907661, IIS-1900140)
  • Harvard Dean's Competitive Fund for Promising Research
  • AFOSR (YIP FA9550-19-1-0030)
  • ARO (W911NF-18-1-0303)
  • ONR (N00014-19-1-2120)
Topics
  • Physical Sciences › Computer Science › Signal Processing › Sparse and Compressive Sensing Techniques
  • Physical Sciences › Computer Science › Artificial Intelligence › Stochastic Gradient Optimization Techniques
  • Physical Sciences › Mathematics › Numerical Analysis › Advanced Optimization Algorithms Research
Keywords
non-convex optimization, low-rank factorization, statistical models, spurious local minima, two-stage algorithm, matrix sensing, phase retrieval, matrix completion, blind deconvolution, robust principal component analysis, performance guarantees

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Nonconvex Optimization Meets Low-Rank Matrix Factorization: An Overview. https://app.cochat.ai/papers/10.1109/tsp.2019.2937282
The paper
Chi, Y., Lu, Y. M., & Chen, Y. (2019). Nonconvex Optimization Meets Low-Rank Matrix Factorization: An Overview. IEEE Transactions on Signal Processing. https://doi.org/10.1109/tsp.2019.2937282

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.