Finding Low-Rank Solutions via Nonconvex Matrix Factorization, Efficiently and Provably
From MaRDI portal
Publication:5230407
DOI10.1137/17M1150189zbMath1419.90065arXiv1606.03168WikidataQ129143393 ScholiaQ129143393MaRDI QIDQ5230407
Dohyung Park, Anastasios Kyrillidis, Constantine Caramanis, Sujay Sanghavi
Publication date: 22 August 2019
Published in: SIAM Journal on Imaging Sciences (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1606.03168
Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Nonconvex programming, global optimization (90C26)
Related Items (15)
An optimal statistical and computational framework for generalized tensor estimation ⋮ Sharp Restricted Isometry Bounds for the Inexistence of Spurious Local Minima in Nonconvex Matrix Recovery ⋮ Tensor Canonical Correlation Analysis With Convergence and Statistical Guarantees ⋮ Unnamed Item ⋮ Column $\ell_{2,0}$-Norm Regularized Factorization Model of Low-Rank Matrix Recovery and Its Computation ⋮ GNMR: A Provable One-Line Algorithm for Low Rank Matrix Recovery ⋮ Finding stationary points on bounded-rank matrices: a geometric hurdle and a smooth remedy ⋮ Median-Truncated Gradient Descent: A Robust and Scalable Nonconvex Approach for Signal Estimation ⋮ Decomposition into low-rank plus additive matrices for background/foreground separation: a review for a comparative evaluation with a large-scale dataset ⋮ Recovery of simultaneous low rank and two-way sparse coefficient matrices, a nonconvex approach ⋮ Error bound of critical points and KL property of exponent 1/2 for squared F-norm regularized factorization ⋮ $$L^p$$ Continuity and Microlocal Properties for Pseudodifferential Operators ⋮ Unnamed Item ⋮ On the Convergence of Projected-Gradient Methods with Low-Rank Projections for Smooth Convex Minimization over Trace-Norm Balls and Related Problems ⋮ Unnamed Item
Uses Software
Cites Work
- Unnamed Item
- Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
- Low-rank tensor completion by Riemannian optimization
- Statistical guarantees for the EM algorithm: from population to sample-based analysis
- A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
- Introductory lectures on convex optimization. A basic course.
- Templates for convex cone problems with applications to sparse signal recovery
- Optimization and dynamical systems
- Matrix recipes for hard thresholding methods
- Fixed-rank matrix factorizations and Riemannian low-rank optimization
- Local minima and convergence in low-rank semidefinite programming
- Phase recovery, MaxCut and complex semidefinite programming
- Exact matrix completion via convex optimization
- Limited Memory Block Krylov Subspace Optimization for Computing Dominant Singular Value Decompositions
- Normalized Iterative Hard Thresholding for Matrix Completion
- A Singular Value Thresholding Algorithm for Matrix Completion
- NESTA: A Fast and Accurate First-Order Method for Sparse Recovery
- Low-Rank Optimization on the Cone of Positive Semidefinite Matrices
- SYMMETRIC GAUGE FUNCTIONS AND UNITARILY INVARIANT NORMS
- The learnability of quantum states
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
- The Geometry of Algorithms with Orthogonality Constraints
- Probabilistic Principal Component Analysis
- ARPACK Users' Guide
- Optimal Approximate Matrix Product in Terms of Stable Rank
- 1-Bit matrix completion
- Symmetry, Saddle Points, and Global Optimization Landscape of Nonconvex Matrix Factorization
- Tight Oracle Inequalities for Low-Rank Matrix Recovery From a Minimal Number of Noisy Random Measurements
- ADMiRA: Atomic Decomposition for Minimum Rank Approximation
- Matrix Completion From a Few Entries
- Desingularization of Bounded-Rank Matrix Sets
- Framework for kernel regularization with application to protein clustering
- Restricted strong convexity and weighted matrix completion: Optimal bounds with noise
- Sparse Approximate Solutions to Semidefinite Programs
- Fast Monte Carlo Algorithms for Matrices I: Approximating Matrix Multiplication
- Low-rank matrix completion using alternating minimization
- Augmented Implicitly Restarted Lanczos Bidiagonalization Methods
- Phase Retrieval via Matrix Completion
This page was built for publication: Finding Low-Rank Solutions via Nonconvex Matrix Factorization, Efficiently and Provably
