Nonconvex Optimization Meets Low-Rank Matrix Factorization: An Overview

Cited In (64)

Estimation of off-the grid sparse spikes with over-parametrized projected gradient descent: theory and application
Algorithmic Regularization in Model-Free Overparametrized Asymmetric Matrix Factorization
A new complexity metric for nonconvex rank-one generalized matrix completion
Low-Rank Univariate Sum of Squares Has No Spurious Local Minima
Stochastic nested primal-dual method for nonconvex constrained composition optimization
Restoration guarantee of image inpainting via low rank patch matrix completion
A Newton-CG based barrier-augmented Lagrangian method for general nonconvex conic optimization
A unified Bregman alternating minimization algorithm for generalized DC programs with application to imaging
Convex and Nonconvex Optimization Are Both Minimax-Optimal for Noisy Blind Deconvolution Under Random Designs
A theory of optimal convex regularization for low-dimensional recovery
Bayesian uncertainty quantification for low-rank matrix completion
Inference for heteroskedastic PCA with missing data
Analysis of asymptotic escape of strict saddle sets in manifold optimization
Sketched learning for image denoising
Title not available (Why is that?)
Nearly optimal bounds for the global geometric landscape of phase retrieval
Gradient descent with random initialization: fast global convergence for nonconvex phase retrieval
Smoothed amplitude flow-based phase retrieval algorithm
Low-rank matrix recovery with composite optimization: good conditioning and rapid convergence
Communication-Efficient Distributed Eigenspace Estimation
Title not available (Why is that?)
Implicit regularization in nonconvex statistical estimation: gradient descent converges linearly for phase retrieval, matrix completion, and blind deconvolution
Fast gradient method for low-rank matrix estimation
Noisy matrix completion: understanding statistical guarantees for convex relaxation via nonconvex optimization
An optimal statistical and computational framework for generalized tensor estimation
Nonconvex Matrix Factorization From Rank-One Measurements
Rank $2r$ Iterative Least Squares: Efficient Recovery of Ill-Conditioned Low Rank Matrices from Few Entries
A nonlinear matrix decomposition for mining the zeros of sparse data
Exact Recovery of Multichannel Sparse Blind Deconvolution via Gradient Descent
Sharp global convergence guarantees for iterative nonconvex optimization with random data
Non-convex exact community recovery in stochastic block model
Geometry of linear convolutional networks
Role of sparsity and structure in the optimization landscape of non-convex matrix sensing
Certifying the Absence of Spurious Local Minima at Infinity
Exponential-Family Embedding With Application to Cell Developmental Trajectories for Single-Cell RNA-Seq Data
Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm
Optimization landscape of Tucker decomposition
GNMR: a provable one-line algorithm for low rank matrix recovery
Analytical convergence regions of accelerated gradient descent in nonconvex optimization under regularity condition
Exact guarantees on the absence of spurious local minima for non-negative rank-1 robust principal component analysis
Subspace estimation from unbalanced and incomplete data matrices: ${\ell_{2,\infty}}$ statistical guarantees
Reconstruction of low-rank aggregation kernels in univariate population balance equations
Convergence of Random Reshuffling under the Kurdyka–Łojasiewicz Inequality
Low rank matrix recovery with adversarial sparse noise
A generalization of Wirtinger flow for exact interferometric inversion
Compressive learning for patch-based image denoising
Low-Rank Matrix Estimation from Rank-One Projections by Unlifted Convex Optimization
Nonconvex Low-Rank Tensor Completion from Noisy Data
Bridging convex and nonconvex optimization in robust PCA: noise, outliers and missing data
Nonsmooth rank-one matrix factorization landscape
Asymmetry helps: eigenvalue and eigenvector analyses of asymmetrically perturbed low-rank matrices
Second-order guarantees of distributed gradient algorithms
Analysis of the optimization landscape of Linear Quadratic Gaussian (LQG) control
A Riemannian rank-adaptive method for low-rank matrix completion
Structured Gradient Descent for Fast Robust Low-Rank Hankel Matrix Completion
Spurious Valleys, NP-Hardness, and Tractability of Sparse Matrix Factorization with Fixed Support
Matrix completion with nonconvex regularization: spectral operators and scalable algorithms
Recent Theoretical Advances in Non-Convex Optimization
Adversarial classification via distributional robustness with Wasserstein ambiguity
Optimization on low rank nonconvex structures
Nonconvex Robust Low-Rank Matrix Recovery
Median-truncated gradient descent: a robust and scalable nonconvex approach for signal estimation
Optimization for deep learning: an overview
Exact matrix completion based on low rank Hankel structure in the Fourier domain

This page was built for publication: Nonconvex Optimization Meets Low-Rank Matrix Factorization: An Overview

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5240484)