Nonconvex Optimization Meets Low-Rank Matrix Factorization: An Overview
From MaRDI portal
Publication:5240484
Cited in
(78)- Sketched learning for image denoising
- Analysis of asymptotic escape of strict saddle sets in manifold optimization
- Estimation of off-the grid sparse spikes with over-parametrized projected gradient descent: theory and application
- scientific article; zbMATH DE number 7415093 (Why is no real title available?)
- Nearly optimal bounds for the global geometric landscape of phase retrieval
- Algorithmic Regularization in Model-Free Overparametrized Asymmetric Matrix Factorization
- Gradient descent with random initialization: fast global convergence for nonconvex phase retrieval
- Supervised factor modeling for high-dimensional linear time series
- Estimating Higher-Order Mixed Memberships via the l2,∞ Tensor Perturbation Bound
- Robust Matrix Completion with Heavy-Tailed Noise
- Nonconvex stochastic Bregman proximal gradient method with application to deep learning
- Smoothed amplitude flow-based phase retrieval algorithm
- Low-rank matrix recovery with composite optimization: good conditioning and rapid convergence
- Implicit regularization in nonconvex statistical estimation: gradient descent converges linearly for phase retrieval, matrix completion, and blind deconvolution
- Communication-Efficient Distributed Eigenspace Estimation
- scientific article; zbMATH DE number 7307468 (Why is no real title available?)
- Noisy matrix completion: understanding statistical guarantees for convex relaxation via nonconvex optimization
- An optimal statistical and computational framework for generalized tensor estimation
- Fast gradient method for low-rank matrix 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
- Non-convex exact community recovery in stochastic block model
- Exact Recovery of Multichannel Sparse Blind Deconvolution via Gradient Descent
- Role of sparsity and structure in the optimization landscape of non-convex matrix sensing
- Sharp global convergence guarantees for iterative nonconvex optimization with random data
- Geometry of linear convolutional networks
- Low-rank matrix completion with Poisson observations via nuclear norm and total variation constraints
- Exponential-Family Embedding With Application to Cell Developmental Trajectories for Single-Cell RNA-Seq Data
- Certifying the Absence of Spurious Local Minima at Infinity
- Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm
- Optimization landscape of Tucker decomposition
- A new complexity metric for nonconvex rank-one generalized matrix completion
- Low-Rank Univariate Sum of Squares Has No Spurious Local Minima
- GNMR: a provable one-line algorithm for low rank matrix recovery
- Analytical convergence regions of accelerated gradient descent in nonconvex optimization under regularity condition
- Asymptotic dynamics of alternating minimization for bilinear regression
- Exact guarantees on the absence of spurious local minima for non-negative rank-1 robust principal component analysis
- Robust sparse phase retrieval: statistical guarantee, optimality theory and convergent algorithm
- Accelerated gradient descent algorithm with golden section search for escaping saddle points in optimization problems
- Subspace estimation from unbalanced and incomplete data matrices: \({\ell_{2,\infty}}\) statistical guarantees
- Reconstruction of low-rank aggregation kernels in univariate population balance equations
- The power of preconditioning in overparameterized low-rank matrix sensing
- Stochastic nested primal-dual method for nonconvex constrained composition optimization
- Restoration guarantee of image inpainting via low rank patch matrix completion
- 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
- A Newton-CG based barrier-augmented Lagrangian method for general nonconvex conic optimization
- Compressive learning for patch-based image denoising
- Low-Rank Matrix Estimation from Rank-One Projections by Unlifted Convex Optimization
- Smooth optimization using global and local low-rank regularizers
- Bridging convex and nonconvex optimization in robust PCA: noise, outliers and missing data
- Nonconvex Low-Rank Tensor Completion from Noisy Data
- A unified Bregman alternating minimization algorithm for generalized DC programs with application to imaging
- Low solution rank of the matrix LASSO under RIP with consequences for rank-constrained algorithms
- 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
- A Riemannian rank-adaptive method for low-rank matrix completion
- Analysis of the optimization landscape of Linear Quadratic Gaussian (LQG) control
- 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
- Adversarial classification via distributional robustness with Wasserstein ambiguity
- Convex and Nonconvex Optimization Are Both Minimax-Optimal for Noisy Blind Deconvolution Under Random Designs
- Recent Theoretical Advances in Non-Convex Optimization
- A theory of optimal convex regularization for low-dimensional recovery
- Optimization on low rank nonconvex structures
- Sharp global guarantees for nonconvex low-rank recovery in the noisy overparameterized regime
- Nonconvex Robust Low-Rank Matrix Recovery
- Higher-order entrywise eigenvectors analysis of low-rank random matrices: bias correction, Edgeworth expansion and bootstrap
- Improved global guarantees for the nonconvex Burer-Monteiro factorization via rank overparameterization
- Median-truncated gradient descent: a robust and scalable nonconvex approach for signal estimation
- Exact matrix completion based on low rank Hankel structure in the Fourier domain
- Optimization for deep learning: an overview
- Bayesian uncertainty quantification for low-rank matrix completion
- Inference for heteroskedastic PCA with missing data
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)
